Great organizations collect open-ended and time-changing data received at a high speed. The possibility of extracting useful knowledge from these potentially infinite databases is a new challenge in Data Mining. In this paper we propose an anytime incremental learning algorithm for mining numeric data streams. Within Supervised Learning, our approach is based on prototypes and hypercubic decision rules, concerning with the simplicity of the model provided and the time complexity as primary goals. Experimental results with synthetic databases of 100 gigabytes show a good performance from streams of data in continuous transformation
Abstract. In this paper we propose a new method to perform incremen-tal discretization. The basic id...
Mining data streams is a challenging task that requires online systems based on incremental learning...
In this paper we study the problem of constructing accurate decision tree models from data streams. ...
Abstract. This paper presents an incremental and scalable learning algorithm in order to mine numeri...
The data stream model for data mining places harsh restrictions on a learning algorithm. First, a mo...
The recent advances in hardware and software have enabled the capture of different measurements of d...
In this paper we propose a scaling-up method that is applicable to essentially any induction algorit...
Data is collected and stored everywhere, be it images or audio files on private computers, customer ...
This paper presents a scalable learning algorithm to classify numerical, low dimensionality, high-ca...
Many organizations today have more than very large data-bases; they have databases that grow without...
Frequent Pattern mining is modified by Sequential Pattern Mining to consider time regularity which i...
This paper presents a scalable learning algorithm to classify numerical, low dimensionality, high–ca...
Data mining is a part of know ledge Discovery in database process (KDD). As technology advances, flo...
This paper presents a new learning algorithm for inducing decision trees from data streams. In thes...
A data stream is a continuous and high-speed flow of data items. High speed refers to the phenomenon...
Abstract. In this paper we propose a new method to perform incremen-tal discretization. The basic id...
Mining data streams is a challenging task that requires online systems based on incremental learning...
In this paper we study the problem of constructing accurate decision tree models from data streams. ...
Abstract. This paper presents an incremental and scalable learning algorithm in order to mine numeri...
The data stream model for data mining places harsh restrictions on a learning algorithm. First, a mo...
The recent advances in hardware and software have enabled the capture of different measurements of d...
In this paper we propose a scaling-up method that is applicable to essentially any induction algorit...
Data is collected and stored everywhere, be it images or audio files on private computers, customer ...
This paper presents a scalable learning algorithm to classify numerical, low dimensionality, high-ca...
Many organizations today have more than very large data-bases; they have databases that grow without...
Frequent Pattern mining is modified by Sequential Pattern Mining to consider time regularity which i...
This paper presents a scalable learning algorithm to classify numerical, low dimensionality, high–ca...
Data mining is a part of know ledge Discovery in database process (KDD). As technology advances, flo...
This paper presents a new learning algorithm for inducing decision trees from data streams. In thes...
A data stream is a continuous and high-speed flow of data items. High speed refers to the phenomenon...
Abstract. In this paper we propose a new method to perform incremen-tal discretization. The basic id...
Mining data streams is a challenging task that requires online systems based on incremental learning...
In this paper we study the problem of constructing accurate decision tree models from data streams. ...