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

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö > Á¤º¸°úÇÐȸ ³í¹®Áö D : µ¥ÀÌŸº£À̽º

Á¤º¸°úÇÐȸ ³í¹®Áö D : µ¥ÀÌŸº£À̽º

Current Result Document : 9 / 9 ÀÌÀü°Ç ÀÌÀü°Ç

ÇѱÛÁ¦¸ñ(Korean Title) XML ¹®¼­ÀÇ °øÅë ±¸Á¶¸¦ ÀÌ¿ëÇÑ Å¬·¯½ºÅ͸µ ±â¹ý
¿µ¹®Á¦¸ñ(English Title) A Clustering Technique using Common Structures of XML Documents
ÀúÀÚ(Author) ȲÁ¤Èñ   ·ù±ÙÈ£  
¿ø¹®¼ö·Ïó(Citation) VOL 32 NO. 06 PP. 0650 ~ 0661 (2005. 12)
Çѱ۳»¿ë
(Korean Abstract)
ÀÎÅͳÝÀÇ ¼ºÀåÀ¸·Î ÀÎÇØ ¹Ý±¸Á¶ÀûÀÎ ¹®¼­ÀÇ Ç¥ÁØÀÎ XML ¹®¼­ÀÇ »ç¿ëÀÌ Áõ°¡ÇÏ°í ÀÖ°í ÀÌ¿¡ µû¶ó XML ¹®¼­ÀÇ ÅëÇÕ°ú °Ë»öÀ» À§ÇÑ ¿¬±¸°¡ ¸¹ÀÌ ÁøÇàµÇ°í ÀÖ´Ù. È¿À²ÀûÀÎ ¹®¼­ÀÇ ÅëÇÕ°ú °Ë»öÀ» À§ÇÑ ±âÃÊ ÀÛ¾÷Àº À¯»ç ±¸Á¶ÀÇ XML ¹®¼­¸¦ Ŭ·¯½ºÅ͸µ ÇÏ´Â °ÍÀÌ´Ù. ±âÁ¸ ¿¬±¸ÀÇ XML ¹®¼­ Ŭ·¯½ºÅ͸µ¿¡¼­´Â ¹®¼­°£ÀÇ ±¸Á¶Àû À¯»çµµ¸¦ ÀÌ¿ëÇÏ¿© Ŭ·¯½ºÅ͸¦ »ý¼ºÇÑ´Ù. ±×·¯³ª ÀÌ·¯ÇÑ ¹æ¹ýÀº ¹®¼­°£ÀÇ ±¸Á¶Àû À¯»ç¼ºÀÇ Á¤È®ÇÑ ÃøÁ¤ ±âÁØÀ» ¸¸µé±â ¾î·Æ°í, ¹Ýº¹ÀûÀÎ À¯»çµµÀÇ ºñ±³·Î ÀÎÇØ Ã³¸® ¼Óµµ°¡ ´À¸®´Ù´Â ´ÜÁ¡ÀÌ ÀÖ´Ù. ÀÌ·¯ÇÑ ¹®Á¦Á¡À» °³¼±Çϱâ À§ÇÏ¿© ÀÌ ³í¹®¿¡¼­´Â ¸¹Àº µ¥ÀÌŸ¿¡µµ À¯¿¬ÇÏ°Ô Àû¿ëÇÒ ¼ö ÀÖ´Â Æ®·£Àè¼Ç µ¥ÀÌŸ¸¦ À§ÇÑ Å¬·¯½ºÅ͸µ ¾Ë°í¸®ÁòÀ» Àû¿ëÇÏ´Â »õ·Î¿î Ŭ·¯½ºÅ͸µ ¹æ¹ýÀ» Á¦¾ÈÇÑ´Ù. ÀÌ ³í¹®¿¡¼­ Á¦¾ÈÇϴ Ŭ·¯½ºÅ͸µ ¹æ¹ýÀº ÇϳªÀÇ DTD³ª XML ½ºÅ°¸¶¸¦ °øÀ¯ÇÏ´Â ¹®¼­ ÁýÇÕÀÌ ¾Æ´Ñ ½ºÅ°¸¶°¡ ¾ø´Â ´Ù¾çÇÑ ±¸Á¶ÀÇ XML ¹®¼­µéÀ» ´ë»óÀ¸·Î °øÅë ±¸Á¶¸¦ ÀÌ¿ëÇÑ´Ù. °øÅë ±¸Á¶¸¦ ÀÌ¿ëÇϱâ À§ÇÏ¿© XML ¹®¼­ÀÇ Æ®¸® ¸ðµ¨¿¡¼­ ±¸Á¶¸¦ ºÐ¸®ÇÏ¿© ºó¹ß ±¸Á¶¸¦ ÃßÃâÇÏ°í À̸¦ ±â¹ÝÀ¸·Î Ŭ·¯½ºÅ͸µÀ» ¼öÇàÇÑ´Ù. ¾Æ¿ï·¯, ±âÁ¸ ¿¬±¸¿ÍÀÇ ºñ±³ ¹× ½ÇÇèÀ» ÅëÇØ Á¦¾È ±â¹ýÀÇ È¿À²¼ºÀ» º¸ÀδÙ.
¿µ¹®³»¿ë
(English Abstract)
As the Internet is growing, the use of XML which is a standard of semi-structured document is increasing. Therefore, there are on going works about integration and retrieval of XML documents. However, the basis of efficient integration and retrieval of documents is to cluster XML documents with similar structure. The conventional XML clustering approaches use the hierarchical clustering algorithm that produces the demanded number of clusters through repeated merge, but it have some problems that it is difficult to compute the similarity between XML documents and it costs much time to compare similarity repeatedly. In order to address this problem, we use clustering algorithm for transactional data that is scale for large size of data. In this paper we use common structures from XML documents that don't have DTD or schema. In order to use common structures of XML document, we extract representative structures by decomposing the structure from a tree model expressing the XML document, and we perform clustering with the extracted structure. Besides, we show efficiency of proposed method by comparing and analyzing with the previous method.,
Å°¿öµå(Keyword) ¹®¼­ Ŭ·¯½ºÅ͸µ   Document Clustering   XML Ŭ·¯½ºÅ͸µ   XML Clustering   XML ¹®¼­   XML Document   ±¸Á¶Àû À¯»ç¼º   Structural Similarity  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå