Efficient hyperlink analysis using robust Proportionate Prestige Score in PageRank algorithm |
| |
Affiliation: | 1. Department of Computer Science, Rani Anna Government College for Women, Tirunelveli, Tamil Nadu, India;2. Research Scholar, Manonmaniam Sundaranar University, Tirunelveli, Tamil Nadu, India;1. School of Computer Engineering, Nanyang Technological University, Singapore;2. CIST, Korea University, Seoul, South Korea |
| |
Abstract: | Existing PageRank algorithm exploits the Hyperlink Structure of the web with uniform transition probability distribution to measure the relative importance of web pages. This paper proposes a novel method namely Proportionate Prestige Score (PPS) for prestige analysis. This proposed PPS method is purely based on the exact prestige of web pages, which is applicable to Initial Probability Distribution (IPD) matrix and Transition Probability Distribution (TPD) matrix. This proposed PPS method computes the single PageRank vector with non-uniform transition probability distribution, using the link structure of the web pages offline. This non-uniform transition probability distribution has efficiently overcome the dangling page problem than the existing PageRank algorithm. This paper provides benchmark analysis of ranking methods: PageRank and proposed PPS. These methods are tested with real social network data from three different domains: Social Circle:Facebook, Wikipedia vote network and Enron email network. The findings of this research work propose that the quality of the ranking has improved by using the proposed PPS method compared with the existing PageRank algorithm. |
| |
Keywords: | Web mining Link-based search Prestige analysis |
本文献已被 ScienceDirect 等数据库收录! |
|