Sciweavers

405 search results - page 16 / 81
» Efficient decision tree construction on streaming data
Sort
View
CIS
2004
Springer
14 years 1 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
ML
2010
ACM
159views Machine Learning» more  ML 2010»
13 years 6 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter
DASFAA
2010
IEEE
225views Database» more  DASFAA 2010»
13 years 7 months ago
Mining Regular Patterns in Data Streams
Discovering interesting patterns from high-speed data streams is a challenging problem in data mining. Recently, the support metric-based frequent pattern mining from data stream h...
Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed,...
ICDE
2007
IEEE
157views Database» more  ICDE 2007»
13 years 11 months ago
Representing Data Quality for Streaming and Static Data
In smart item environments, multitude of sensors are applied to capture data about product conditions and usage to guide business decisions as well as production automation proces...
Anja Klein, Hong Hai Do, Gregor Hackenbroich, Marc...
KDD
2000
ACM
110views Data Mining» more  KDD 2000»
13 years 11 months ago
An empirical analysis of techniques for constructing and searching k-dimensional trees
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
Douglas A. Talbert, Douglas H. Fisher