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...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
IEEE Explorer
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/14221 |
| _version_ | 1848748564810825728 |
|---|---|
| author | Singh, Ashutosh Kumar Ravi, K. Alex, G. |
| author2 | Frenz Ko |
| author_facet | Frenz Ko Singh, Ashutosh Kumar Ravi, K. Alex, G. |
| author_sort | Singh, Ashutosh Kumar |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T07:07:03Z |
| format | Conference Paper |
| id | curtin-20.500.11937-14221 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T07:07:03Z |
| publishDate | 2010 |
| publisher | IEEE Explorer |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-142212017-01-30T11:42:14Z Efficient Algorithm for Handling Dangling Pages Using Hypothetical Node Singh, Ashutosh Kumar Ravi, K. Alex, G. Frenz Ko Dangling Pages PageRank Link rot Penalty Pages zero-one-gap 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. 2010 Conference Paper http://hdl.handle.net/20.500.11937/14221 IEEE Explorer fulltext |
| spellingShingle | Dangling Pages PageRank Link rot Penalty Pages zero-one-gap Singh, Ashutosh Kumar Ravi, K. Alex, G. Efficient Algorithm for Handling Dangling Pages Using Hypothetical Node |
| title | Efficient Algorithm for Handling Dangling Pages Using Hypothetical Node |
| title_full | Efficient Algorithm for Handling Dangling Pages Using Hypothetical Node |
| title_fullStr | Efficient Algorithm for Handling Dangling Pages Using Hypothetical Node |
| title_full_unstemmed | Efficient Algorithm for Handling Dangling Pages Using Hypothetical Node |
| title_short | Efficient Algorithm for Handling Dangling Pages Using Hypothetical Node |
| title_sort | efficient algorithm for handling dangling pages using hypothetical node |
| topic | Dangling Pages PageRank Link rot Penalty Pages zero-one-gap |
| url | http://hdl.handle.net/20.500.11937/14221 |