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

»çÀÌÆ®¸Ê

Loading..

Please wait....

Çмú´ëȸ ÇÁ·Î½Ãµù

Ȩ Ȩ > ¿¬±¸¹®Çå > Çмú´ëȸ ÇÁ·Î½Ãµù > Çѱ¹Á¤º¸°úÇÐȸ Çмú´ëȸ > 2019³â ÄÄÇ»ÅÍÁ¾ÇÕÇмú´ëȸ

2019³â ÄÄÇ»ÅÍÁ¾ÇÕÇмú´ëȸ

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) Bias Walk Based RDF Entity Embeddings
¿µ¹®Á¦¸ñ(English Title) Bias Walk Based RDF Entity Embeddings
ÀúÀÚ(Author) Van T.T. Duong   Kisung Park   Young-Koo Lee  
¿ø¹®¼ö·Ïó(Citation) VOL 46 NO. 01 PP. 0178 ~ 0180 (2019. 06)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
Nowadays, extracting feature vector representation from graph structure is attracting attention of many researchers since the vectors can be applied for any machine learning task. In this paper, we focus on the specific task that is RDF entity embedding that aims to represent entities in the RDF graph as low dimensional vectors while maintaining the most significant information from the original graph. In particular, we propose a new method to map each entity in RDF to vector using word2vec as a language modeling to learn embeddings. In order to use word2vec, we produce a bias random walk, to generate sequences as node context. This bias relies on common connections of similar entities so that we make sure that similar entities will generate similar sequences. Experimental results and the case study on real graphs demonstrate that our method achieves better efficiency.
Å°¿öµå(Keyword)
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå