µ¥ÀÌÅͺ£À̽º ¿¬±¸È¸Áö(SIGDB)
ÇѱÛÁ¦¸ñ(Korean Title) |
°¡»ó À©µµ¿ì ¼ºê½ÃÄö½º ¸ÅĪ ¹æ¹ýÀÇ È®Àå ¾Ë°í¸®Áò |
¿µ¹®Á¦¸ñ(English Title) |
An Extended Subsequence Matching Method based on a Virtual Window |
ÀúÀÚ(Author) |
ÀÓ¼±¿µ
¹Ú¿µÈ£
Sun-Young Ihm
Young-Ho Park
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 30 NO. 01 PP. 0039 ~ 0049 (2014. 04) |
Çѱ۳»¿ë (Korean Abstract) |
½Ã°è¿ µ¥ÀÌÅÍ´Â ½Ã°£ÀÇ È帧¿¡ µû¶ó º¯ÇÏ´Â µ¥ÀÌÅÍÀÇ °ªÀ» ÀúÀåÇÑ Á¤º¸·Î, ÃÖ±Ù ½Ã°è¿ µ¥ÀÌÅÍ¿¡ ´ëÇÑ °Ë»ö °ü½ÉÀÌ ³ô¾ÆÁö°í ÀÖ´Ù. ½Ã°è¿ µ¥ÀÌÅÍ¿¡¼ ¿øÇÏ´Â ±¸°£À» °Ë»öÇÏ´Â ¼ºê½ÃÄö½º ¸ÅĪ ¹æ¹ýÀº ´Ù¾çÇÑ ºÐ¾ß¿¡ Àû¿ëµÈ´Ù. º» ³í¹®¿¡¼´Â ¼ºê½ÃÄö½º ¸ÅĪÀ» È¿À²ÀûÀ¸·Î Çϱâ À§ÇÏ¿© °¡»ó À©µµ¿ì¸¦ »ý¼ºÇÏ¿© Èĺ¸½ÃÄö½ºÀÇ °³¼ö¸¦ ÁÙ¿© ºü¸£°Ô °Ë»öÇÏ´Â ¹æ¹ýÀÎ VWIMÀ» Á¦¾ÈÇÑ´Ù. VWIMÀº Èĺ¸½ÃÄö½ºÀÇ °³¼ö¸¦ ÁÙÀ̱â À§ÇÏ¿© ±âÁ¸ÀÇ ¹æ¹ýµé¿¡¼ ºñ±³ÇÏÁö ¸øÇß´ø ºÎºÐÀ» °¡»ó À©µµ¿ì·Î ±¸ÃàÇÏ¿© ºñ±³ÇÏ¿´´Ù. °¡»ó À©µµ¿ì¸¦ ÅëÇØ Èĺ¸½ÃÄö½ºÀÇ °³¼ö¸¦ ÁÙ¿© µ¥ÀÌÅÍ ½ÃÄö½º¿Í ÁúÀÇ ½ÃÄö½º°£ÀÇ °Å¸® °è»ê ºñ¿ëÀ» ÁÙÀÓÀ¸·Î½á ¼º´ÉÀ» °³¼±½ÃÄ×´Ù. ½ÇÇèÀ» ÅëÇØ ±âÁ¸ÀÇ ¹æ¹ýµé°ú ºñ±³ÇÏ¿© VWIMÀÇ Èĺ¸½ÃÄö½ºÀÇ °³¼ö´Â Æò±ÕÀûÀ¸·Î 5¹è, ÁúÀÇ Ã³¸® ½Ã°£Àº Æò±ÕÀûÀ¸·Î 8¹è Çâ»óµÊÀ» º¸¿´´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
A time series is a collection of real numbers which are sampled in a time interval. The subsequence matching is used in many applications in order to retrieve the data subsequences which are similar to the query sequence. In this paper, we propose an efficient subsequence matching method, which is called Virtual Window-based Instance-level Match (VWIM), to reduce the number of candidate subsequences. VWIM constructs the virtual windows by combining the remaining part of data sequences, and compares the virtual windows of data subsequence with the query subsequences. Experiment results show that VWIM reduces the number of candidate subsequences and thus query processing time compared with the existing methods.
|
Å°¿öµå(Keyword) |
½Ã°è¿ µ¥ÀÌÅÍ
¼ºê½ÃÄö½º ¸ÅĪ
°¡»ó À©µµ¿ì
Time series data
Subsequence matching
Virtual window
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|