Abstract
This paper introduces a new approach for clustering large datasets based on spectral clustering and topological unsupervised learning. Spectral clustering method needs to construct an adjacency matrix and calculate the eigen-decomposition of the corresponding Laplacian matrix [4] which are computational expensive and is not easy to apply on large-scale data sets. Contrarily, the topological learning (i.e. SOM method) allows a projection of the dataset in low dimensional spaces that make it easy to use for very large datasets. The prototypes matrix weighted by the neighbourhood function will be used in this work to reduce the computational time of the clustering algorithm and to add the topological information to the final clustering result. We illustrate the power of this method with several real datasets. The results show a good quality of clustering results and a higher speed.
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
Andreopoulos, B., An, A., Wang, X.: Bi-level clustering of mixed categorical and numerical biomedical data. Int. J. Data Min. Bioinform. 1(1), 19–56 (2006)
Asuncion, A., Newman, D.: UCI Machine Learning Repository (2007). http://www.ics.uci.edu/~mlearn/MLRepository.html
Chan, P.K., Schlag, M.D.F., Zien, J.Y.: Spectral K-way ratio-cut partitioning and clustering. IEEE Trans. Comput. Aaided Des. Integr. Circ.Syst. 13(9), 1088–1096 (1994). http://ieeexplore.ieee.org/xpl/abs_free.jsp?arNumber=310898
Chung, F.R.K.: Spectral Graph Theory. American Mathematical Society, Providence (1997)
Ding, C.H.Q., He, X., Zha, H., Gu, M., Simon, H.: A min-max cut algorithm for graph partitioning and data clustering (2001)
Hagen, L., Member, S., Kahng, A.B.: New spectral methods for ratio cut partition and clustering. IEEE Trans. Comput. Aided Des., 1074–1085 (1992)
Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Comput. Surv. 31(3), 264–323 (1999)
Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice-Hall Inc., Upper Saddle River (1988)
Jordan, M.I., Bach, F.R., Bach, F.R.: Learning spectral clustering. In: Advances in Neural Information Processing Systems 16. MIT Press (2003)
Khan, S.S., Kant, S.: Computation of initial modes for k-modes clustering algorithm using evidence accumulation. In: IJCAI, pp. 2784–2789 (2007)
Kohonen, T.: Self-Organizing Maps. Springer, Berlin (1995)
Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustering: analysis and an algorithm. In: Advances in Neural Information Processing Systems, pp. 849–856. MIT Press (2001)
Rand, W.: Objective criteria for the evaluation of clustering methods. J. Am. Stat. Assoc. 66, 846–850 (1971)
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888–905 (2000). http://dx.doi.org/10.1109/34.868688
Kohonen, T.: Self-Organizing Maps. Springer, Berlin (2001)
Wang, Q., Ye, Y., Huang, J.Z.: Fuzzy K-means with variable weighting in high dimensional data analysis. In: International Conference on Web-Age Information Management, pp. 365–372 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Rogovschi, N., Grozavu, N., Labiod, L. (2015). Spectral Clustering Trough Topological Learning for Large Datasets. In: Arik, S., Huang, T., Lai, W., Liu, Q. (eds) Neural Information Processing. ICONIP 2015. Lecture Notes in Computer Science(), vol 9490. Springer, Cham. https://doi.org/10.1007/978-3-319-26535-3_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-26535-3_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26534-6
Online ISBN: 978-3-319-26535-3
eBook Packages: Computer ScienceComputer Science (R0)