Abstract
The World Wide Web provides an ample amount of information to the users, however, this leads to difficulty in the identification of relevant content. Web mining could be considered as a cure to this problem. It includes the application of machine learning and data mining techniques, which helps in the automatic extraction of meaningful patterns and relationships from a huge cluster of web data. Web mining is categorized into three areas: (i) web content mining, digging out knowledge from the content (i.e., text and graphics) of web pages, (ii) web structure mining, which extracts information from data describing the organization of web content, and (iii) web usage mining, in which we gather patterns by looking at the interactions of the users with the web. There is no sharply defined variation among these categories, and all the three mining tasks can be combined. So our paper focus on the very different type of technique for searching the web content, where we perform mining of the web content efficiently and give the fruitful results for the users. We planned to apply the support vector machine technique and the Particle Swarm Optimization (PSO) algorithm for searching the web content and giving the efficient and best results.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Edelman, A., Wen, T., & Gorsich, D. (2002). Fast projected conjugate gradient support vector machine training algorithms. Technical Report, NAMSA.
Fagni, T., Perego, R., Silvestri, F., & Orlando, S. (2006). Boosting the performance of web search Engines: Caching and pre-fetching query results by exploiting historical usage data. ACM Transactions on Information Systems, 24(1), 51–78.
Ramasubramanian, C., & Ramya, R. (2013). Effective pre-processing activities in text mining using improved Porter’s stemming algorithm. International Journal of Advanced Research in Computer and Communication Engineering, 2(12).
Porter, M. F. (1980). An algorithm for suffix stripping. Program, 14, 130–137.
Porter, M. F. (2001). Snowball: A language for stemming algorithms. (Al-Shammari, E. T. (2008). Towards an error-free stemming. In Proceedings of ADIS European Conference Data Mining 2008 (pp. 160–163).)
Guduru, N. (2006). Text mining with support vector machines and non-negative matrix factorization algorithms. Dissertation, University of Rhode Island.
Al-Shammari, E. T. (2008). Towards an error-free stemming. In Proceedings of ADIS European Conference Data Mining 2008 (pp. 160–163).
Mayor, S., & Pant, B. (2012). Document classification using support vector machine. International Journal of Engineering Science and Technology (IJEST), 4, April 04, 2012.
Khan, A., & Niemann-Delius, C. (2015). Application of particle swarm optimization to the open pit mine scheduling problem. In Proceedings of the 12th International Symposium Continuous Surface Mining-Aachen 2014. Springer International Publishing.
Mele, I. (2013). Web usage mining for enhancing search-result delivery and helping users to find interesting web content. ACM, WSDM’13 (pp. 765–769). Rome, Italy, February 2013.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Kaushik, N., Bhatia, M.K. (2020). Information Retrieval from Search Engine Using Particle Swarm Optimization. In: Sharma, H., Govindan, K., Poonia, R., Kumar, S., El-Medany, W. (eds) Advances in Computing and Intelligent Systems. Algorithms for Intelligent Systems. Springer, Singapore. https://doi.org/10.1007/978-981-15-0222-4_11
Download citation
DOI: https://doi.org/10.1007/978-981-15-0222-4_11
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-0221-7
Online ISBN: 978-981-15-0222-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)