Sciweavers

86 search results - page 6 / 18
» Visualizing Bagged Decision 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...
FOIKS
2010
Springer
14 years 4 months ago
Evolving Schemas for Streaming XML
A. Falappa, an Abstract Dialogue Framework Guillermo R. Simari Regular Helena Kein¨anen An Algorithm for Generating Nash Stable Coalition Structures in Hedonic Games 15:30-16:00 A...
Maryam Shoaran, Alex Thomo
ICML
2006
IEEE
14 years 10 months ago
An empirical comparison of supervised learning algorithms
A number of supervised learning methods have been introduced in the last decade. Unfortunately, the last comprehensive empirical evaluation of supervised learning was the Statlog ...
Rich Caruana, Alexandru Niculescu-Mizil
VLDB
2004
ACM
245views Database» more  VLDB 2004»
14 years 3 months ago
VizTree: a Tool for Visually Mining and Monitoring Massive Time Series Databases
Moments before the launch of every space vehicle, engineering discipline specialists must make a critical go/no-go decision. The cost of a false positive, allowing a launch in spi...
Jessica Lin, Eamonn J. Keogh, Stefano Lonardi, Jef...
JAIR
2008
93views more  JAIR 2008»
13 years 9 months ago
Spectrum of Variable-Random Trees
In this paper, we show that a continuous spectrum of randomisation exists, in which most existing tree randomisations are only operating around the two ends of the spectrum. That ...
Fei Tony Liu, Kai Ming Ting, Yang Yu, Zhi-Hua Zhou