Abstract
The divisive clustering has the advantage to build a hierarchical structure that is more efficient to represent documents in search engines. Its operation employs one of the partition clustering algorithms that leads to being trapped in a local optima. This paper proposes a Firefly algorithm that is based on Newton’s law of universal gravitation, known as Gravitation Firefly Algorithm (GFA), for document clustering. GFA is used to find centers of clusters based on objective function that maximizes the force between each document and an initial center. Upon identification of a center, the algorithm then locates documents that are similar to the center using cosine similarity function. The process of finding centers for new clusters continues by sorting the light intensity values of the balance documents. Experimental results on Reuters datasets showed that the proposed Newton inspired Firefly algorithm is suitable to be used for document clustering in text mining.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Das, S., Abraham, A., Konar, A.: Metaheuristic Clustering. Studies in Computational Intelligence, vol. 178. Springer, Heidelberg (2009)
Senthilnath, J., Omkar, S.N., Mani, V.: Clustering Using Firefly Algorithm: Performance Study. Elsevier, Swarm and Evolutionary Computation 1(3), 164–171 (2011)
Wilson, H., Boots, B., Millward, A.A.: A Comparison of Hierarchical and PartitionalClustering. Techniques for Multispectral Image Classification 3, 1624–1626 (2002)
Poomagal, S., Hamsapriya, T.: Optimized K-means Clustering with Intelligent Initial Centroids selection for web search using URL and Tag contents. In: Proceedings of the International Conference on Web Intelligence, Mining and Semantics. ACM (2011)
Mishra, B.K., Nayak, N.R., Rath, A., Swain, S.: Far Efficient K-means Clustering Algorithm. In: Proceedings of the International Conference on Advances in Computing, Communications and Informatics, pp. 106–110. ACM (2012)
Hu, G., Zhou, S., Guan, J., Hu, X.: Towards Effective Document Clustering: A Constrained K-means Based Approach. Information Processing and Management 44(4), 1397–1409 (2008)
Hassanzadeh, T., Meybodi, M.R.: A New Hybrid Approach for Data Clustering Using FireflyAlgorithm and K-means. In: Proceedings of the 16th IEEECSI International Symposium on Artificial Intelligence and Signal Processing (AISP), pp. 007–011 (2012)
Tang, R., Fong, S., Yang, X.S., Deb, S.: Integrating Nature-Inspired Optimization Algorithms to K-means Clustering. In: Proceedings of the 7th InternationalConference on Digital Information Management (ICDIM), pp. 116–123. IEEE, Macau (2012)
Hatamlou, A., Abdullah, S., Nezamabdi-pour, H.: A Combined Approach for Clustering Based on K-means and Gravitational Search Algorithms. Elsevier, Swarm and Evolutionary Computation 6, 47–52 (2012)
Forsati, R., Mahdavi, M., Shamsfar, M., Meybodi, M.R.: Efficient stochastic algorithms for document clustering. Elsevier, Information Sciences 220, 269–29 (2013)
Yang, X.S.: Nature-Inspired MetaheuristicAlgorithms. Luniver Press, United Kingdom (2011)
Lewis, D.: The reuters-21578 text categorization test collection (1999), http://kdd.ics.uci.edu/database/reuters21578/reuters21578.html
Murugesan, K., Zhang, J.: Hybrid Bisect K-means Clustering Algorithm. In: Proceedings of the IEEEInternational Conference on Business Computing and Global Information, pp. 216–219. IEEE, Shanghai (2011)
Michael, S., George, K., Vipin, K.: A Comparison of Document Clustering Techniques. In: Proceedings of the KDD Workshop on Text Mining (2000)
Manning, C.D., Raghavan, P., Schütze, H.: Introduction to Information Retrieval, 1st edn. Cambridge University Press (2008)
Mohammed, A.J., Yusof, Y., Husni, H.: Weight-Based Firefly Algorithm for Document Clustering. In: Proceedings of the First International Conference on Advanced Data Engineering (DaEng 2013) (2013) (accepted for publication)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mohammed, A.J., Yusof, Y., Husni, H. (2014). A Newton’s Universal Gravitation Inspired Firefly Algorithm for Document Clustering. In: Jeong, H., S. Obaidat, M., Yen, N., Park, J. (eds) Advances in Computer Science and its Applications. Lecture Notes in Electrical Engineering, vol 279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41674-3_174
Download citation
DOI: https://doi.org/10.1007/978-3-642-41674-3_174
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41673-6
Online ISBN: 978-3-642-41674-3
eBook Packages: EngineeringEngineering (R0)