Sciweavers

8 search results - page 1 / 2
» Stable Decision Trees: Using Local Anarchy for Efficient Inc...
Sort
View
IJAIT
2000
50views more  IJAIT 2000»
13 years 5 months ago
Stable Decision Trees: Using Local Anarchy for Efficient Incremental Learning
Dimitrios Kalles, Athanassios Papagelis
INFORMATICALT
2008
196views more  INFORMATICALT 2008»
13 years 5 months ago
An Efficient and Sensitive Decision Tree Approach to Mining Concept-Drifting Data Streams
Abstract. Data stream mining has become a novel research topic of growing interest in knowledge discovery. Most proposed algorithms for data stream mining assume that each data blo...
Cheng-Jung Tsai, Chien-I Lee, Wei-Pang Yang
ICIP
2009
IEEE
13 years 2 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
TNN
2008
178views more  TNN 2008»
13 years 5 months ago
IMORL: Incremental Multiple-Object Recognition and Localization
This paper proposes an incremental multiple-object recognition and localization (IMORL) method. The objective of IMORL is to adaptively learn multiple interesting objects in an ima...
Haibo He, Sheng Chen
ICML
1999
IEEE
14 years 6 months ago
Lazy Bayesian Rules: A Lazy Semi-Naive Bayesian Learning Technique Competitive to Boosting Decision Trees
Lbr is a lazy semi-naive Bayesian classi er learning technique, designed to alleviate the attribute interdependence problem of naive Bayesian classi cation. To classify a test exa...
Zijian Zheng, Geoffrey I. Webb, Kai Ming Ting