|
ホウチン テルヒサ
Teruhisa Hochin
寶珍 輝尚 所属 追手門学院大学 理工学部 情報工学科 職種 教授 |
|
| 言語種別 | 英語 |
| 発行・発表の年月 | 2014/09/29 |
| 形態種別 | 論文 |
| 査読 | 査読あり |
| 標題 | Optimal number of clusters for fast similarity search of time series considering transformations |
| 執筆形態 | 共著・編著（代表編著を除く） |
| 掲載誌名 | Proceedings - 2014 IIAI 3rd International Conference on Advanced Applied Informatics, IIAI-AAI 2014 |
| 掲載区分 | 国外 |
| 出版社・発行元 | IEEE Computer Society |
| 巻・号・頁 | pp.711-717 |
| 著者・共著者 | 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. 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.1109/IIAI-AAI.2014.146 |
| DBLP ID | conf/iiaiaai/IwashitaHN14 |
| PermalinkURL | https://dblp.uni-trier.de/rec/conf/iiaiaai/2014 |
| researchmap用URL | https://dblp.uni-trier.de/db/conf/iiaiaai/iiaiaai2014.html#IwashitaHN14 |