Abstract
Spectral clustering is one of the machine learning techniques based on graph theory. It requires finding eigen values and eigen vector of large matrices consuming much time and space. Often, finding an optimal eigen value is sufficient to cluster data. Power Iteration Clustering algorithm (PIC) replaces the eigen values with pseudo eigen vector. Though PIC is fast and scalable it causes inter collision problem when dealing with larger datasets. Accuracy is also a concern. To solve the optimal Eigen value problem, in this paper we proposes an Inflated Power Iteration Clustering algorithm. It uses the modified lagrangian constraint which induces an exponential inflationary growth by increasing the rate of convergence of eigen vector to get an ideal optimal solution. This algorithm is validated by experimenting on various real and synthetic dataset of varying size. On validation it has been found that the performance of the algorithm has been improved in terms of speed up and efficiency. The speed up has been improved by 31 % when compared to PIC and almost 40−42 % with K-means algorithm. The accuracy has been improved by 7 % than k means and 4 % than PIC. The proposed algorithm is highly scalable and can be used for clustering Big Data.
This is a preview of subscription content, log in via an institution.
References
Shah, G.H., Bhensdadia, C.K., Ganatra, A.P.: An empirical evaluation of density based clustering techniques. Int. J. Soft Comput. Eng. (IJSCE) 2(1) (2012). ISSN: 2231-2307
Rokach, L., Maimon, O.: Clustering methods. In: Data Mining and Knowledge Discovery Handbook. Springer (2005). ISBN: 978-0-387-09822-7. e-ISBN: 978-0-387-09823-4. doi:10.1007/978-0-387-09823-4
Lin, F., William, W.: Power iteration clustering. In: International Conference on Machine Learning, Haifa, Israel (2010)
Heller, E.J., Kaplan, L., Polimann, F.: Inflationary dynamics for matrix eigen value problems. In: PNAS, vol. 105, no. 22, 7631−7635, June 2008. doi:10.1073/pnas.0801047105
Jia, H., Ding, H., Xu, X., Nie, R.: The latest research progress on spectral clustering. Neural Comput. Appl. 24, 1477−1486 (2014). ISSN: 0941-0643. doi:10.1007/s0052-013-1439-2
Yana, W., et al.: p-PIC: parallel power iteration clustering for big data. Models and algorithms for high performance distributed data mining. J. Parallel Distrib. Comput. 73(3) (2013)
The, A.P., Thang, N.D., Vinh, L.T., Lee, Y.-K., Lee, S.: Deflation based power iteration clustering. Appl. Intell. 39, 367−385 (2013). doi:10.1007/s10486-012-0418-0
http://www.cs.cornell.edu/~bindel/class/cs6210-f09/lec26.pdf
http://www.cs.rpi.edu/~zaki/www-new/uploads/Dmcourse/Main/Lecture18.pdf
http://www.seas.gwu.edu/~bell/csci243/lectures/performance.pdf
Chen, W.Y., Song, Y., Bai, H., Lin. C.: Parallel spectral clustering in distributed systems. IEEE Trans. Patt. Anal. Mach. Intell. 33(3), 568–586 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Dhanapal, J., Perumal, T. (2016). Inflated Power Iteration Clustering Algorithm to Optimize Convergence Using Lagrangian Constraint. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Silhavy, P., Prokopova, Z. (eds) Software Engineering Perspectives and Application in Intelligent Systems. ICTIS CSOC 2017 2016. Advances in Intelligent Systems and Computing, vol 465. Springer, Cham. https://doi.org/10.1007/978-3-319-33622-0_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-33622-0_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-33620-6
Online ISBN: 978-3-319-33622-0
eBook Packages: EngineeringEngineering (R0)