Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö D
Current Result Document : 35 / 35
ÇѱÛÁ¦¸ñ(Korean Title) |
ÇÑ ¹øÀÇ µ¥ÀÌÅͺ£À̽º Ž»ö¿¡ ÀÇÇÑ ºó¹ßÇ׸ñÁýÇÕ Å½»ö |
¿µ¹®Á¦¸ñ(English Title) |
Frequent Patterns Mining using only one-time Database Scan |
ÀúÀÚ(Author) |
ä´öÁø
±è·æ
ÀÌ¿ë¹Ì
ȲºÎÇö
·ù±ÙÈ£
Duck Jin Chai
Long Jin
Yongmi Lee
Buhyun Hwang
Keun Ho Ryu
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 15-D NO. 01 PP. 0015 ~ 0022 (2008. 02) |
Çѱ۳»¿ë (Korean Abstract) |
º» ³í¹®¿¡¼´Â ÇÑ ¹øÀÇ µ¥ÀÌÅͺ£À̽º ½ºÄµÀ¸·Î ºó¹ßÇ׸ñÁýÇÕµéÀ» »ý¼ºÇÒ ¼ö ÀÖ´Â È¿À²ÀûÀÎ ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. Á¦¾ÈÇÏ´Â ¾Ë°í¸®ÁòÀº ºó¹ß Ç׸ñ°ú ±× ºó¹ßÇ׸ñÀ» Æ÷ÇÔÇÏ°í ÀÖ´Â Æ®·£Àè¼Ç°úÀÇ °ü°è¸¦ ³ªÅ¸³»´Â À̺ÐÇÒ ±×·¡ÇÁ(bipartite graph)¸¦ »ý¼ºÇÑ´Ù. ±×¸®°í »ý¼ºµÈ À̺ÐÇÒ ±×·¡ÇÁ¸¦ ÀÌ¿ëÇÏ¿© Èĺ¸ Ç׸ñÁýÇÕµéÀ» »ý¼ºÇÏÁö ¾Ê°í ºó¹ß Ç׸ñÁýÇÕµéÀ» ÃßÃâÇÒ ¼ö ÀÖ´Ù. À̺ÐÇÒ ±×·¡ÇÁ´Â ºó¹ßÇ׸ñµéÀ» ÃßÃâÇϱâÀ§ÇØ ´ë¿ë·®ÀÇ Æ®·£Àè¼Ç µ¥ÀÌÅͺ£À̽º¸¦ ½ºÄµÇÒ ¶§ »ý¼ºµÈ´Ù. À̺ÐÇÒ ±×·¡ÇÁ´Â ºó¹ßÇ׸ñµé°ú ±×µéÀÌ ¼ÓÇÑ Æ®·£Àè¼Çµé °£ÀÇ °ü°è¸¦ ¿§Áö(edge)·Î ¿¬°áÇÑ ±×·¡ÇÁÀÌ´Ù. Áï, º» ³í¹®¿¡¼ÀÇ À̺ÐÇÒ ±×·¡ÇÁ´Â ´ë¿ë·®ÀÇ µ¥ÀÌÅͺ£À̽º¿¡¼ ½±°Ô ¹ß°ßÇÒ ¼ö ¾ø´Â ºó¹ßÇ׸ñ°ú Æ®·£Àè¼ÇÀÇ °ü°è¸¦ °Ë»öÇϱ⠽±°Ô »öÀÎ(index)ÈÇÑ ±×·¡ÇÁÀÌ´Ù. º» ³í¹®¿¡¼ Á¦¾ÈÇÏ´Â ¹æ¹ýÀº ÇÑ ¹øÀÇ µ¥ÀÌÅͺ£À̽º ½ºÄµ¸¸À» ¼öÇàÇÏ°í Èĺ¸ Ç׸ñÁýÇÕµéÀ» »ý¼ºÇÏÁö ¾Ê±â ¶§¹®¿¡ ±âÁ¸ÀÇ ¹æ¹ýµéº¸´Ù ºü¸¥ ½Ã°£¿¡ ºó¹ß Ç׸ñÁýÇÕµéÀ» ãÀ» ¼ö ÀÖ´Ù. |
¿µ¹®³»¿ë (English Abstract) |
In this paper, we propose an efficient algorithm using only one-time database scan. The proposed algorithm creates the bipartite graph which indicates relationship of large items and transactions including the large items. And then we can find large itemsets using the bipartite graph. The bipartite graph is generated when database is scanned to find large items. We can't easily find transactions which include large items in the large database. In the bipartite graph, large items and transactions are linked each other. So, we can trace the transactions which include large items through the link information. Therefore the bipartite graph is a indexed database which indicates inclusion relationship of large items and transactions. We can fast find large itemsets because proposed method conducts only one-time database scan and scans indexed the bipartite graph. Also, it don't generate candidate itemsets. |
Å°¿öµå(Keyword) |
µ¥ÀÌÅ͸¶ÀÌ´×
¿¬°ü±ÔÄ¢
À̺ÐÇÒ ±×·¡ÇÁ
Data Mining
Association Rule
Bipartite Graph
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|