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

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Probabilistic classification and clustering in relational data (2001)

Cached

  • Download as a PDF

Download Links

  • [genie.weizmann.ac.il]
  • [robotics.stanford.edu]
  • [ai.stanford.edu]
  • [robotics.stanford.edu]
  • [robotics.stanford.edu]
  • [robotics.stanford.edu]
  • [ai.stanford.edu]
  • [www.cis.upenn.edu]
  • [www.seas.upenn.edu]
  • [homes.cs.washington.edu]
  • [www.seas.upenn.edu]
  • [homes.cs.washington.edu]
  • [robotics.stanford.edu]
  • [www.eecs.berkeley.edu]
  • [www.cs.berkeley.edu]
  • [www.susaaland.dk]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Ben Taskar
Venue:In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence
Citations:127 - 4 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Taskar01probabilisticclassification,
    author = {Ben Taskar},
    title = {Probabilistic classification and clustering in relational data},
    booktitle = {In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence},
    year = {2001},
    pages = {870--878}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Supervised and unsupervised learning methods have traditionally focused on data consisting of independent instances of a single type. However, many real-world domains are best described by relational models in which instances of multiple types are related to each other in complex ways. For example, in a scientific paper domain, papers are related to each other via citation, and are also related to their authors. In this case, the label of one entity (e.g., the topic of the paper) is often correlated with the labels of related entities. We propose a general class of models for classification and clustering in relational domains that capture probabilistic dependencies between related instances. We show how to learn such models efficiently from data. We present empirical results on two real world data sets. Our experiments in a transductive classification setting indicate that accuracy can be significantly improved by modeling relational dependencies. Our algorithm automatically induces a very natural behavior, where our knowledge about one instance helps us classify related ones, which in turn help us classify others. In an unsupervised setting, our models produced coherent clusters with a very natural interpretation, even for instance types that do not have any attributes. 1

Keyphrases

relational data    probabilistic classification    instance type    natural behavior    independent instance    real world data set    related entity    relational domain    relational model    natural interpretation    related one    capture probabilistic dependency    related instance    complex way    transductive classification    general class    many real-world domain    single type    scientific paper domain    multiple type    unsupervised learning method    present empirical result    relational dependency    coherent cluster    unsupervised setting   

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