Abstract
Search Engines follow a set of rules, known as an algorithm, to rank Web-pages. Exactly how a particular Search Engine’s algorithm works is a trade secret. However, all major Search Engines follow the general rules.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
S. Brin, L. Page, The anatomy of a large-scale hypertextual web search engine, in Proceedings of the Seventh International World Wide Web Conference, Brisbane, Australia, April 1998
A. Arasu, J. Cho, H. Garcia-Molina, A. Paepcke, S. Raghavan, Searching the Web. ACM Trans. Internet Technol. 1(1) (Aug 2001)
D. Mukhopadhyay, D. Giri, S.R. Singh, An approach to confidence based page ranking for user oriented web search. ACMSIGMOD Record 32(2), 28–33 (2003)
D. Mukhopadhyay, P. Biswas, Flexi-rank: an algorithm offering flexibility and accuracy for ranking the web pages, in Proceedings of the International Conference on Distributed Computing and Internet Technology, India. Lecture Notes in Computer Science Series, Springer-Verlag, 22–24 Dec, pp. 308–313
D. Mukhopadhyay, D. Giri, S. R. Singh, A confidence based methodology to deduce user oriented page ranking in searching the web, in Proceedings of the International Conference ITPC 2003, Nepal, 23–26 May 2003
P. P. Chaudhuri, D. R. Chowdhury, S. Nandi, S. Chatterjee, in Additive Cellular Automata, Theory and Applications, vol 1 (IEEE Computer Society Press, Los Alamitos, California, 1997) vol. ISBN-0-8186-7717-1
P. Maji, C. Shaw, N. Ganguly, B.K. Sikdar, P.P. Chaudhuri, Theory and application of cellular automata for pattern classification. Fundamenta Informaticae 58, 321–354 (2003)
S. Das, A. Kundu, S. Sen, B. K. Sikdar, and P. P. Chaudhuri, Non-linear celluar automata based PRPG design (Without prohibited pattern set) in linear time complexity, in Asian Test Symposium (2003), pp. 78–83
S. Das, A. Kundu, B. K. Sikdar, Nonlinear CA based design of test set generator targeting pseudo-random pattern resistant faults, in Asian Test Symposium (2004), pp. 196–201
S. Chattopadhyay, S. Adhikari, S. Sengupta, M. Pal, Highly regular, modular, and cascadable design of cellular automata-based pattern classifier. IEEE Trans. VLSI Syst. 8(6) (Dec 2000)
P. Sarkar, A brief history of cellular automata. ACM Comput. Syst. 32, 80–107 (2000)
S. Wolfram, Statistical mechanics of cellular automata. Rev. Mod. Phys. 55(3), 601–644 (1983)
K. Paul, Theory and application of GF (2P) cellular automata, Ph.D. thesis, Bengal Engineering College (Deemed University), Howrah, India, 2001
B. Sikdar, Theory and applications of hierarchical cellular automata for VLSI circuit testing, Ph.D. thesis, Bengal Engineering College (Deemed University), Howrah, India, 2002
A. Kundu, R. Dutta, D. Mukhopadhyay, An alternate way to rank hyper-linked web pages, in 9th International Conference on Information Technology ICIT 2006 Proceedings, Bhubaneswar, India, IEEE Computer Society Press, New York, USA, 18–21 Dec 2006
N. Ganguly, Cellular automata evolution: theory and applications in pattern recognition and classification, Ph.D. Thesis, CST Dept, BECDU, India, 2003
A. Kundu, R. Dutta, D. Mukhopadhyay, Generation of SMACA and its application in web services, in 9th International Conference on Parallel Computing Technologies, PaCT 2007 Proceedings, Pereslavl-Zalessky, Russia. Lecture Notes in Computer Science, Springer-Verlag, Germany, 3–7 Sept 2007
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Mukhopadhyay, D., Kundu, A. (2019). Cellular Automata in Web-Page Ranking. In: Mukhopadhyay, D. (eds) Web Searching and Mining. Cognitive Intelligence and Robotics. Springer, Singapore. https://doi.org/10.1007/978-981-13-3053-7_5
Download citation
DOI: https://doi.org/10.1007/978-981-13-3053-7_5
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-3052-0
Online ISBN: 978-981-13-3053-7
eBook Packages: Computer ScienceComputer Science (R0)