Event Streams Clustering Using Machine Learning Techniques
Author(s) -
Hanen Bouali,
Jalel Akaichi
Publication year - 2015
Publication title -
journal of systems integration
Language(s) - English
Resource type - Journals
ISSN - 1804-2724
DOI - 10.20470/jsi.v6i4.224
Subject(s) - cluster analysis , data stream mining , computer science , sliding window protocol , data mining , data stream clustering , window (computing) , event (particle physics) , support vector machine , cure data clustering algorithm , artificial intelligence , machine learning , correlation clustering , physics , quantum mechanics , operating system
Data streams are usually of unbounded lengths which push users to consider only recent observations by focusing on a time window, and ignore past data. However, in many real world applications, past data must be taken in consideration to guarantee the efficiency, the performance of decision making and to handle data streams evolution over time. In order to build a selectively history to track the underlying event streams changes, we opt for the continuously data of the sliding window which increases the time window based on changes over historical data. In this paper, to have the ability to access to historical data without requiring any significant storage or multiple passes over the data. In this paper, we propose a new algorithm for clustering multiple data streams using incremental support vector machine and data representative points’ technique. The algorithm uses a sliding window model for the most recent clustering results and data representative points to model the old data clustering results. Our experimental results on electromyography signal show a better clustering than other present in the literature.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom