ホウチン　テルヒサ   Teruhisa Hochin   寶珍　輝尚    所属   追手門学院大学  理工学部 情報工学科    職種   教授
言語種別	英語
発行・発表の年月	2015/04
形態種別	外国学術誌（その他）
査読	査読あり
標題	Optimal number of clusters for fast similarity search considering transformations of time varying data
執筆形態	共著・編著（代表編著を除く）
掲載誌名	International Journal of Networked and Distributed Computing
掲載区分	国外
巻・号・頁	3(2),pp.79-88
担当区分	責任著者
著者・共著者	Toshiichiro Iwashita,Teruhisa Hochin,Hiroki Nomiya
概要	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 simplicity. The model of query time to the number of clusters is constructed for determining the optimal number of clusters. As the query time could be represented with the concave function of the number of clusters, it is shown that the optimal number of clusters for the best query time can be obtained. The verification experiment confirms the validity of the model constructed. It is revealed that the optimal number of clusters could be determined by the times obtained from a single query execution.
DOI	10.2991/ijndc.2015.3.2.2
ISSN	2211-7938/2211-7946
DBLP ID	journals/ijndc/IwashitaHN15
PermalinkURL	https://dblp.uni-trier.de/db/journals/ijndc/ijndc3.html#IwashitaHN15