Sciweavers

405 search results - page 5 / 81
» Efficient decision tree construction on streaming data
Sort
View
DEXAW
2004
IEEE
181views Database» more  DEXAW 2004»
13 years 9 months ago
Algebraic Optimization of Data Delivery Patterns in Mobile Sensor Networks
Database-like query processing over a network of sensors has become an attractive paradigm for building sensor applications. A sensor query is characterized by data streams among ...
Vladimir Zadorozhny, Panos K. Chrysanthis, Alexand...
PAMI
1998
127views more  PAMI 1998»
13 years 5 months ago
The Random Subspace Method for Constructing Decision Forests
—Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...
Tin Kam Ho
CIKM
2008
Springer
13 years 7 months ago
Efficient frequent pattern mining over data streams
This paper proposes a prefix-tree structure, called CPS-tree (Compact Pattern Stream tree) that efficiently discovers the exact set of recent frequent patterns from high-speed dat...
Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed,...
SAC
2005
ACM
13 years 11 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...
PAKDD
2010
ACM
212views Data Mining» more  PAKDD 2010»
13 years 10 months ago
Fast Perceptron Decision Tree Learning from Evolving Data Streams
Abstract. Mining of data streams must balance three evaluation dimensions: accuracy, time and memory. Excellent accuracy on data streams has been obtained with Naive Bayes Hoeffdi...
Albert Bifet, Geoffrey Holmes, Bernhard Pfahringer...