|
|
|
     |
                                         |
Return to Theory 3
This paper develops a general, formal framework for modeling term dependencies via Markov random fields. The model allows for arbitrary text features to be incorporated as evidence. In particular, we make use of features based on occurrences of single terms, ordered phrases, and unordered phrases. We explore full independence, sequential dependence, and full dependence variants of the model. A novel approach is developed to train the model that directly maximizes the mean average precision rather than maximizing the likelihood of the training data. Ad hoc retrieval experiments are presented on several newswire and web collections, including the GOV2 collection used at the TREC 2004 Terabyte Track. The results show significant improvements are possible by modeling dependencies, especially on the larger web collections.
@inproceedings{1076115, author = {Donald Metzler and W. Bruce Croft}, title = {A Markov random field model for term dependencies}, booktitle = {SIGIR '05: Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval}, year = {2005}, isbn = {1-59593-034-5}, pages = {472--479}, location = {Salvador, Brazil}, doi = {http://doi.acm.org/10.1145/1076034.1076115}, publisher = {ACM Press}, address = {New York, NY, USA}, }  ©2006 Association for Computing Machinery |
