Collective classification with relational dependency networks
Published 1 January 2003
Jennifer Neville, David Jensen
Citations103
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper presents relational dependency networks (RDNs), a collective classification model that offers simple parameter estimation and efficient structure learning and shows that collective classification improves performance.
Abstract
this paper, we present relational dependency networks (RDNs), extending recent work in dependency networks to a relational setting
Keywords
Computer SciencePhysics and Astronomy
ScholarlyCommons (University of Pennsylvania)Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
12,978 Citations2001John Lafferty, Andrew McCallum +1 more
This work presents iterative parameter estimation algorithms for conditional random fields and compares the performance of the resulting models to HMMs and MEMMs on synthetic and natural-language data.
Journal of the ACMAuthoritative sources in a hyperlinked environment
9,060 Citations1999Jon Kleinberg
This work proposes and test an algorithmic formulation of the notion of authority, based on the relationship between a set of relevant authoritative pages and the set of “hub pages” that join them together in the link structure, and has connections to the eigenvectors of certain matrices associated with the link graph.
Mining the network value of customers
2,868 Citations2001Pedro Domingos, Matt Richardson
It is proposed to model also the customer's network value: the expected profit from sales to other customers she may influence to buy, the customers those may influence, and so on recursively, taking advantage of the availability of large relevant databases.
arXiv (Cornell University)Loopy Belief Propagation for Approximate Inference: An Empirical Study
1,468 Citations2013Kevin P. Murphy, Yair Weiss +1 more
IEEE Transactions on Pattern Analysis and Machine IntelligenceInducing features of random fields
1,044 Citations1997S. Della Pietra, V. Della Pietra +1 more
The random field models and techniques introduced in this paper differ from those common to much of the computer vision literature in that the underlying random fields are non-Markovian and have a large number of parameters that must be estimated.
Learning Probabilistic Relational Models
941 Citations2001Lise Getoor, Nir Friedman +2 more
Enhanced hypertext categorization using hyperlinks
775 Citations1998Soumen Chakrabarti, Byron Dom +1 more
This work has developed a text classifier that misclassified only 13% of the documents in the well-known Reuters benchmark; this was comparable to the best results ever obtained and its technique also adapts gracefully to the fraction of neighboring documents having known topics.
Discriminative probabilistic models for relational data
637 Citations2002Ben Taskar, Pieter Abbeel +1 more
Iterative Classification in Relational Data
306 Citations2000Jennifer Neville, David Jensen
An iterative classification approach that uses simple Bayesian classifiers in an iterative fashion, dynamically upd ating the attributes of some objects as inferences are made about related ob jects.
Learning relational probability trees
215 Citations2003Jennifer Neville, David Jensen +2 more
This paper presents an algorithm for learning the structure and parameters of an RPT that searches over a space of relational features that use aggregation functions to dynamically propositionalize relational data and create binary splits within the RPT.
Lecture notes in computer scienceCommunities of Interest
191 Citations2001Corinna Cortes, Daryl Pregibon +1 more
A machine learning approach to building domain-specific search engines
183 Citations1999Andrew McCallum, Kamal Nigam +2 more
The use of machine learning techniques are proposed to greatly automate the creation and maintenance of domain-specific search engines and new research in reinforcement learning, text classification and information extraction that enables efficient spidering, populates topic hierarchies, and identifies informative text segments is described.
Avoiding bias when aggregating relational data with degree disparity
32 Citations2003David Jensen, Jennifer Neville +1 more
It is shown how two novel hypothesis testing procedures can adjust for the effects of using aggregation functions in the presence of degree disparity, which can lead relational learning algorithms to discover misleading correlations.