Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Subtitle:
Article type: Research Article
Authors: Du, Yajun* | Tian, Xiuxia | Liu, Wenjun | Wang, Min | Song, Wen | Fan, Yongquan | Wang, Xiaoming
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:dyjdoc2003@aliyun.com
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
DOI: 10.3233/IDA-150762
Journal: Intelligent Data Analysis, vol. 19, no. 5, pp. 1131-1149, 2015
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl