Incremental maintenance of C-rank scores in dynamic web environment

Citations

SCOPUS

1

초록

C-Rank (contribution-based ranking) is a state-of-the-art algorithm for ranking web pages. It combines content and link information by introducing the concept of contribution, which implies how much a page contributes to improving the content quality of other pages. However, C-Rank suffers from taking infeasible time to reflect changes in World Wide Web to every page's C-Rank score. In this paper, we propose an effective and efficient method to incrementally maintain C-Rank scores of terms in web pages. Our proposed method is carefully designed to selectively update C-Rank scores of specific pages without any accuracy loss, rather than re-computing all the C-Rank scores of all the terms in all the pages from the scratch. Our experimental results on real-world dataset confirm the effectiveness and efficiency of our proposed method.

키워드

CyberneticsAccuracy lossContent qualitiesEffectiveness and efficienciesIncremental maintenanceLink informationsRank scoresRe-computingWeb environmentWebsites
제목
Incremental maintenance of C-rank scores in dynamic web environment
저자
Koo, JangwanKim, Dong-JinChae, Dong-KyuKim, Sang-Wook
DOI
10.1109/SMC.2017.8122838
발행일
2017-12
유형
Conference Paper
저널명
2017 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2017
2017-January
페이지
1570 ~ 1574