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

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Discriminative probabilistic models for relational data (2002)

Cached

Download Links

  • [www.biostat.wisc.edu]
  • [www.cis.temple.edu]
  • [www.cis.temple.edu]
  • [www.cis.upenn.edu]
  • [www.seas.upenn.edu]
  • [homes.cs.washington.edu]
  • [www.seas.upenn.edu]
  • [homes.cs.washington.edu]
  • [www.cs.umd.edu]
  • [www.cs.umd.edu]
  • [www.cs.umd.edu]
  • [ai.stanford.edu]
  • [robotics.stanford.edu]
  • [robotics.stanford.edu]
  • [ai.stanford.edu]
  • [robotics.stanford.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Ben Taskar
Citations:411 - 12 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Taskar02discriminativeprobabilistic,
    author = {Ben Taskar},
    title = {Discriminative probabilistic models for relational data},
    booktitle = {},
    year = {2002},
    pages = {485--492}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

In many supervised learning tasks, the entities to be labeled are related to each other in complex ways and their labels are not independent. For example, in hypertext classification, the labels of linked pages are highly correlated. A standard approach is to classify each entity independently, ignoring the correlations between them. Recently, Probabilistic Relational Models, a relational version of Bayesian networks, were used to define a joint probabilistic model for a collection of related entities. In this paper, we present an alternative framework that builds on (conditional) Markov networks and addresses two limitations of the previous approach. First, undirected models do not impose the acyclicity constraint that hinders representation of many important relational dependencies in directed models. Second, undirected models are well suited for discriminative training, where we optimize the conditional likelihood of the labels given the features, which generally improves classification accuracy. We show how to train these models effectively, and how to use approximate probabilistic inference over the learned model for collective classification of multiple related entities. We provide experimental results on a webpage classification task, showing that accuracy can be significantly improved by modeling relational dependencies. 1

Keyphrases

relational data    discriminative probabilistic model    undirected model    discriminative training    probabilistic relational model    collective classification    hypertext classification    relational dependency    related entity    acyclicity constraint    approximate probabilistic inference    directed model    alternative framework    standard approach    many important relational dependency    complex way    joint probabilistic model    conditional likelihood    bayesian network    relational version    classification accuracy    webpage classification task    markov network    learned model    previous approach    multiple related entity    experimental result   

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-2016 The Pennsylvania State University