|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
Query Representation through Lexical Association for Information Retrieval
Dec. 2012 (vol. 24 no. 12)
pp. 2260-2273
| ASCII Text | x | ||
| Pawan Goyal, Laxmidhar Behera, Thomas Martin McGinnity, "Query Representation through Lexical Association for Information Retrieval," IEEE Transactions on Knowledge and Data Engineering, vol. 24, no. 12, pp. 2260-2273, Dec., 2012. | |||
| BibTex | x | ||
| @article{ 10.1109/TKDE.2011.171, author = {Pawan Goyal and Laxmidhar Behera and Thomas Martin McGinnity}, title = {Query Representation through Lexical Association for Information Retrieval}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {24}, number = {12}, issn = {1041-4347}, year = {2012}, pages = {2260-2273}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2011.171}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Knowledge and Data Engineering TI - Query Representation through Lexical Association for Information Retrieval IS - 12 SN - 1041-4347 SP2260 EP2273 EPD - 2260-2273 A1 - Pawan Goyal, A1 - Laxmidhar Behera, A1 - Thomas Martin McGinnity, PY - 2012 KW - Mathematical model KW - Equations KW - Correlation KW - Information retrieval KW - Context KW - Markov processes KW - Indexes KW - language model KW - Information retrieval KW - lexical association KW - query expansion VL - 24 JA - IEEE Transactions on Knowledge and Data Engineering ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2011.171
Web Extra: View Supplemental Material(PDF)
A user query for information retrieval (IR) applications may not contain the most appropriate terms (words) as actually intended by the user. This is usually referred to as the term mismatch problem and is a crucial research issue in IR. Using the notion of relevance, we provide a comprehensive theoretical analysis of a parametric query vector, which is assumed to represent the information needs of the user. A lexical association function has been derived analytically using the system relevance criteria. The derivation is further justified using an empirical evidence from the user relevance criteria. Such analytical derivation as presented in this paper provides a proper mathematical framework to the query expansion techniques, which have largely been heuristic in the existing literature. By using the generalized retrieval framework, the proposed query representation model is equally applicable to the vector space model (VSM), Okapi best matching 25 (Okapi BM25), and Language Model (LM). Experiments over various data sets from TREC show that the proposed query representation gives statistically significant improvements over the baseline Okapi BM25 and LM as well as other well-known global query expansion techniques. Empirical results along with the theoretical foundations of the query representation confirm that the proposed model extends the state of the art in global query expansion.
Index Terms:
Mathematical model,Equations,Correlation,Information retrieval,Context,Markov processes,Indexes,language model,Information retrieval,lexical association,query expansion
Citation:
Pawan Goyal, Laxmidhar Behera, Thomas Martin McGinnity, "Query Representation through Lexical Association for Information Retrieval," IEEE Transactions on Knowledge and Data Engineering, vol. 24, no. 12, pp. 2260-2273, Dec. 2012, doi:10.1109/TKDE.2011.171
Usage of this product signifies your acceptance of the Terms of Use.

