Á¤º¸°úÇÐȸ ³í¹®Áö D : µ¥ÀÌŸº£À̽º
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
Prefix-Tree¸¦ ÀÌ¿ëÇÑ ³ôÀº À¯Æ¿¸®Æ¼ ÆÐÅÏ ¸¶ÀÌ´× ±â¹ý |
¿µ¹®Á¦¸ñ(English Title) |
High Utility Pattern Mining using a Prefix-Tree |
ÀúÀÚ(Author) |
Á¤º´¼ö
¾Æ¸Þµå ÆÄÇÑ
ÀÌÀαâ
¿ëȯ½Â
Byeongsoo Jeong
Chowdhury Farhan Ahmed
Ingi Lee
Hwanseong Yong
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 36 NO. 05 PP. 0341 ~ 0351 (2009. 10) |
Çѱ۳»¿ë (Korean Abstract) |
À¯Æ¿¸®Æ¼ ÆÐÅÏ ¸¶ÀÌ´×Àº µ¥ÀÌÅÍ Ç׸ñ¿¡ ´ëÇÑ ´Ù¸¥ °¡ÁßÄ¡¸¦ °í·ÁÇÒ ¼ö ÀÖ´Â ÀåÁ¡À¸·Î ÀÎÇÏ¿© ºñÁî´Ï½º µ¥ÀÌÅ͸¦ ºÐ¼®Çϴ ȯ°æ¿¡¼ È¿À²ÀûÀ¸·Î ÀÌ¿ëµÇ°í ÀÖ´Ù. ±×·¯³ª ±âÁ¸ÀÇ ºó¹ß ÆÐÅÏ(Frequent Pattern) ¸¶À̴׿¡¼ÀÇ Apriori ±ÔÄ¢À» ±×´ë·Î Àû¿ëÇϱ⠾î·Á¿î ¹®Á¦Á¡À¸·Î ÀÎÇÏ¿© ÆÐÅÏ ¸¶ÀÌ´×ÀÇ ¼º´ÉÀÌ ÇöÀúÇÏ°Ô ¶³¾îÁö°í ÀÖ´Ù. º» ¿¬±¸´Â Prefix-tree¸¦ ÀÌ¿ëÇÏ¿© Áö¼ÓÀûÀ¸·Î Áõ°¡ÇÏ´Â ºñÁî´Ï½º Æ®·£Àè¼Ç µ¥ÀÌÅͺ£À̽º¿¡ ´ëÇÑ À¯Æ¿¸®Æ¼ ÆÐÅÏ ¸¶ÀÌ´×À» È¿°úÀûÀ¸·Î ¼öÇàÇϱâ À§ÇÑ ±â¹ýÀ» Á¦¾ÈÇÑ´Ù. Á¦¾ÈÇÏ´Â ±â¹ýÀº Prefix-treeÀÇ °¢ Ç׸ñ ³ëµå¿¡ À¯Æ¿¸®Æ¼ °ªÀ» ÀúÀåÇÏ¿© FP-Growth ¾Ë°í¸®Áò¿¡¼¿Í °°ÀÌ Æ®¸®ÀÇ »óÇâ Ž»öÀ» ÅëÇÏ¿© ³ôÀº À¯Æ¿¸®Æ¼ ÆÐÅÏÀ» ºü¸£°Ô ã¾Æ³½´Ù. ¿©·¯ ÇüÅÂÀÇ ½ÇÇèÀ» ÅëÇÏ¿© ÀÌ¿ëÇÒ ¼ö ÀÖ´Â ¼¼°¡Áö ´Ù¸¥ Prefix-tree ±¸Á¶µé °£ÀÇ ¼º´ÉÀû Ư¡°ú ÆÐÅÏ Å½»öÀÇ ¹æ¹ýµéÀ» ºñ±³ÇÏ¿´À¸¸ç ½ÇÇè °á°ú¿¡ µû¶ó Á¦¾ÈÇÏ´Â ±â¹ýÀÌ ±âÁ¸ÀÇ ±â¹ýµé¿¡ ºñÇØ ¸¹Àº ¼º´É Çâ»óÀ» °¡Á®¿Ã ¼ö ÀÖ´Â °ÍÀ» ÀÔÁõÇÏ¿´´Ù |
¿µ¹®³»¿ë (English Abstract) |
Recently high utility pattern (HUP) mining is one of the most important research issues in data mining since it can consider the different weight values of items. However, existing mining algorithms suffer from the performance degradation because it cannot easily apply Apriori-principle for pattern mining. In this paper, we introduce new high utility pattern mining approach by using a prefix-tree as in FP-Growth algorithm. Our approach stores the weight value of each item into a node and utilizes them for pruning unnecessary patterns. We compare the performance characteristics of three different prefix-tree structures. By thorough experimentation, we also prove that our approach can give performance improvement to a degree. |
Å°¿öµå(Keyword) |
À¯Æ¿¸®Æ¼ ÆÐÅÏ ¸¶ÀÌ´×
µ¥ÀÌÅÍ ¸¶ÀÌ´×
Æ®·£Àè¼Ç ºóµµ
Æ®·£Àè¼Ç À¯Æ¿¸®Æ¼ °¡ÁßÄ¡
High utility pattern mining
data mining
transaction frequency
transaction weighted utilization
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|