公开(公告)号：KR1020130075403A

公开(公告)日：2013-07-05

申请号：KR1020110143758

申请日：2011-12-27

Applicant: 전자부품연구원

Inventor： 송재종 ,  이석필 ,  양창모 ,  박성주 ,  신사임 ,  송석일

IPC: G06F17/00 ,  G06F17/10

CPC classification number: G06F17/30336 ,  G06F17/10 ,  G06F17/30548

Abstract: PURPOSE: A method for indexing data sequence and a recording medium recorded with a source program thereof are provided to improve filtering effect and search speed, by selecting a candidate set through distance measurement between query sequence and MBS representing a similar data sequence group. CONSTITUTION: A plurality of data sequence groups grouped in similar data sequences is generated, by clustering data sequences constituted with elements listed in time-series. Minimum bounding sequence constituted with elements corresponding to a minimum value and a maximum value among the elements of the same dimension in the data sequence group is defined as minimum bounding sequence (MBS) representing the data sequence group. The data sequence is indexed on the basis of minimum dynamic time warping (DTW) defined as smallest distance among distances calculated between query sequence and data sequence belonging to the group represented by the MBS.

Abstract translation: 目的：提供一种用于索引数据序列的方法和记录有源程序的记录介质，通过在查询序列和表示相似数据序列组的MBS之间的距离测量中选择候选集来提高过滤效果和搜索速度。 构成：通过对由时间序列中列出的元素构成的数据序列进行聚类，生成以类似数据序列分组的多个数据序列组。 将与数据序列组中相同尺寸的元素中的最小值和最大值相对应的元素构成的最小边界序列定义为表示数据序列组的最小边界序列（MBS）。 基于最小动态时间扭曲（DTW）的索引，数据序列被定义为在由MBS表示的组中的查询序列和数据序列之间计算的距离之间的最小距离。

公开(公告)号：KR101327960B1

公开(公告)日：2013-11-12

申请号：KR1020110143758

申请日：2011-12-27

Applicant: 전자부품연구원

Inventor： 송재종 ,  이석필 ,  양창모 ,  박성주 ,  신사임 ,  송석일

IPC: G06F17/00 ,  G06F17/10

Abstract: 본 발명에서는, 서로 유사한 데이터 시퀀스들을 그룹화하고, 각 그룹을 대표하는 최소 경계 시퀀스(Minimum Bounding Sequence: MBS)를 정의하고, 정의된 MBS와 질의 시퀀스 사이의 최소 DTW 거리를 측정하는 거리 척도를 통해서 필터링 효과를 높여서 검색 속도 향상을 가능하게 한다.