Àüü
ÀüÀÚ/Àü±â
Åë½Å
ÄÄÇ»ÅÍ
·Î±×ÀÎ
ȸ¿ø°¡ÀÔ
About Us
ÀÌ¿ë¾È³»
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±³À°Á¤º¸
¿¬±¸ ù°ÉÀ½
ÇаúÁ¤º¸
°ÀÇÁ¤º¸
µ¿¿µ»óÁ¤º¸
E-Learning
¿Â¶óÀÎ Àú³Î
½ÉÈÁ¤º¸
¿¬±¸ ¹× ±â¼úµ¿Çâ
Áֿ俬±¸ÅäÇÈ
ÁÖ¿ä°úÁ¦ ¹× ±â°ü
Çؿܱâ°ü °ü·ÃÀÚ·á
¹ÙÀÌ¿À Á¤º¸±â¼ú
ÁÖ¿ä Archive Site
Æ÷Ä¿½ºiN
¿¬±¸ÀÚ Á¤º¸
¶óÀÌ¡½ºÅ¸
ÆÄ¿öiNÅͺä
¼¼ÁßÇÑ
¿¬±¸ÀÚ·á
¹®ÀÚ DB
¿ë¾î»çÀü
¾Ë¸²¸¶´ç
ºÎ½Ç ÇмúÈ°µ¿ ¿¹¹æ
³í¹®¸ðÁý
´ëȸ¾È³»
What's New
¿¬±¸ºñÁ¤º¸
±¸ÀÎÁ¤º¸
°øÁö»çÇ×
CSERIC ±¤Àå
Post-Conference
¿¬±¸ÀÚ Ä«Æä
ÀÚÀ¯°Ô½ÃÆÇ
Q&A
´Ý±â
»çÀÌÆ®¸Ê
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±³À°Á¤º¸
¿¬±¸ ù°ÉÀ½
ÇаúÁ¤º¸
°ÀÇÁ¤º¸
µ¿¿µ»óÁ¤º¸
E-Learning
¿Â¶óÀÎ Àú³Î
½ÉÈÁ¤º¸
¿¬±¸ ¹× ±â¼úµ¿Çâ
Áֿ俬±¸ÅäÇÈ
ÁÖ¿ä°úÁ¦ ¹× ±â°ü
Çؿܱâ°ü °ü·ÃÀÚ·á
¹ÙÀÌ¿À Á¤º¸±â¼ú
ÁÖ¿ä Archive Site
ÄÄÇ»ÅÍiN
¿¬±¸ÀÚ Á¤º¸
¿¬±¸ÀÚ·á
¹®ÀÚ DB
Ȧ·Î±×·¥ DB
¿ë¾î»çÀü
¾Ë¸²¸¶´ç
ºÎ½Ç ÇмúÈ°µ¿ ¿¹¹æ
³í¹®¸ðÁý
´ëȸ¾È³»
What's New
¿¬±¸ºñ Á¤º¸
±¸ÀÎÁ¤º¸
°øÁö»çÇ×
IT Daily
CSERIC ±¤Àå
Post-Conference
¿¬±¸ÀÚ Ä«Æä
ÀÚÀ¯°Ô½ÃÆÇ
Q&A
¼ºñ½º ¹Ù·Î°¡±â
¼³¹®Á¶»ç
¿¬±¸À±¸®
°ü·Ã±â°ü
Please wait....
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±¹³» ³í¹®Áö
Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö >
Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö
>
Á¤º¸°úÇÐȸ ³í¹®Áö D : µ¥ÀÌŸº£À̽º
Á¤º¸°úÇÐȸ ³í¹®Áö D : µ¥ÀÌŸº£À̽º
Current Result Document :
4
/ 4
ÀÌÀü°Ç
ÇѱÛÁ¦¸ñ(Korean Title)
¿¬°áÁ¤Ã¥À» ÀÌ¿ëÇÑ °³¹æÇü ¿¬°á µ¥ÀÌÅÍ Å¬¶ó¿ìµå¿¡¼ÀÇ ¿¬°á¼º È®Ãæ
¿µ¹®Á¦¸ñ(English Title)
Linkage Expansion in Linked Open Data Cloud using Link Policy
ÀúÀÚ(Author)
±è±¤¹Î
¼Õ¿ë¶ô
Kwangmin Kim
Yonglak Sohn
¿ø¹®¼ö·Ïó(Citation)
VOL 44 NO. 10 PP. 1045 ~ 1061 (2017. 10)
Çѱ۳»¿ë
(Korean Abstract)
º» ³í¹®Àº ½Ã¸àƽ À¥ÀÇ ½ÇÁ¦ÀûÀÎ ±¸Çö °á°úÀÎ °³¹æÇü ¿¬°á µ¥ÀÌÅÍ(Linked Open Data(LOD))Ŭ¶ó¿ìµå¿¡¼ÀÇ ¿¬°á¼ºÀ» È®ÃæÇÏ´Â ¹æ¾ÈÀ» Á¦½ÃÇÏ¿´´Ù. ÇöÀçÀÇ LOD Ŭ¶ó¿ìµå´Â ÃÖÃÊ ±â´ë¿Í´Â ´Þ¸® LODµé°£ÀÇ ¿¬°á¼º ºÎÁ·À¸·Î ÀÎÇÏ¿© È°¹ßÇÑ È°¿ëÀ» À̲ø¾î ³»Áö ¸øÇÏ°í ÀÖ´Ù.
¸¦ Àû¿ëÇÑ ¸í½ÃÀû ¿¬°áµéÀ» LOD¿¡ Á÷Á¢ ÷ºÎÇÏ¿© °ø°³ÇÏ´Â ÇöÀçÀÇ ¿¬°á¹æ½ÄÀº ¿¬°á´ë»ó LODµéÀÇ º¯°æ»óȲÀ» ½Ç½Ã°£À¸·Î °Ë»ö°á°ú¿¡ ¹Ý¿µÇÏÁö ¸øÇÏ¸ç º°µµÀÇ ÀÛ¾÷À» ÅëÇÏ¿© ÀÌ·¯ÇÑ ¸í½ÃÀû¿¬°áµéÀ» »ý¼ºÇÏ°í ÁÖ±âÀûÀ¸·Î °»½ÅÇÏ¿©¾ß ÇÑ´Ù´Â Á¦¾àÀ» °¡Áø´Ù. ÀÌ¿¡ º» ³í¹®Àº ¸í½ÃÀû¿¬°áµéÀ» ÷ºÎÇÏ´Â ´ë½Å LOD¸¶´Ù ¿¬°áÁ¤Ã¥À» ¸¶·ÃÇÏ°í À̸¦ LOD¿Í ÇÔ²² °ø°³ÇÏ´Â ¹æ¾ÈÀ» Á¦¾ÈÇÏ¿´´Ù. ¿¬°áÁ¤Ã¥¿¡´Â Ÿ°ÙLODµéÀ» ¼±Á¤ÇÏ°í ¿¬°áÆÇ´Ü¿¡ ÇÊ¿äÇÑ ¼ú¾î ½Öµé°ú À¯»çµµ¸¦ ¸í¼¼Çϵµ·Ï ÇÏ¿´´Ù. ÀÌ·¯ÇÑ ¿¬°áÁ¤Ã¥¿¡ ±â¹ÝÇÏ¿© ¿©·¯ LODµé¿¡ °ÅÃÄ ÁøÇàÇÏ´Â ½ÉÃþ°Ë»ö ±â´ÉÀ» API·Î ±¸ÇöÇÏ°í À̸¦ Github¸¦ ÅëÇÏ¿© °ø°³ÇÏ¿´´Ù. ±¸ÇöÇÑ ½ÉÃþ°Ë»öÀ» À¯»çµµ 1.0¢¦0.8, ±íÀÌ 4±îÁö¿¡¼ ½ÇÇèÇÑ °á°ú ½Å·ÚÀûÀÎ ¿¬°áµéÀ» 91%¢¦98% ¼öÁØÀ¸·Î Æ÷ÇÔÇÏ°í 170% Á¤µµ ±Ô¸ðÀÇ ÀûÁ¤ÇÑ È®À强À» Á¦°øÇÏ´Â °ÍÀ¸·Î Æò°¡µÇ¾ú´Ù.
¿µ¹®³»¿ë
(English Abstract)
This paper suggests a method to expand linkages in a Linked Open Data(LOD) cloud that is a practical consequence of a semantic web. LOD cloud, contrary to the first expectation, has not been used actively because of the lack of linkages. Current method for establishing links by applying
to explicit links and attaching the links to LODs have restrictions on reflecting target LODs¡¯ changes in a timely manner and maintaining them periodically. Instead of attaching them, this paper suggests that each LOD should prepare a link policy and publish it together with the LOD. The link policy specifies target LODs, predicate pairs, and similarity degrees to decide on the establishment of links. We have implemented a system that performs in-depth searching through LODs using their link policies. We have published APIs of the system to Github. Results of the experiment on the in-depth searching system with similarity degrees of 1.0 ¢¦ 0.8 and depth level of 4 provides searching results that include 91% ¢¦ 98% of the trustworthy links and about 170% of triples expanded.
Å°¿öµå(Keyword)
½Ã¸àƽ À¥
°³¹æÇü ¿¬°á µ¥ÀÌÅÍ
¿¬°áÁ¤Ã¥
½ÉÃþ°Ë»ö
¿ÂÅç·ÎÁö
semantic web
linked open data
link policy
in-depth search
ontology
RDF
ÆÄÀÏ÷ºÎ
PDF ´Ù¿î·Îµå
¸ñ·Ï
Copyright(c)
Computer Science Engineering Research Information Center
. All rights reserved.