Sciweavers

405 search results - page 46 / 81
» Binary Classification Trees for Multi-class Classification P...
Sort
View
ICML
2000
IEEE
15 years 11 months ago
Correlation-based Feature Selection for Discrete and Numeric Class Machine Learning
Algorithms for feature selection fall into two broad categories: wrappers that use the learning algorithm itself to evaluate the usefulness of features and filters that evaluate f...
Mark A. Hall
ICIP
2009
IEEE
14 years 8 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
ECCV
2008
Springer
16 years 17 days ago
Simultaneous Detection and Registration for Ileo-Cecal Valve Detection in 3D CT Colonography
Object detection and recognition has achieved a significant progress in recent years. However robust 3D object detection and segmentation in noisy 3D data volumes remains a challen...
Le Lu, Adrian Barbu, Matthias Wolf, Jianming Liang...
JMLR
2010
146views more  JMLR 2010»
14 years 5 months ago
Accurate Ensembles for Data Streams: Combining Restricted Hoeffding Trees using Stacking
The success of simple methods for classification shows that is is often not necessary to model complex attribute interactions to obtain good classification accuracy on practical p...
Albert Bifet, Eibe Frank, Geoffrey Holmes, Bernhar...
CC
2010
Springer
282views System Software» more  CC 2010»
14 years 9 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks