000 05083nam a22004695i 4500
999 _c387768
_d387768
001 387768
003 ES-MaUEC
005 20230401201047.0
006 a||||fo|||| 00| 0
007 cr nn 008mamaa
008 220601s2020 sz | s |||| 0|eng d
020 _a9783031023231
024 7 _a10.1007/978-3-031-02323-1
_2doi
040 _aES-MaUEC
_bspa
_cES-MaUEC
_dES-MaUEC
050 4 _aQA76.9.T48
_b2020 EB
100 1 _aHawking, David
_eautor
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_9687981
_c(Applied scientist)
245 1 0 _aSimulating Information Retrieval Test Collections
_cby David Hawking, Bodo Billerbeck, Paul Thomas, Nick Craswell
250 _a1st edition 2020
264 1 _aCham
_bSpringer International Publishing
_c2020
300 _a1 recurso en línea (XXI, 162 páginas)
336 _atexto
_btxt
_2rdacontent
337 _aelectrónico
_bc
_2rdamedia
338 _arecurso electrónico
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
490 0 _aSynthesis Lectures on Information Concepts Retrieval and Services
_x1947-9468
505 0 _aAcknowledgments -- Symbols -- Introduction -- Evaluation Approaches -- Modeling Document Lengths -- Modeling Word Frequencies, Assuming Independence -- Modeling Term Dependence -- Modeling Word Strings -- Models of Corpus Growth -- Generation of Compatible Queries -- Proof of the Simulation Pudding -- Speed of Operation -- Leaking Confidential Information -- Discussion, Conclusions,\nobreakspace { -- Bibliography -- Authors' Biographies.
520 _aSimulated test collections may find application in situations where real datasets cannot easily be accessed due to confidentiality concerns or practical inconvenience. They can potentially support Information Retrieval (IR) experimentation, tuning, validation, performance prediction, and hardware sizing. Naturally, the accuracy and usefulness of results obtained from a simulation depend upon the fidelity and generality of the models which underpin it. The fidelity of emulation of a real corpus is likely to be limited by the requirement that confidential information in the real corpus should not be able to be extracted from the emulated version. We present a range of methods exploring trade-offs between emulation fidelity and degree of preservation of privacy. We present three different simple types of text generator which work at a micro level: Markov models, neural net models, and substitution ciphers. We also describe macro level methods where we can engineer macro properties of a corpus, giving a range of models for each of the salient properties: document length distribution, word frequency distribution (for independent and non-independent cases), word length and textual representation, and corpus growth. We present results of emulating existing corpora and for scaling up corpora by two orders of magnitude. We show that simulated collections generated with relatively simple methods are suitable for some purposes and can be generated very quickly. Indeed it may sometimes be feasible to embed a simple lightweight corpus generator into an indexer for the purpose of efficiency studies. Naturally, a corpus of artificial text cannot support IR experimentation in the absence of a set of compatible queries. We discuss and experiment with published methods for query generation and query log emulation. We present a proof-of-the-pudding study in which we observe the predictive accuracy of efficiency and effectiveness results obtained on emulated versions of TREC corpora. The study includes three open-source retrieval systems and several TREC datasets. There is a trade-off between confidentiality and prediction accuracy and there are interesting interactions between retrieval systems and datasets. Our tentative conclusion is that there are emulation methods which achieve useful prediction accuracy while providing a level of confidentiality adequate for many applications. Many of the methods described here have been implemented in the open source project SynthaCorpus, accessible at: https://bitbucket.org/davidhawking/synthacorpus/.
988 _aSynthesis Collection of Technology_2020
650 7 _2embne
_9140996
_aDerecho a la intimidad
650 7 _2embne
_9141188
_aProceso de textos
650 7 _2embne
_9147823
_aRecuperación de la información
700 1 _aBillerbeck, Bodo
_eautor
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_9687982
700 1 _aThomas, Paul
_eautor
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_9687983
700 1 _aCraswell, Nick
_eautor
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_9687984
776 0 8 _iPrinted edition:
_z9783031002304
776 0 8 _iPrinted edition:
_z9783031011955
776 0 8 _iPrinted edition:
_z9783031034510
856 4 0 _uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-02323-1
_zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942 _2lcc
_cLE
998 _b04/2023
_dz
_esc
_zSI