DocumentCode
3499285
Title
Research of PageRank Algorithm Based on Transition Probability
Author
Ma, Haibo ; Chen, Shiyong ; Wang, Deguang
Author_Institution
Software Inst., Dalian Jiaotong Univ., Dalian, China
Volume
1
fYear
2010
fDate
23-24 Oct. 2010
Firstpage
153
Lastpage
155
Abstract
In order to improve the veracity of the web search, this paper studies the PageRank algorithm, proposes a new method PBTP Algorithm (PageRank Based on Transition Probability), that is an improvement for the classical PageRank method. As forwarding links in a web page are different, the transition probability of a link to be clicked is different too. For the classical PageRank value, should assign more authority value to the page according to its clicking probability with high authority value, effectively to focus the authority value on more meaningful web page, finally extracts meaningful page with high authority value. This paper takes advantage of Web link structure, proposes an unequal way to treat the different pages when distributing authorities. And the experiment shows that PBTP can improve PageRank effectively.
Keywords
Web sites; information retrieval; probability; PageRank based on transition probability algorithm; Web link structure; Web page; Web search; authority value; clicking probability; PBTP; PageRank; distributing authority; transition probability;
fLanguage
English
Publisher
ieee
Conference_Titel
Web Information Systems and Mining (WISM), 2010 International Conference on
Conference_Location
Sanya
Print_ISBN
978-1-4244-8438-6
Type
conf
DOI
10.1109/WISM.2010.63
Filename
5662302
Link To Document