• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö > Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö D

Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö D

Current Result Document : 29 / 29

ÇѱÛÁ¦¸ñ(Korean Title) À¯»ç ½ÃÄö½º ¸ÅĪÀ» À§ÇÑ ÇÏÀ̺긮µå ÀúÂ÷¿ø º¯È¯
¿µ¹®Á¦¸ñ(English Title) Hybrid Lower-Dimensional Transformation for Similar Sequence Matching
ÀúÀÚ(Author) ¹®¾ç¼¼   ±èÁøÈ£   Yang-Sae Moon   Jinho Kim  
¿ø¹®¼ö·Ïó(Citation) VOL 15-D NO. 01 PP. 0031 ~ 0040 (2008. 02)
Çѱ۳»¿ë
(Korean Abstract)
À¯»ç ½ÃÄö½º ¸ÅĪ¿¡¼­´Â °íÂ÷¿øÀÎ ½ÃÄö½º¸¦ ÀúÂ÷¿øÀÇ Á¡À¸·Î º¯È¯Çϱâ À§ÇÏ¿© ÀúÂ÷¿ø º¯È¯À» »ç¿ëÇÑ´Ù. ±×·±µ¥, ÀÌ·¯ÇÑ ÀúÂ÷¿ø º¯È¯Àº ½Ã°è¿­ µ¥ÀÌÅÍÀÇ Á¾·ù¿¡ µû¶ó Àε¦½Ì ¼º´É¿¡ À־ Å« Â÷À̸¦ ³ªÅ¸³½´Ù. Áï, ¾î¶² ÀúÂ÷¿ø º¯È¯À» ¼±ÅÃÇÏ´À³Ä°¡ À¯»ç ½ÃÄö½º ¸ÅĪÀÇ Àε¦½Ì ¼º´É¿¡ Å« ¿µÇâÀ» ÁÖ°Ô µÈ´Ù. ÀÌ ¹®Á¦¸¦ ÇØ°áÇϱâ À§ÇÏ¿©, º» ³í¹®¿¡¼­´Â ÇϳªÀÇ À妽º¿¡¼­ µÎ °³ ÀÌ»óÀÇ ÀúÂ÷¿ø º¯È¯À» ÅëÇÕÇÏ¿© »ç¿ëÇÏ´Â ÇÏÀ̺긮µå Á¢±Ù¹ýÀ» Á¦¾ÈÇÑ´Ù. ¸ÕÀú, ÇϳªÀÇ ½ÃÄö½º¿¡ µÎ °³ ÀÌ»óÀÇ ÀúÂ÷¿ø º¯È¯À» Àû¿ëÇÏ´Â ÇÏÀ̺긮µå ÀúÂ÷¿ø º¯È¯ÀÇ °³³äÀ» Á¦¾ÈÇÏ°í, º¯È¯µÈ ½ÃÄö½º°£ÀÇ °Å¸®¸¦ °è»êÇÏ´Â ÇÏÀ̺긮µå °Å¸®¸¦ Á¤ÀÇÇÑ´Ù. ´ÙÀ½À¸·Î, ÀÌ·¯ÇÑ ÇÏÀ̺긮µå Á¢±Ù¹ý »ç¿ëÇϸé À¯»ç ½ÃÄö½º ¸ÅĪÀ» Á¤È®ÇÏ°Ô ¼öÇàÇÒ ¼ö ÀÖÀ½À» Á¤ÇüÀûÀ¸·Î Áõ¸íÇÑ´Ù. ¶ÇÇÑ, Á¦¾ÈÇÑ ÇÏÀ̺긮µå Á¢±Ù¹ýÀ» »ç¿ëÇÏ´Â À妽º ±¸¼º ¹× À¯»ç ½ÃÄö½º ¸ÅĪ ¾Ë°í¸®ÁòÀ» Á¦½ÃÇÑ´Ù. ´Ù¾çÇÑ ½Ã°è¿­ µ¥ÀÌÅÍ¿¡ ´ëÇÑ ½ÇÇè °á°ú, Á¦¾ÈÇÑ ÇÏÀ̺긮µå Á¢±Ù¹ýÀº ´ÜÀÏ ÀúÂ÷¿ø º¯È¯À» »ç¿ëÇÏ´Â °æ¿ì¿¡ ºñÇؼ­ ¿ì¼öÇÑ ¼º´ÉÀ» º¸ÀÌ´Â °ÍÀ¸·Î ³ªÅ¸³µ´Ù. ÀÌ °°Àº °á°ú¸¦ º¼ ¶§, Á¦¾ÈÇÑ ÇÏÀ̺긮µå Á¢±Ù¹ýÀº ´Ù¾çÇÑ Æ¯¼ºÀ» Áö´Ñ ´Ù¾çÇÑ ½Ã°è¿­ µ¥ÀÌÅÍ¿¡ µÎ·ç Àû¿ëµÉ ¼ö ÀÖ´Â ¿ì¼öÇÑ ¹æ¹ýÀ̶ó »ç·áµÈ´Ù.
¿µ¹®³»¿ë
(English Abstract)
We generally use lower-dimensional transformations to convert high-dimensional sequences into low-dimensional points in similar sequence matching. These traditional transformations, however, show different characteristics in indexing performance by the type of time-series data. It means that the selection of lower-dimensional transformations makes a significant influence on the indexing performance in similar sequence matching. To solve this problem, in this paper we propose a hybrid approach that integrates multiple transformations and uses them in a single multidimensional index. We first propose a new notion of hybrid lower-dimensional transformation that exploits different lower-dimensional transformations for a sequence. We next define the hybrid distance to compute the distance between the transformed sequences. We then formally prove that the hybrid approach performs the similar sequence matching correctly. We also present the index building and the similar sequence matching algorithms that use the hybrid approach. Experimental results for various time-series data sets show that our hybrid approach outperforms the single transformation-based approach. These results indicate that the hybrid approach can be widely used for various time-series data with different characteristics.
Å°¿öµå(Keyword) µ¥ÀÌÅÍ ¸¶ÀÌ´×   ½Ã°è¿­ µ¥ÀÌÅͺ£À̽º   ÇÏÀ̺긮µå ÀúÂ÷¿ø º¯È¯   À¯»ç ½ÃÄö½º ¸ÅĪ   Data Mining   Time-Series Databases   Hybrid Lower-Dimensional Transformation   Similar Sequence Matching  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå