On modeling of information retrieval concepts in vector spaces
ACM Transactions on Database Systems (TODS)
An information-theoretic approach to automatic query expansion
ACM Transactions on Information Systems (TOIS)
Dependence Among Terms in Vector Space Model
IDEAS '04 Proceedings of the International Database Engineering and Applications Symposium
Set-based vector model: An efficient approach for correlation-based ranking
ACM Transactions on Information Systems (TOIS)
Optimisation methods for ranking functions with multiple parameters
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Query reformulation using automatically generated query concepts from a document space
Information Processing and Management: an International Journal
CLEF 2008: ad hoc track overview
CLEF'08 Proceedings of the 9th Cross-language evaluation forum conference on Evaluating systems for multilingual and multimodal information access
Using wordnet relations and semantic classes in information retrieval tasks
CLEF'09 Proceedings of the 10th cross-language evaluation forum conference on Multilingual information access evaluation: text retrieval experiments
Using semantic relatedness and word sense disambiguation for (CL)IR
CLEF'09 Proceedings of the 10th cross-language evaluation forum conference on Multilingual information access evaluation: text retrieval experiments
Elhuyar-IXA: semantic relatedness and cross-lingual passage retrieval
CLEF'09 Proceedings of the 10th cross-language evaluation forum conference on Multilingual information access evaluation: text retrieval experiments
| Hi-index | 0.00 |
Much current research in IR, Web-Search and Semantic-Web technologies aims at enriching the user query to gain a richer, more semantic understanding of the information need. Almost in all cases this query enrichment step is approached independently of the ranking function; however, this may be far from optimal. In this paper we discuss the problem of term dependency in the context of query expansion and show its dangers in a number of empirical evaluations. Furthermore we propose a simple method (query clauses) that can be applied to several standard ranking functions to exploit a simple type of term dependency.