Employing linear regression in regression tree leaves
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Neural networks and the bias/variance dilemma
Neural Computation
Detection of abrupt changes: theory and application
Detection of abrupt changes: theory and application
Learning in the presence of concept drift and hidden contexts
Machine Learning
Mining high-speed data streams
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining time-changing data streams
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Prediction algorithms and confidence measures based on algorithmic randomness theory
Theoretical Computer Science - Natural computing
Functional Models for Regression Tree Leaves
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
Detecting Concept Drift with Support Vector Machines
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Trading-Off Local versus Global Effects of Regression Nodes in Model Trees
ISMIS '02 Proceedings of the 13th International Symposium on Foundations of Intelligent Systems
Topic Detection, Tracking, and Trend Analysis Using Self-Organizing Neural Networks
PAKDD '01 Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining
SECRET: a scalable linear regression tree algorithm
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Accurate decision trees for mining high-speed data streams
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient decision tree construction on streaming data
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 2004 ACM symposium on Applied computing
Incremental Learning of Linear Model Trees
Machine Learning
Online outlier detection in sensor data using non-parametric models
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Data Streams: Models and Algorithms (Advances in Database Systems)
Data Streams: Models and Algorithms (Advances in Database Systems)
Hedging Predictions in Machine Learning
The Computer Journal
Statistical change detection for multi-dimensional data
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Scalable look-ahead linear regression trees
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Multi-dimensional regression analysis of time-series data streams
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Detecting change in data streams
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Learning Model Trees from Data Streams
DS '08 Proceedings of the 11th International Conference on Discovery Science
Online Reliability Estimates for Individual Predictions in Data Streams
ICDMW '08 Proceedings of the 2008 IEEE International Conference on Data Mining Workshops
Issues in evaluation of stream learning algorithms
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Change (Detection) You Can Believe in: Finding Distributional Shifts in Data Streams
IDA '09 Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII
Change Detection in Climate Data over the Iberian Peninsula
ICDMW '09 Proceedings of the 2009 IEEE International Conference on Data Mining Workshops
Regression Trees from Data Streams with Drift Detection
DS '09 Proceedings of the 12th International Conference on Discovery Science
Handling numeric attributes in hoeffding trees
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Learning with local drift detection
ADMA'06 Proceedings of the Second international conference on Advanced Data Mining and Applications
Improving the centered CUSUMS statistic for structural break detection in time series
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
Regression on evolving multi-relational data streams
Proceedings of the 2011 Joint EDBT/ICDT Ph.D. Workshop
Incremental multi-target model trees for data streams
Proceedings of the 2011 ACM Symposium on Applied Computing
Active learning with evolving streaming data
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part III
Handling time changing data with adaptive very fast decision rules
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
Next challenges for adaptive learning systems
ACM SIGKDD Explorations Newsletter
Incremental linear model trees on massive datasets: keep it simple, keep it fast
Proceedings of the 28th Annual ACM Symposium on Applied Computing
An adaptive regression tree for non-stationary data streams
Proceedings of the 28th Annual ACM Symposium on Applied Computing
A survey on concept drift adaptation
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
The problem of real-time extraction of meaningful patterns from time-changing data streams is of increasing importance for the machine learning and data mining communities. Regression in time-changing data streams is a relatively unexplored topic, despite the apparent applications. This paper proposes an efficient and incremental stream mining algorithm which is able to learn regression and model trees from possibly unbounded, high-speed and time-changing data streams. The algorithm is evaluated extensively in a variety of settings involving artificial and real data. To the best of our knowledge there is no other general purpose algorithm for incremental learning regression/model trees able to perform explicit change detection and informed adaptation. The algorithm performs online and in real-time, observes each example only once at the speed of arrival, and maintains at any-time a ready-to-use model tree. The tree leaves contain linear models induced online from the examples assigned to them, a process with low complexity. The algorithm has mechanisms for drift detection and model adaptation, which enable it to maintain accurate and updated regression models at any time. The drift detection mechanism exploits the structure of the tree in the process of local change detection. As a response to local drift, the algorithm is able to update the tree structure only locally. This approach improves the any-time performance and greatly reduces the costs of adaptation.