Efficient Algorithm for Handling Dangling Pages Using Hypothetical Node
| dc.contributor.author | Singh, Ashutosh Kumar | |
| dc.contributor.author | Ravi, K. | |
| dc.contributor.author | Alex, G. | |
| dc.contributor.editor | Frenz Ko | |
| dc.date.accessioned | 2017-01-30T11:42:14Z | |
| dc.date.available | 2017-01-30T11:42:14Z | |
| dc.date.created | 2011-03-14T20:01:42Z | |
| dc.date.issued | 2010 | |
| dc.identifier.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. | |
| dc.identifier.uri | http://hdl.handle.net/20.500.11937/14221 | |
| dc.description.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. | |
| dc.publisher | IEEE Explorer | |
| dc.subject | Dangling Pages | |
| dc.subject | PageRank | |
| dc.subject | Link rot | |
| dc.subject | Penalty Pages | |
| dc.subject | zero-one-gap | |
| dc.title | Efficient Algorithm for Handling Dangling Pages Using Hypothetical Node | |
| dc.type | Conference Paper | |
| dcterms.source.startPage | 44 | |
| dcterms.source.endPage | 49 | |
| dcterms.source.title | IEEE Proceeding | |
| dcterms.source.series | IEEE Proceeding | |
| dcterms.source.conference | International Conference on Digital Content, Multimedia Technology and its Applications (IDC) | |
| dcterms.source.conference-start-date | Aug 16 2010 | |
| dcterms.source.conferencelocation | Seoul, Korea | |
| dcterms.source.place | Korea | |
| curtin.note |
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. | |
| curtin.department | Curtin Sarawak - Faculty Office | |
| curtin.accessStatus | Open access |