Genetic and Evolutionary Computing pp 343-351 | Cite as
A New Look into Web Page Ranking Systems
Abstract
This paper proposes a new way of looking into Web page ranking systems by using some concepts of queuing theory in operations research and stochastic water storage theory in hydrology. Since both theories queuing and stochastic water storage are rich in technology as well as application aspects, the new look in this paper may lead to new directions in Web page ranking systems and related research areas. In doing so, first this paper draws some analogies between a Web page ranking system and theory of queues. Then it shows how a Web page ranking system can be tackled to reduce current obstacles by using queuing theory techniques. In the second, a Web page ranking system is modeled as a framework of stochastic water storage theory to derive a list of Web page rankings. Third and finally, the outcome results of rankings obtained by using the proposed two theories queuing theory and stochastic water storage are compared and analyzed analytically as well as experimentally. The experimental results show the proposed new look is promising for establishing a new research area which can improve the current situations and difficulties occurred in search engines and their ranking systems in particular and some problems in World Wide Web as a whole.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Brin, S., Page, L.: The anatomy of a large-scale Hyper-textual Web Search Engine. Computer Networks 30(1-7), 107–117 (1998)Google Scholar
- 2.Kleinberg, M.: Authoritative Sources in Hyperlinked Environment. In: 9th Annual ACM-SIAM Symposium onDiscrete Algorithms, pp. 667–668 (1998)Google Scholar
- 3.Desikan, P., Pathak, N., Srivastava, J.: Incremental Page Rank Computation on Evolving Graphs (2005), http://www-users.cs.umn.edu
- 4.O’Madadhain, J., Smyth, P.: EventRank: A framework for ranking time-varyingnetworks. In: LinkKDD, pp. 9–16. ACM (2005) (Cited on pages 10 and 16)Google Scholar
- 5.David, F., Ryan, G., Rossi, A.: A Dynamical System for PageRank with Time-Dependent Teleportation. Purdue University (November 20, 2012)Google Scholar
- 6.Eiron, N., McCurley, K., Tomlin, J.: Ranking the Web Frontier. In: Proc. 13th Conference on World Wide Web, pp. 309–318. ACM Press (2004)Google Scholar
- 7.Richardson, M., Domingos, P.: The intelligent surfer: Probabilistic combination of link and content information in pagerank. In: Advances in Neural Information Processing Systems (2002)Google Scholar
- 8.Haveliwala, T.: Topic-Sensitive PageRank. In: Proceedings of the Eleventh International World Wide Web Conference (May 2002)Google Scholar
- 9.Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank Citation Ranking: Bringing Order to the Web. Bringing Order to the Web. Technical Report. Stanford Digital Library Technologies (January 1996), http://www-diglib.stanford.edu/diglib/pub/
- 10.Ding, C., Zha, H., He, X., Husbands, P., Simon, H.D.: Link Analysis: Hubs and Authorities on the World Wide Web (May 2001) LBNL Tech Report 47847 (1998)Google Scholar
- 11.Tin, P., Zin, T.T., Toriu, T., Hama, H.: A Cluster Based Ranking Framework for Multi-Typed Information Networks. In: Accepted in IIh-MSP 2014, Kita Kyusyu, August 27-29 (2014)Google Scholar
- 12.Zin, T.T., Tin, P., Toriu, T., Hama, H.: A Stochastic Model for Measuring Popularity and Reliability in Social Network Systems. In: SMC 2013, pp. 462–467 (2013)Google Scholar
- 13.Tin, P., Zin, T.T., Toriu, T., Hama, H.: An Integrated Framework for Disaster Event Analysis in Big Data Environments. In: IIH-MSP 2013, pp. 255–258 (2013)Google Scholar
- 14.Hama, H., Zin, T.T., Tin, P.: A Hybrid Ranking of Link and Popularity for Novel Search Engine. International Journal of Innovative Computing, Information and Control: Special Issue on Multimedia Processing and Network Technologies 5(11(B)), 4041–4049 (2009)Google Scholar
- 15.Moran, P.A.P.: A probability theory of dams with a continuous release. Quart. J. of Math. 7, 130–137 (1956)CrossRefMATHGoogle Scholar
- 16.Gani, J.: Problems in the probability theory of storage systems. J. Roy. Statist. Soc. B 14, 181–207 (1957)MathSciNetGoogle Scholar
- 17.Tin, P., Phatarfod, R.M.: On Infinite Dams with Inputs Forming A Stationary Process. J. Appl. Prob. 11, 553–561 (1974)MathSciNetCrossRefMATHGoogle Scholar
- 18.Pennock, D.M., Flake, G.W., Lawrence, S., Glover, E.J., Giles, C.L.: Winners don’t take all: Characterizing the competition for links on the Web. Proceedings of the National Academy of Sciences 99(8), 5207 (2002)CrossRefMATHGoogle Scholar
- 19.Kraaij, W., Westerveld, T., Hiemstra, D.: The importance of prior probabilities for entry page search. In: SIGIR 2002: Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 27–34. ACM, New York (2002)Google Scholar
- 20.Finch, P.D., Pearce, C.: A second look art a queueing system with moving average input process. J. Aust. Math. Sot. 5, 100–106 (1965)MathSciNetCrossRefMATHGoogle Scholar
- 21.Tin, P.: Some Problems on Dams and Queues with Correlated Inputs. Dissertation, Monash University (1976)Google Scholar
- 22.Pakes, A.G., Phatarfod, R.M.: The Limiting Distribution for Infinitely Deep Dam with A Makovian Input. Stochastic Processes and Their Applications, 199–209 (1978)Google Scholar