Sciweavers

1248 search results - page 42 / 250
» Decision Tree Grafting
Sort
View
SAC
2005
ACM
15 years 5 months ago
Learning decision trees from dynamic data streams
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
João Gama, Pedro Medas, Pedro Pereira Rodri...
TJS
2010
182views more  TJS 2010»
14 years 10 months ago
A novel unsupervised classification approach for network anomaly detection by k-Means clustering and ID3 decision tree learning
This paper presents a novel host-based combinatorial method based on k-Means clustering and ID3 decision tree learning algorithms for unsupervised classification of anomalous and ...
Yasser Yasami, Saadat Pour Mozaffari
ICDE
2000
IEEE
130views Database» more  ICDE 2000»
16 years 1 months ago
CMP: A Fast Decision Tree Classifier Using Multivariate Predictions
Most decision tree classifiers are designed to keep class histograms for single attributes, and to select a particular attribute for the next split using said histograms. In this ...
Haixun Wang, Carlo Zaniolo
PAKDD
2007
ACM
140views Data Mining» more  PAKDD 2007»
15 years 6 months ago
A Hybrid Multi-group Privacy-Preserving Approach for Building Decision Trees
In this paper, we study the privacy-preserving decision tree building problem on vertically partitioned data. We made two contributions. First, we propose a novel hybrid approach, ...
Zhouxuan Teng, Wenliang Du
ECML
2005
Springer
15 years 5 months ago
Simple Test Strategies for Cost-Sensitive Decision Trees
We study cost-sensitive learning of decision trees that incorporate both test costs and misclassification costs. In particular, we first propose a lazy decision tree learning that ...
Shengli Sheng, Charles X. Ling, Qiang Yang