Affiliations: School of Computer and Software Engineering, Xihua University, Chengdu, Sichuan, China
Correspondence:
[*]
Corresponding author: Yajun Du, School of Computer and Software Engineering, Xihua University, Chengdu, Sichuan 610039, China. Tel.: +86 028 87720554; Fax: +86 028 87726572; E-mail:[email protected]
Abstract: The Hyperlink-Induced Topic Search (HITS) algorithm developed by Jon Kleinberg made use of the link structure of the web pages on the Web in order to discover and rank web pages being relevant to a particular topic. However it only took account of the hyperlink structure, while completely excluded contents of web pages, and it ignored the fact that degrees of the importance of many hyperlinks on the Web may be different. In this paper, to overcome the topic drifts, we proposed a novel page ranking algorithm combining the hyperlink with the triadic closure theory by considering fully the Vector Space Model (VSM) and the TrustRank algorithm. The method firstly computed the relevance between two randomly arbitrary web pages based on web page topic similarity and common reference degree. Then, by using that model as a point of reference, a new adjacency matrix was constructed to iteratively calculate the authority and hub values of web pages. Next, we calculated the trust-degree for each web page in the basic set by the trust-score algorithm. Finally, the score for each web page is computed by linearly merging the authority and the trust-degree. In our experiments, we used five classic HITS-based algorithms to compare with our proposed page ranking algorithm-PCTHITS (Web Page Topic Similarity, Common Reference Degree, Trust-degree) algorithm. The experimental results demonstrated that our proposed algorithm outperform the other four classic improved algorithms and HITS algorithm.
Keywords: HITS algorithm, triadic closure, trust-degree, topic similarity, common reference, random walks
