Optimal Number of Clusters for Fast Similarity Search Considering Transformations of Time Varying Data
This paper proposes a method of determining the optimal number of clusters dividing the multiple transformations for the purpose of the efficient processing of query against the results of applying the transformations to time series. In this paper, the moving average is used as a transformation for...
Main Authors: | Toshiichiro Iwashita, Teruhisa Hochin, Hiroki Nomiya |
---|---|
Format: | Article |
Language: | English |
Published: |
Atlantis Press
2015-04-01
|
Series: | International Journal of Networked and Distributed Computing (IJNDC) |
Subjects: | |
Online Access: | https://www.atlantis-press.com/article/16391.pdf |
Similar Items
-
Multi-Dimensional Indexing System Considering Distributions of Sub-indexes and Data
by: Kazuto Nakanishi, et al.
Published: (2019-12-01) -
Similarity searching in sequence databases under time warping.
Published: (2004) -
Improvement and Evaluation of Estimation of Time Series Data of Daily Life
by: Teruhisa Hochin, et al.
Published: (2017-09-01) -
Voting in clustering and finding the number of clusters
by: Dimitriadou, Evgenia, et al.
Published: (1999) -
A Fast Method for Estimating the Number of Clusters Based on Score and the Minimum Distance of the Center Point
by: Zhenzhen He, et al.
Published: (2019-12-01)