Sciweavers

272 search results - page 30 / 55
» Lazy tree splitting
Sort
View
140
Voted
CAD
2008
Springer
15 years 3 months ago
Improved Binary Space Partition merging
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
Mikola Lysenko, Roshan D'Souza, Ching-Kuan Shene
137
Voted
FLAIRS
2008
15 years 5 months ago
A Backward Adjusting Strategy and Optimization of the C4.5 Parameters to Improve C4.5's Performance
In machine learning, decision trees are employed extensively in solving classification problems. In order to design a decision tree classifier two main phases are employed. The fi...
Jason R. Beck, Maria Garcia, Mingyu Zhong, Michael...
121
Voted
GLOBECOM
2007
IEEE
15 years 10 months ago
An Enhanced RFID Multiple Access Protocol for Fast Inventory
- The relevant performance metric for successful deployment of Radio Frequency Identification (RFID) systems for tag inventory applications is the latency for reading all tags with...
You-Chang Ko, Sumit Roy, Joshua R. Smith, Hyung-Wo...
115
Voted
JDWM
2007
107views more  JDWM 2007»
15 years 3 months ago
Evolutionary Induction of Mixed Decision Trees
This article presents a new evolutionary algorithm (EA) for induction of mixed decision trees. In nonterminal nodes of a mixed tree, different types of tests can be placed, rangin...
Marek Kretowski, Marek Grzes
142
Voted
ML
2006
ACM
163views Machine Learning» more  ML 2006»
15 years 3 months ago
Extremely randomized trees
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
Pierre Geurts, Damien Ernst, Louis Wehenkel