Sciweavers

1283 search results - page 101 / 257
» Learning Voting Trees
Sort
View
ILP
2004
Springer
14 years 3 months ago
First Order Random Forests with Complex Aggregates
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
Celine Vens, Anneleen Van Assche, Hendrik Blockeel...
AGI
2008
13 years 11 months ago
Transfer Learning and Intelligence: an Argument and Approach
In order to claim fully general intelligence in an autonomous agent, the ability to learn is one of the most central capabilities. Classical machine learning techniques have had ma...
Matthew E. Taylor, Gregory Kuhlmann, Peter Stone
WWW
2005
ACM
14 years 10 months ago
Focused crawling by exploiting anchor text using decision tree
Focused crawlers are considered as a promising way to tackle the scalability problem of topic-oriented or personalized search engines. To design a focused crawler, the choice of s...
Jun Li, Kazutaka Furuse, Kazunori Yamaguchi
ICDIM
2007
IEEE
14 years 4 months ago
Pattern-based decision tree construction
Learning classifiers has been studied extensively the last two decades. Recently, various approaches based on patterns (e.g., association rules) that hold within labeled data hav...
Dominique Gay, Nazha Selmaoui, Jean-Françoi...
ICANNGA
2007
Springer
161views Algorithms» more  ICANNGA 2007»
14 years 2 months ago
Evolutionary Induction of Decision Trees for Misclassification Cost Minimization
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
Marek Kretowski, Marek Grzes