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

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Simple decision forests for multi-relational classification,” Decision Support Systems (2013)

by B Bina, O Schulte, B Crawford, Z Qian, Y Xiong
Add To MetaCart

Tools

Sorted by:
Results 1 - 2 of 2

A Hierarchy of Independence Assumptions for Multi-relational Bayes Net Classifiers

by Oliver Schulte, Bahareh Bina, En Crawford, Derek Bingham, Yi Xiong
"... Abstract—Many databases store data in relational format, with different types of entities and information about their attributes and links between the entities. Link-based classification (LBC) is the problem of predicting the class attribute of a target entity given the attributes of entities linked ..."
Abstract - Add to MetaCart
Abstract—Many databases store data in relational format, with different types of entities and information about their attributes and links between the entities. Link-based classification (LBC) is the problem of predicting the class attribute of a target entity given the attributes of entities linked to it. In this paper we propose a new relational Bayes net classifier method for LBC, which assumes that different links of an object are independently drawn from the same distribution, given attribute information from the linked tables. We show that this assumption allows very fast multi-relational Bayes net learning. We define three more independence assumptions for LBC to unify proposals from different researchers in a single novel hierarchy. Our proposed model is at the top and the wellknown multi-relational Naive Bayes classifier is at the bottom of this hierarchy. The model in each level of the hierarchy uses a new independence assumption in addition to the assumptions used in the higher levels. In experiments on four benchmark datasets, our proposed link independence model has the best predictive accuracy compared to the hierarchy models and a variety of relational classifiers.
(Show Context)

Citation Context

...tity attribute values are denoted as E attsi,r. Figure 2 shows the R keys, R atts, E atts, T atts division of the columns of join table J2. Table Row R keys R atts E atts T atts J2,1 [jack,101] [A,1] =-=[3,1]-=- [3,1] J3,1 [jack,101,oliver] [A,1,5] [3,1,3,1] [3,1] TABLE II EXAMPLES OF NOTATION FOR VALUE TUPLES. D. Probabilities and Relational Structures. Most models in statistical-relational learning (SRL) c...

Aggregating Predictions vs. Aggregating Features for Relational Classification

by Oliver Schulte, Kurt Routley
"... Abstract—Relational data classification is the problem of predicting a class label of a target entity given information about features of the entity, of the related entities, or neighbors, and of the links. This paper compares two fundamental approaches to relational classification: aggregating the ..."
Abstract - Add to MetaCart
Abstract—Relational data classification is the problem of predicting a class label of a target entity given information about features of the entity, of the related entities, or neighbors, and of the links. This paper compares two fundamental approaches to relational classification: aggregating the features of entities related to a target instance, or aggregating the probabilistic predictions based on the features of each entity related to the target instance. Our experiments compare different relational classifiers on sports, financial, and movie data. We examine the strengths and weaknesses of both score and feature aggregation, both conceptually and empirically. The performance of a single aggregate operator (e.g., average) can vary widely across datasets, for both feature and score aggregation. Aggregate features can be adapted to a dataset by learning with a set of aggregate features. Used adaptively, aggregate features outperformed learning with
(Show Context)

Citation Context

...ison of score aggregation with feature aggregation. II. RELATED WORK Because of the importance of relational data, there has been much work on relational classification. For overviews please see [9], =-=[10]-=-. We provide a high-level description of the work most relevant to the question of feature vs. score aggregation. Figure 1 provides a schematic for both the feature and score aggregation methods. FV o...

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