• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

DMCA

A Markov random field model for term dependencies

Cached

  • Download as a PDF

Download Links

  • [www.iro.umontreal.ca]
  • [www-labs.iro.umontreal.ca]
  • [goanna.cs.rmit.edu.au]
  • [goanna.cs.rmit.edu.au]
  • [lintool.github.io]
  • [ciir.cs.umass.edu]
  • [maroo.cs.umass.edu]
  • [ciir-publications.cs.umass.edu]
  • [maroo.cs.umass.edu]
  • [don-metzler.net]
  • [www.ccs.neu.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Donald Metzler , W. Bruce Croft
Citations:288 - 55 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Metzler_amarkov,
    author = {Donald Metzler and W. Bruce Croft},
    title = {A Markov random field model for term dependencies},
    year = {}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

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.

Keyphrases

term dependency    markov random field model    web collection    several newswire    formal framework    terabyte track    gov2 collection    markov random field    training data    full dependence variant    sequential dependence    ad hoc retrieval experiment    significant improvement    mean average precision    full independence    arbitrary text feature    single term    unordered phrase    novel approach   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University