Sciweavers

1060 search results - page 34 / 212
» On the Discovery of Random Trees
Sort
View
ICIC
2009
Springer
14 years 7 months ago
Towards a Better Understanding of Random Forests through the Study of Strength and Correlation
In this paper we present a study on the Random Forest (RF) family of ensemble methods. From our point of view, a "classical" RF induction process presents two main drawba...
Simon Bernard, Laurent Heutte, Sébastien Ad...
IJCAI
2007
14 years 11 months ago
ProbLog: A Probabilistic Prolog and Its Application in Link Discovery
We introduce ProbLog, a probabilistic extension of Prolog. A ProbLog program defines a distribution over logic programs by specifying for each clause the probability that it belo...
Luc De Raedt, Angelika Kimmig, Hannu Toivonen
EJC
2008
14 years 10 months ago
Expansion properties of a random regular graph after random vertex deletions
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
Catherine S. Greenhill, Fred B. Holt, Nicholas C. ...
KDD
2003
ACM
132views Data Mining» more  KDD 2003»
15 years 10 months ago
PaintingClass: interactive construction, visualization and exploration of decision trees
Decision trees are commonly used for classification. We propose to use decision trees not just for classification but also for the wider purpose of knowledge discovery, because vi...
Soon Tee Teoh, Kwan-Liu Ma
ICIP
2009
IEEE
14 years 7 months ago
An incremental extremely random forest classifier for online learning and tracking
Decision trees have been widely used for online learning classification. Many approaches usually need large data stream to finish decision trees induction, as show notable limitat...
Aiping Wang, Guowei Wan, Zhiquan Cheng, Sikun Li