loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Third IEEE International Conference on Data Mining (ICDM'03)
Statistical Relational Learning for Document Mining
Melbourne, Florida
November 19-November 22
ISBN: 0-7695-1978-4
Alexandrin Popescul, University of Pennsylvania, Philadelphia
Lyle H. Ungar, University of Pennsylvania, Philadelphia
Steve Lawrence, Google, Mountain View, CA
David M. Pennock, Overture Services, Inc., Pasadena, CA
A major obstacle to fully integrated deployment of many data mining algorithms is the assumption that data sits in a single table, even though most real-world databases have complex relational structures. We propose an integrated approach to statistical modeling from relational databases. We structure the search space based on "refinement graphs", which are widely used in inductive logic programming for learning logic descriptions. The use of statistics allows us to extend the search space to include richer set of features, including many which are not boolean. Search and model selection are integrated into a single process, allowing information criteria native to the statistical model, for example logistic regression, to make feature selection decisions in a step-wise manner. We present experimental results for the task of predicting where scientific papers will be published based on relational data taken from CiteSeer. Our approach results in classification accuracies superior to those achieved when using classical "flat" features. The resulting classifier can be used to recommend where to publish articles.
Citation:
Alexandrin Popescul, Lyle H. Ungar, Steve Lawrence, David M. Pennock, "Statistical Relational Learning for Document Mining," icdm, pp.275, Third IEEE International Conference on Data Mining (ICDM'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.