Presentation 2005-06-16
An Efficient Segment Searching Method Using Geometrical Properties of Output Probability Sequence
Masahide SUGIYAMA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Several studies on efficient segment searching have been carried out. This report describes a new efficient segment searching method based on geometrical properties of output probability time series and evaluates the effectiveness through searching experiments. The proposed pruning method is based on the property of triangle inequality for mathematical distance. The efficient searching is implemented using a distance matrix between representatives generated by segmentation and clustering of time series. The experimental results show that the proposed method runs abount 26 to 36 times faster than the conventional Active searching, and a combination of the proposed method and binary searching achieves much faster.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Segment search / Binary search / Time series segmentation / output probability / VQ
Paper # DE2005-1,PRMU2005-22
Date of Issue

Conference Information
Committee PRMU
Conference Date 2005/6/9(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Pattern Recognition and Media Understanding (PRMU)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) An Efficient Segment Searching Method Using Geometrical Properties of Output Probability Sequence
Sub Title (in English)
Keyword(1) Segment search
Keyword(2) Binary search
Keyword(3) Time series segmentation
Keyword(4) output probability
Keyword(5) VQ
1st Author's Name Masahide SUGIYAMA
1st Author's Affiliation Graduate School of Computer Science and Engineering, The Univ. of Aizu()
Date 2005-06-16
Paper # DE2005-1,PRMU2005-22
Volume (vol) vol.105
Number (no) 118
Page pp.pp.-
#Pages 6
Date of Issue