Computer Science – Information Retrieval
Scientific paper
2009-09-03
Computer Science
Information Retrieval
10 pages, 3 figures, to be appear in Journal of Advanced Computational Intelligence and Intelligent Informatics, Vol. 14 No. 1
Scientific paper
We present a new method to accelerate the HITS algorithm by exploiting hyperlink structure of the web graph. The proposed algorithm extends the idea of authority and hub scores from HITS by introducing two diagonal matrices which contain constants that act as weights to make authority pages more authoritative and hub pages more hubby. This method works because in the web graph good authorities are pointed to by good hubs and good hubs point to good authorities. Consequently, these pages will collect their scores faster under the proposed algorithm than under the standard HITS. We show that the authority and hub vectors of the proposed algorithm exist but are not necessarily be unique, and then give a treatment to ensure the uniqueness property of the vectors. The experimental results show that the proposed algorithm can improve HITS computations, especially for back button datasets.
Furukawa Masashi
Mirzal Andri
No associations
LandOfFree
A Method for Accelerating the HITS Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Method for Accelerating the HITS Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Method for Accelerating the HITS Algorithm will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-663446