View Item 

Efficient Algorithm for Handling Dangling Pages Using Hypothetical Node

Access Status
Open access
Authors
Singh, Ashutosh Kumar
Ravi, K.
Alex, G.
Date
2010
Type
Conference Paper

Metadata
Show full item record
Citation
Singh, Ashutosh Kumar and Ravi, Kumar P. and Alex, Goh Kwang Leng. 2010. Efficient Algorithm for Handling Dangling Pages Using Hypothetical Node, in Ko, F. (ed), International Conference on Digital Content, Multimedia Technology and its Applications (IDC), Aug 16 2010, pp. 44-49. Seoul, Korea: IEEE.
Source Title
IEEE Proceeding
Source Conference
International Conference on Digital Content, Multimedia Technology and its Applications (IDC)
School
Curtin Sarawak - Faculty Office
Remarks

Copyright © 2010 IEEE This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

URI
Collection
Abstract

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 retrieval from the Web. We proposed an algorithm to handle these pages using a hypothetical node and comparing it with page rank algorithm.