Efficient Algorithm for Handling Dangling Pages Using Hypothetical Node
MetadataShow full item record
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.
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.
Showing items related by title, author, creator and subject.
Kumar, R.; Singh, Ashutosh Kumar (2010)Problem statement: A study on hyperlink analysis and the algorithms used for link analysis in the Web Information retrieval was done. Approach: This research was initiated because of the dependability of search engines ...
Goh, Kwang Leng (2013)Web spamming has tremendously subverted the ranking mechanism of information retrieval in Web search engines. It manipulates data source maliciously either by contents or links with the intention of contributing negative ...
Juanuwattanakul, Parachai (2012)Voltage instabilities and subsequent system collapses are considered as growing concerns in modern multiphase distribution networks as they are progressively forced to operate closer to their stability limits due to many ...