Sciweavers

71 search results - page 6 / 15
» A Streaming Parallel Decision Tree Algorithm
Sort
View
ICDCS
2006
IEEE
14 years 2 months ago
Greedy is Good: On Service Tree Placement for In-Network Stream Processing
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
Zoë Abrams, Jie Liu
ICIP
1999
IEEE
14 years 10 months ago
Perceptual Grouping of 3-D Features in Aerial Image Using Decision Tree Classifier
We address a new perceptual grouping algorithmfor aerial images, which employs a decision tree classifier and hierarchical multilevel grouping strategy an a bottom-up fashion. In ...
In Kyu Park, Kyoung Mu Lee, Sang Uk Lee
CIS
2004
Springer
14 years 2 months ago
Knowledge Maintenance on Data Streams with Concept Drifting
Concept drifting in data streams often occurs unpredictably at any time. Currently many classification mining algorithms deal with this problem by using an incremental learning ap...
Juggapong Natwichai, Xue Li
ICALP
1995
Springer
14 years 8 days ago
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
We describe the rst parallel algorithm with optimal speedup for constructing minimum-width tree decompositions of graphs of bounded treewidth. On n-vertex input graphs, the algori...
Hans L. Bodlaender, Torben Hagerup
KDD
2004
ACM
117views Data Mining» more  KDD 2004»
14 years 9 months ago
Systematic data selection to mine concept-drifting data streams
One major problem of existing methods to mine data streams is that it makes ad hoc choices to combine most recent data with some amount of old data to search the new hypothesis. T...
Wei Fan