Finding related hubs and authorities

Proceedings of the IEEE/LEOS 3rd International Conference on Numerical Simulation of Semiconductor Optoelectronic Devices (IEEE Cat. No.03EX726) Pub Date : 2003-11-10 DOI:10.1109/LAWEB.2003.1250302

P. Chirita, D. Olmedilla, W. Nejdl

引用次数: 7

Abstract

A new algorithm for finding hubs (and authorities) related to a specific Web page is presented. Various aspects have been investigated in this direction, like extensions of the HITS algorithm or modifications to the pagerank algorithm. Our focus is mainly oriented on computing hub scores, but the formulas for authority scores are almost always analogous.

查看原文本刊更多论文

寻找相关的中心和当局

提出了一种用于查找与特定Web页面相关的集线器(和权限)的新算法。在这个方向上已经研究了各个方面，如扩展HITS算法或修改pagerank算法。我们主要关注计算中心分数，但是权威分数的公式几乎总是类似的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊