書誌事項
- タイトル別名
-
- Fast Clustering for Time-series Data with Average-time-sequence-vector Generation Based on Dynamic Time Warping.
- ドウテキ ジカン シンシュクホウ ニ モトヅク ヘイキン ジケイレツ セイセイ ニ ヨル ジケイレツ データ ノ コウソク クラスタリング
この論文をさがす
説明
This paper proposes a fast clustering method for time-series data based on average time sequence vector. A clustering procedure based on an exhaustive search method is time-consuming although its result typically exhibits high quality. BIRCH, which reduces the number of examples by data squashing based on a data structure CF (Clustering Feature) tree, represents an effective solution for such a method when the data set consists of numerical attributes only. For time-series data, however, a straightforward application of BIRCH based on a Euclidean distance for a pair of sequences, miserably fails since such a distance typically differs from human's perception. A dissimilarity measure based on DTW (Dynamic Time Warping) is desirable, but to the best of our knowledge no methods have been proposed for time-series data in the context of data squashing. In order to circumvent this problem, we propose DTWS (Dynamic Time Warping Squashed) tree, which employs a dissimilarity measure based on DTW, and compresses time sequences to the average time sequence vector. An average time sequence vector is obtained by a novel procedure which estimates correct shrinkage of a result of DTW. Experiments using the Australian sign language data demonstrate the superiority of the proposed method in terms of correctness of clustering, while its degradation of time efficiency is negligible.
収録刊行物
-
- 人工知能学会論文誌
-
人工知能学会論文誌 18 144-152, 2003
一般社団法人 人工知能学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390001205109185664
-
- NII論文ID
- 10022004346
-
- NII書誌ID
- AA11579226
-
- ISSN
- 13468030
- 13460714
-
- NDL書誌ID
- 7264272
-
- 本文言語コード
- ja
-
- データソース種別
-
- JaLC
- NDLサーチ
- Crossref
- CiNii Articles
- OpenAIRE
-
- 抄録ライセンスフラグ
- 使用不可
