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

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ÇÐȸÁö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ÇÐȸÁö > µ¥ÀÌÅͺ£À̽º ¿¬±¸È¸Áö(SIGDB)

µ¥ÀÌÅͺ£À̽º ¿¬±¸È¸Áö(SIGDB)

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) BFS¿¡ ±â¹ÝÇÑ Æ÷½ºÆ® ·©Å·: ¾Ë°í¸®Áò ¹× ¼º´É Æò°¡
¿µ¹®Á¦¸ñ(English Title) Post Ranking Based on BFS: Algorithm and Its Performance Evaluation
ÀúÀÚ(Author) Ȳ¿ø¼®   µµ¿µÁÖ   ¹ÚÁÖ¾È ±è»ó¿í   Won-Seok Hwang   Young-Joo Do   Juan Parc   Sang-Wook Kim  
¿ø¹®¼ö·Ïó(Citation) VOL 31 NO. 02 PP. 0133 ~ 0141 (2015. 08)
Çѱ۳»¿ë
(Korean Abstract)
±âÁ¸ÀÇ Æ÷½ºÆ® ·©Å· ¾Ë°í¸®Áò¿¡¼­ Æ÷½ºÆ®ÀÇ ·©Å·Àº ÇØ´ç Æ÷½ºÆ®¿Í ¿¬°üµÈ ºí·Î°ÅÀÇ ´É·ÂÀ̳ª ¿¬°üµÈ Æ÷½ºÆ®µéÀÇ Ç°Áú¿¡ ÀÇÇÏ¿© °áÁ¤µÈ´Ù. Å©°Ô ¿¬°ü¼ºÀÌ ¾ø´Â Æ÷½ºÆ®³ª ºí·Î°Åµµ Æ÷½ºÆ®ÀÇ ·©Å·¿¡ ¿µÇâÀ» ¹ÌÄ¥ ¼ö ÀÖÀ¸¸ç, Á¤È®µµ¸¦ ¶³¾î¶ß¸®´Â ¿äÀÎÀ¸·Î ÀÛ¿ëÇÒ ¼ö ÀÖ´Ù. º» ³í¹®¿¡¼­´Â ÀÌ·¯ÇÑ ¹®Á¦Á¡À» ÇØ°áÇϱâ À§ÇÏ¿© BFS¿¡ ±â¹ÝÇÑ Æ÷½ºÆ® ·©Å· ¾Ë°í¸®ÁòÀÎ PBFS¸¦ Á¦¾ÈÇÑ´Ù. PBFS´Â ƯÁ¤ Æ÷½ºÆ®ÀÇ ·©Å·À» °è»êÇϱâ À§ÇÏ¿© ±×¿Í ¿¬°üµÈ ºí·Î°Å¿Í Æ÷½ºÆ®¸¦ Á¦ÇÑÇÏ°í, ¿¬°ü¼º¿¡ µû¸¥ °¡ÁßÄ¡¸¦ ºÎ¿©ÇÏ¿© Á¤È®µµ¸¦ Çâ»óÇÑ´Ù. PBFSÀÇ Á¤È®µµ¸¦ °ËÁõÇϱâ À§ÇÏ¿© ½ÇÁ¦ µ¥ÀÌÅ͸¦ ÀÌ¿ëÇÑ ½ÇÇèÀ» ¼öÇàÇÏ¿´À¸¸ç, Á¦¾ÈÇÏ´Â PBFS°¡ ±âÁ¸ Æ÷½ºÆ® ·©Å· ¾Ë°í¸®Áòº¸´Ù ¿ì¼öÇÑ Á¤È®µµ¸¦ º¸¿´´Ù.
¿µ¹®³»¿ë
(English Abstract)
Existing post ranking algorithms assume that the ranking of a post is related to both of the relevant posts and bloggers connected by blog-actions such as trackbacks, scraps, and comments. For this reason, existing algorithms factor in distant related posts/bloggers, which negatively influences ranking accuracy. In this paper, to eliminate the effect of less related posts and bloggers in ranking, we propose a novel post ranking algorithm, PBFS. This algorithm selects the relevant posts and bloggers in the manner of the breadth first search and additionally considers weights by the relatedness between a target post and the other posts/bloggers. We evaluate the accuracy of ranking algorithms by performing extensive experiments using real-world blog data. The experimental results reveal that our algorithm outperforms the existing algorithms.
Å°¿öµå(Keyword) ºí·Î±×   ºí·Î°í½ºÇǾ Æ÷½ºÆ® ·©Å· ¾Ë°í¸®Áò   ºí·Î±× ¾×¼Ç   ¼º´É Æò°¡  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå