Efficient Algorithm for Handling Dangling Pages Using Hypothetical Node

Efficient Algorithm for Handling Dangling Pages Using Hypothetical Node

Dangling pages are one of the major drawbacks of page rank algorithm which is used by different search engines to calculate the page rank. The number of these pages increasing with web as the source of knowledge. However search engines are the main tools used in knowledge extraction or Information r...

Full description

Bibliographic Details
Main Authors: Singh, Ashutosh Kumar, Ravi, K., Alex, G.
Other Authors: Frenz Ko
Format: Conference Paper
Published: IEEE Explorer 2010
Subjects:
Dangling Pages
PageRank
Link rot
Penalty Pages
zero-one-gap
Online Access:http://hdl.handle.net/20.500.11937/14221

Internet

http://hdl.handle.net/20.500.11937/14221

Similar Items