Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD '03 2003
DOI: 10.1145/956804.956830
|View full text |Cite
|
Sign up to set email alerts
|

Learning relational probability trees

Abstract: Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probability estimation trees. Traditional tree learning algorithms assume that instances in the training data are homogenous and independently distributed. Relational probability trees (RPTs) extend standard probability estimation trees to a relational setting in which data instances are heterogeneous and interdependent. Our algorithm for lear… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
149
0

Year Published

2005
2005
2015
2015

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 83 publications
(149 citation statements)
references
References 0 publications
0
149
0
Order By: Relevance
“…). Examples of this approach include probabilistic relational models [13] and relational probability trees [16]. Blockeel and Bruynooghe [5] discussed the resulting -often undesirable -bias on these learners, and proposed the idea of combining aggregation and selection.…”
Section: Related Workmentioning
confidence: 99%
“…). Examples of this approach include probabilistic relational models [13] and relational probability trees [16]. Blockeel and Bruynooghe [5] discussed the resulting -often undesirable -bias on these learners, and proposed the idea of combining aggregation and selection.…”
Section: Related Workmentioning
confidence: 99%
“…For an elaborate treatment of this estimation techniques, please refer to the papers of Neville et al [10,11].…”
Section: Relational Bayesian Classifiers (Rbcs)mentioning
confidence: 99%
“…RPTs extend standard probability estimation trees (also called decision trees) to a relational setting, in which data instances are heterogeneous and interdependent [10]. The algorithm first transforms the relational data to multisets of attributes (Figure 1).…”
Section: Relational Probability Trees (Rpts)mentioning
confidence: 99%
See 2 more Smart Citations