000 06913nam a22007091i 4500
001 8585440
003 IEEE
005 20200413152928.0
006 m eo d
007 cr cn |||m|||a
008 190103s2019 caua foab 000 0 eng d
020 _a9781681734736
_qebook
020 _z9781681734743
_qhardcover
020 _z9781681734729
_qpaperback
024 7 _a10.2200/S00887ED1V01Y201811ICR065
_2doi
035 _a(CaBNVSL)swl000408884
035 _a(OCoLC)1080937311
040 _aCaBNVSL
_beng
_erda
_cCaBNVSL
_dCaBNVSL
050 4 _aZA3075
_b.L676 2019
082 0 4 _a028.7071
_223
100 1 _aLosee, Robert M.
_q(Robert MacLean),
_d1952-,
_eauthor.
245 1 0 _aPredicting information retrieval performance /
_cRobert M. Losee.
264 1 _a[San Rafael, California] :
_bMorgan & Claypool,
_c2019.
300 _a1 PDF (xix, 59 pages) :
_billustrations.
336 _atext
_2rdacontent
337 _aelectronic
_2isbdmedia
338 _aonline resource
_2rdacarrier
490 1 _aSynthesis lectures on information concepts, retrieval, and services,
_x1947-9468 ;
_v# 65
538 _aMode of access: World Wide Web.
538 _aSystem requirements: Adobe Acrobat Reader.
500 _aPart of: Synthesis digital library of engineering and computer science.
504 _aIncludes bibliographical references (pages 57-58).
505 0 _a1. Information retrieval: a predictive science -- 1.1 Rules, measures, and science -- 1.2 The science of information retrieval --
505 8 _a2. Probabilities and probabilistic information retrieval -- 2.1 Probabilities -- 2.2 Probabilistic retrieval -- 2.2.1 Bayes rule -- 2.3 Describing a probability --
505 8 _a3. Information retrieval performance measures -- 3.1 Precision and recall -- 3.1.1 Precision -- 3.1.2 Recall -- 3.2 Precision-recall graphs -- 3.2.1 High-precision systems and high-recall systems -- 3.2.2 Generality and fallout -- 3.3 High-precision performance measures -- 3.3.1 Mean average precision -- 3.3.2 Precision at k -- 3.3.3 Discounted cumulative gain -- 3.3.4 F measure -- 3.3.5 Mean reciprocal rank -- 3.4 Receiver operating characteristic -- 3.5 Search lengths -- 3.5.1 Expected search length -- 3.5.2 Average search length and the expected position of a relevant document -- 3.6 Summary --
505 8 _a4. Single-term performance -- 4.1 A single binary term -- 4.2 Average search length and expected position of a relevant document -- 4.3 Probability of optimal ranking (Q) -- 4.3.1 Developing Q -- 4.3.2 Best-case ranking -- 4.3.3 Interpreting Pr(p > t) -- 4.3.4 Worst-case ranking -- 4.3.5 Random ranking -- 4.3.6 Q and ranking by inverse document frequency weighting -- 4.3.7 Q and ranking by decision-theoretic weighting -- 4.4 Expected position of a relevant document given Q and A values -- 4.4.1 Best- and worst-case performance -- 4.5 General discrete single feature distribution models -- 4.5.1 Binary feature model -- 4.5.2 A single Poisson feature -- 4.6 General continuous feature distribution models -- 4.6.1 Normal distribution -- 4.7 Advanced models of Q -- 4.7.1 Point probabilities -- 4.7.2 Distribution instead of a point probability -- 4.7.3 Inaccurate knowledge about a distribution -- 4.8 Predicting performance with high precision retrieval -- 4.8.1 A changing for different segments of an ordering -- 4.9 Summary --
505 8 _a5. Performance with multiple binary features -- 5.1 Partial dependence -- 5.1.1 Maximum spanning tree -- 5.1.2 Simple maximum spanning trees -- 5.1.3 Partial dependencies with Bahadur Lazarsfeld and generalized dependence models -- 5.2 Singular value decomposition -- 5.3 Teugels' models for full dependence -- 5.3.1 Covariances to probabilities -- 5.3.2 Averages to probabilities -- 5.3.3 Probabilities to covariances -- 5.3.4 Probabilities to averages -- 5.4 Example with documents -- 5.5 Predicting performance with feature dependence -- 5.6 Validation -- 5.7 Feature independence -- 5.8 Summary --
505 8 _a6. Applications: metadata and linguistic labels -- 6.1 Metadata and indexing -- 6.1.1 Assigning terms to relevant documents -- 6.1.2 Not assigning terms to relevant documents -- 6.1.3 Not assigning terms to non-relevant documents -- 6.1.4 Incorrectly assigning terms to non-relevant document -- 6.2 Validating metadata rules -- 6.3 Natural language part-of-speech tags -- 6.3.1 Best- and worst-case performance with tags -- 6.4 Summary --
505 8 _a7. Conclusion -- A. Variables -- Bibliography -- Author's biography.
506 _aAbstract freely available; full-text restricted to subscribers or individual document purchasers.
510 0 _aCompendex
510 0 _aINSPEC
510 0 _aGoogle scholar
510 0 _aGoogle book search
520 3 _aInformation Retrieval performance measures are usually retrospective in nature, representing the effectiveness of an experimental process. However, in the sciences, phenomena may be predicted, given parameter values of the system. After developing a measure that can be applied retrospectively or can be predicted, performance of a system using a single term can be predicted given several different types of probabilistic distributions. Information Retrieval performance can be predicted with multiple terms, where statistical dependence between terms exists and is understood. These predictive models may be applied to realistic problems, and then the results may be used to validate the accuracy of the methods used. The application of metadata or index labels can be used to determine whether or not these features should be used in particular cases. Linguistic information, such as part-of-speech tag information, can increase the discrimination value of existing terminology and can be studied predictively. This work provides methods for measuring performance that may be used predictively. Means of predicting these performance measures are provided, both for the simple case of a single term in the query and for multiple terms. Methods of applying these formulae are also suggested.
530 _aAlso available in print.
588 _aTitle from PDF title page (viewed on January 3, 2019).
650 0 _aInformation retrieval
_xEvaluation.
653 _aInformation Retrieval
653 _aperformance measures
653 _ascience
653 _apredicting performance
653 _asingle term models
653 _astatistical feature dependence
653 _amultiple features
653 _ametadata performance
653 _anatural language performance measures
776 0 8 _iPrint version:
_z9781681734729
_z9781681734743
830 0 _aSynthesis digital library of engineering and computer science.
830 0 _aSynthesis lectures on information concepts, retrieval, and services ;
_v# 65.
_x1947-9468
856 4 2 _3Abstract with links to resource
_uhttps://ieeexplore.ieee.org/servlet/opac?bknumber=8585440
999 _c562338
_d562338