The week's pick
Random Articles
Reseach Article
A Modified Algorithm to Handle Dangling Pages using Hypothetical Node
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 48 - Number 7 |
| Year of Publication: 2012 |
| Authors: Shipra Srivastava, Rinkle Rani Aggrawal |
10.5120/7361-0136
|
Shipra Srivastava, Rinkle Rani Aggrawal . A Modified Algorithm to Handle Dangling Pages using Hypothetical Node. International Journal of Computer Applications. 48, 7 ( June 2012), 26-32. DOI=10.5120/7361-0136
Abstract
The information on the web is intensifying day by day due to which there is a bulky amount of information available on the web. With this large amount of information available on the web, the process of searching has become a complex task. To overcome this problem there is a necessity of some efficient search engine. With such a search engine information retrieval becomes simple. A PageRank algorithm is used to serve this process. A PageRank algorithm places the most important pages at high ranks depending upon the number of in-links linking to that page. Google search engine developed the Page Rank technique to rank pages and had become the most effective search engine. Page Rank arranges the order of the user's search result based on the relevance of the search of the information In this paper problem of the Dangling pages that is associated with page rank algorithm is been discussed. Dangling pages produce the inaccurate page rank of non-dangling pages. These pages also produce the philosophical issues and computational issue. In previous study for solving the philosophical issue with dangling node a hypothetical node is added to the web graph. But this hypothetical node increases the computation issue because the number of iteration to converge the algorithm is increased. In this paper a' modified algorithm to handle the dangling node with hypothetical node without increasing computational issue which is raise due to addition of hypothetical node is discussed.
References
- Brin, S. , Page, L. , Motwani, R. and Winograd, T. 1999 "The Pagerank Citation Ranking: Bringing order to the Web". Technical Report, Stanford Digital Libraries SIDL-WP-1999-0120.
- Eiron, N. , McCurley, K. and Tomlin. 2004. J. "Ranking the Web Frontier", In the Proceedings of the the 13th international conference on World Wide Web WWW '04, 309-318.
- Norris, J. 1996. "Markov Chains", Cambridge University Press, 1-4.
- Lee, L. 2010. "Page Rank Algorithm and Development".
- Langville, A. N. and Meyer, C. D. 2005. Deeper Inside PageRank. Internet Mathematics, 1(3), 335-380
- Wang, Tao, X. T. , Sun, J. T. , Shakery, A. and Zhai, C. 2008 "DirichletRank: Solving the Zero-One-Gap Problem of PageRank". In ACM Transactions on Information Systems (TOIS), 26(2), 1-29.
- Singh, A. K. , Kumar, P. R. and Leng, A. G. K. 2010 "Efficient Algorithm for Handling Dangling Pages Using Hypothetical Node". In the proceedings of 6th International Conference on Digital Content, Multimedia Technology and its Applications (IDC), 44 – 49.
- Chakrabarti, S. , Dom, B. , Gibson, D. , Kleinberg, J. M. , Raghavan, P. and Rajagopalan,. S. 1998 "Automatic resource compilation by analyzing hyperlink structure and association test", In Proceedings Of The Seventh International World Wide Web Conference, 65-74,
- Langville, A. N. and Meyer, C. D. 2005 "A survey of eigenvector methods of web information retrieval", In SIAM Review, 47(1), 135-161.
- Langville, A. N. and Meyer, C. D. 2006 "A Reordering for the PageRank problem". In SIAM Journal on Scientific Computing, 27(6), 2112–2120.
- Brin, S. , Motwani, R. , Page, L. and Winograd, T. 1998 What can you do with a web in your pocket?. Bulletin of the Technical Committee on Data Engineering, 21(2), 37–47.
- Lee, C. P. , Golub, G. H. and Zenios,S. A. 2003. Partial state space aggregation based on lump ability and its application to pagerank. Technical report, Stanford University.
Index Terms
Keywords