2008³â Ãß°è Çмú´ëȸ
Current Result Document : 2 / 2
ÇѱÛÁ¦¸ñ(Korean Title) |
ÀÚÀ¯Æ®¸® ±â¹ÝÀÇ ±×·¡ÇÁ¸¶ÀÌ´× ±â¹ý ºÐ¼® |
¿µ¹®Á¦¸ñ(English Title) |
Analysis of Graph Mining based on Free-Tree |
ÀúÀÚ(Author) |
³ë¿µ»ó
À±ÀºÀÏ
·ù±ÙÈ£
±è¸íÁØ
Youngsang No
Unil Yun
Keun Ho Ryu
Myung Jun Kim
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 15 NO. 02 PP. 0275 ~ 0278 (2008. 11) |
Çѱ۳»¿ë (Korean Abstract) |
µ¥ÀÌÅÍ ¸¶ÀÌ´×Àº ÇöÀç ¸Å¿ì °¢±¤¹Þ°í ÀÖ´Â ºÐ¾ß´Ù. ¿¬°ü±ÔĢŽ»ç´Â Æ®·£Àè¼Ç µ¥ÀÌÅͺ£À̽º¿¡¼ ÀÏÁ¤ºóµµ ÀÌ»óÀÇ ÆÐÅÏÀ» ã¾Æ³»´Â ÀÛ¾÷À» ¸»ÇÑ´Ù. ±×Áß ºó¹ß ¼ºê ±×·¡ÇÁ ÆÐÅÏ ¸¶ÀÌ´×Àº ÃÖ±Ù °ü½ÉÀÌ ´Ã¾î³ª°í ÀÖÀ¸¸ç, ±× È°¿ëµµ ¶ÇÇÑ ¸Å¿ì ³ô´Ù. ±×·¡ÇÁ ¸¶ÀÌ´×Àº ¾ÆÀÌÅۼ¸¶À̴׺¸´Ù ÈνŠ´õ ¸¹Àº °è»êÀ» ÇÊ¿ä·Î ÇÑ´Ù. Áߺ¹À» ÃÖ¼ÒÈ ÇÏ´Â ¹æ¹ýÀÌ ÇÊ¿äÇϸç, ±×Áß °¡Àå ÁÁÀº ¼º´ÉÀ» º¸ÀÌ´Â GASTON ¾Ë°í¸®ÁòÀ» ºÐ¼®ÇÑ´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
Resently, there are many research of datamining. On the transaction dataset. association rules is made by finding of interecting patterns. A part of mining. sub-structure mining is increased in interest of and applied to many high technology. But graph mining has more computing time then itemset mining. Therefore, that need efficient way for avoid duplication. GASTON is best algorithm of duplication free. This paper analyze GASTON and expect the future work
|
Å°¿öµå(Keyword) |
±×·¡ÇÁ ¸¶ÀÌ´×
ºó¹ßÆÐÅϸ¶ÀÌ´×
ÆÐÅÏÈ®Àå±â¹ý
ÀÚÀ¯Æ®¸® È®Àå±â¹ý
graph mining
frquent pattern mining
pattern growth method
free tree base extension
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|