C-Rank 一种 Deep Web 数据记录可信度评估方法 艾静, 王仲远, 孟小峰.pdfVIP

ISSN 1673-9418 CODEN JKYTA8 E-mail:fcst@ Journal of Frontiers of Computer Science and Technology Tel: +86-10 * C-Rank: 一种 Deep Web 数据记录可信度评估方法 + 艾静, 王仲远, 孟小峰 中国人民大学 信息学院, 北京 100872 C-Rank: A Credibility Evaluation Method for Deep Web Records AI Jing, WANG Zhong-yuan, MENG Xiao-feng School of Information, Renmin University of China, Beijing 100872, China + Corresponding author: E-mail: xfmeng@ Abstract: How to identify and evaluate information credibility ranking has become an increasing important problem. To address the issue, an effective credibility evaluation method called C-Rank to compute trust values of records in Deep Web databases is proposed, which constructs an S-R Credibility Graph for each record. The graph contains 2 types of vertices and 3 types of edges. Firstly, each vertex’s local trust value is computed by using out-degrees based on the idea of trust propagation. Then, the weight of Record vertex is computed by using its in-degree and adjacent Site vertices’ local trust values. Lastly the global trust value of the S-R Credibility Graph is computed, which denotes the records credibility in the whole Web. Experiment results show C-Rank can evaluate credibility rankings of records appropriately and discriminate false information effectively. This method is generally applicable to all domains of Deep Web. Key words: Deep Web; Web Information Credibility; S-R Credibility Graph; Trust Propagation 摘 要：针对 Web信息可信度问题，提出了一种为 Deep Web数据记录计算可信度的有效方法 C-Rank。该方法为每 一条记录构造一个 S-R可信度网络，包含两种类型顶点及三种类型边。首先基于可信度传播的思想，利用顶点出 度为每一个顶点计算其局部可信度值；再利用 Record 顶点入度及相邻 Site 顶点的可信度值，为该 Record 顶点 计算权值；继而求得整个 S-R网络的全局可信度值。实验证明，C-Rank方法能够合理而有效地评价数据记录的可