{"created":"2025-01-18T22:51:51.155619+00:00","updated":"2025-01-22T22:17:51.407703+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00019368","sets":["1164:1165:1189:1190"]},"path":["1190"],"owner":"1","recid":"19368","title":["Adaptive Time Warping"],"pubdate":{"attribute_name":"公開日","attribute_value":"2003-07-16"},"_buckets":{"deposit":"d091fafc-b7c5-4a19-92d2-721465a09ed5"},"_deposit":{"id":"19368","pid":{"type":"depid","value":"19368","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"Adaptive Time Warping","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Adaptive Time Warping"},{"subitem_title":"Adaptive Time Warping","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2003-07-16","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"筑波大学大学院システム情報工学研究科"},{"subitem_text_value":"筑波大学電子・情報工学系"},{"subitem_text_value":"筑波大学電子・情報工学系"},{"subitem_text_value":"筑波大学電子・情報工学系"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Systems and Information Engineering, University of Tsukuba","subitem_text_language":"en"},{"subitem_text_value":"Institute of Information Sciences and Electronics, University of Tsukuba","subitem_text_language":"en"},{"subitem_text_value":"Institute of Information Sciences and Electronics, University of Tsukuba","subitem_text_language":"en"},{"subitem_text_value":"Institute of Information Sciences and Electronics, University of Tsukuba","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/19368/files/IPSJ-DBS03131064.pdf"},"date":[{"dateType":"Available","dateValue":"2005-07-16"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DBS03131064.pdf","filesize":[{"value":"563.6 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"13"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"62f18d35-35ee-4c5d-a44f-1f0e8c7f97f7","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2003 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"大桃, 論"},{"creatorName":"陳漢雄"},{"creatorName":"古瀬, 一隆"},{"creatorName":"大保信夫"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Satoshi, Oomomo","creatorNameLang":"en"},{"creatorName":"Hanxiong, Chen","creatorNameLang":"en"},{"creatorName":"Kazutaka, Furuse","creatorNameLang":"en"},{"creatorName":"Nobuo, Ohbo","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10112482","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"大規模な時系列データベースに対する高速な類似検索が重要な課題となっている．これまでにユークリッド距離に基づく類似検索技法が多く提案されているが，最近の研究によって，タイムワーピングによって得られた距離が時系列データの類似検索においても有効であることが実証されてきた．しかし，タイムワーピングの計算時間は非常に長く，しかも距離公理の三角不等式が成り立たないため，伝統的な索引技法の適用は困難である．この問題を解決するために，時系列を固定長に区切って圧縮する手法を提案する．そして，本論文で提案する手法が有効であることを実験によって実証する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Recently, time series produced and treated in many fields, and fast similarity search in large time series databases becomes important. For this subject, similarity search techniques based on Euclidean distance are straighforward. However, recent studys have shown that time warping distance is more robust distance in similarity search for time series. Difficulty is that time warping distance is computationally expensive. Traditional indexing techniques is powerless because it violates the triangle inequality. To overcome this problem, compression is considered to be effectvie and some techniques which divide time series into fix length for compressing have been proposed. In this paper we propose an adaptive compressing technique. Prefer to fix length division, our approach divides a time series according to its characters hence obtains higher effect while keeping lower information lost in compression. The effectiveness has been confirmed in out experimental results.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"498","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告データベースシステム（DBS）"}],"bibliographicPageStart":"491","bibliographicIssueDates":{"bibliographicIssueDate":"2003-07-16","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"71(2003-DBS-131)","bibliographicVolumeNumber":"2003"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":19368,"links":{}}