Title
Fast Classification of Time Series Data
Abstract
Nowadays, we have to deal with fast-growing and permanently evolving data, including social networks and sensor data recorded from smart phones or vehicles. Data evolving in time brings a lot of new challenges to the data mining and machine learning community. In recent years, classification of time series data has become a topic of great interest within the data mining community. Several approaches or classifiers have been proposed for the problem of time series classification. We propose an approach which is computationally fast and accurate when compared with 1NN(One Nearest Neighbor) and kNN(k Nearest Neighbor) classifiers. Our approach speeds up the computation by restraining the search for the closest pattern only to a subset of classes. During classification phase we are using a window parameter in order to classify the test pattern using only a subset of the training patterns. We have tested our approach with a number of datasets and compared our approach with 1NN and kNN classifiers.
Year
DOI
Venue
2013
10.1109/ISCMI.2014.28
FUZZ-IEEE
Keywords
Field
DocType
time measurement,training data,time series analysis,data mining,hidden markov models
Training set,k-nearest neighbors algorithm,Time series,Data mining,Social network,Computer science,Problem of time,Artificial intelligence,Hidden Markov model,Machine learning,Distance measures,Computation
Conference
ISSN
Citations 
PageRank 
2640-0154
0
0.34
References 
Authors
8
2
Name
Order
Citations
PageRank
Penugonda Ravikumar100.34
V. Susheela Devi2479.21