Abstract
Clustering in high-dimensional data space is a difficult task due to the interference from different dimensions. A dimension may be relevant for some clusters and irrelevant for other data. Subspace clustering aims at finding local cluster structures in certain related subspace. We propose a novel approach to finding subspace clusters based on the trained Self-Organizing Map neural network (SOM). The proposed method takes advantage of nonlinear mapping of SOM and search for subspace clusters on input neurons instead of the whole data space. Experiment results show that the proposed method performs better compared with original SOM and some traditional subspace clustering algorithms.
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
References
M. Köppen, The curse of dimensionality, in Fifth Online World Conference on Soft Computing in Industrial Applications (2000)
S. Tabakhi, P. Moradi, Relevance–redundancy feature selection based on ant colony optimization. Pattern Recogn. 48(9), 2798–2811 (2015)
R. Agrawal, J.E. Gehrke, D. Gunopulos, P. Raghavan, Automatic subspace clustering of high dimensional data for data mining applications, in Proceedings of the 1998 ACM SIGMOD (Seattle, WA, USA), pp. 94–105
H.F. Bassani, A.F.R. Araujo, Dimension selective self-organizing maps with time-varying structure for subspace and projected clustering. IEEE Trans. Neural Netw. Learn. Syst. 26(3), 458–471 (2015)
E. Ller, S. Nnemann, I. Assent, T. Seidl, Evaluating clustering in subspace projections of high dimensional data. Proc. VLDB Endow. 2(1), 1270–1281 (2009)
C.M. Procopiuc, M. Jones, P.K. Agarwal, T.M. Murali, A Monte Carlo algorithm for fast projective clustering, in Proceedings of the 2002 ACM SIGMOD (Madison, WI, USA), pp. 418–427
H.P. Kriegel, P. Kröger, M. Renz, S. Wurst, A generic framework for efficient subspace clustering of high-dimensional data, in Fifth IEEE International Conference on Data Mining (Houston, TX, USA, 2005)
C.C. Aggarwal, J.L. Wolf, P.S. Yu, C. Procopiuc, J.S. Park, Fast algorithms for projected clustering, in Proceedings of the 1999 ACM SIGMOD (Philadelphia, PA, USA), pp. 61–72
A.Y. Yang, J. Wright, Y. Ma, S.S. Sastry, Unsupervised segmentation of natural images via lossy data compression. Comput. Vis. Image Underst. 110(2), 212–225 (2008)
D. Jiang, C. Tang, A. Zhang, Cluster analysis for gene expression data: a survey. IEEE Trans. Knowl. Data Eng. 16(11), 1370–1386 (2004)
P.B. Chou, E. Grossman, D. Gunopulos, P. Kamesam, Identifying prospective customers, in Proceedings of the 2000 ACM SIGKDD (Boston, MA, USA), pp. 447–456
T. Kohonen, Essentials of the self-organizing map. Neural Netw. 37(1), 52–65 (2013)
T. Kohonen, Self-organized formation of topologically correct feature maps. Biol. Cybern. 43(1), 59–69 (1982)
E. Müller, I. Assent, S. Günnemann, T. Seidl, OpenSubspace: an open source framework for evaluation and exploration of subspace clustering algorithms in WEKA, in Proceedings of 1st Open Source in Data Mining Workshop, OSDM’09 (Bangkok, Thailand), pp. 2–13
M. Lichman, UCI Machine Learning Repository, http://archive.ics.uci.edu/ml (University of California, School of Information and Computer Science, Irvine, CA, 2013)
Acknowledgements
The work was supported by the General Program of the National Science Foundation of China (Grant No. 71471127, 71371135).
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 paper
Cite this paper
Tian, J., Gu, M. (2019). Subspace Clustering Based on Self-organizing Map. In: Huang, G., Chien, CF., Dou, R. (eds) Proceeding of the 24th International Conference on Industrial Engineering and Engineering Management 2018. Springer, Singapore. https://doi.org/10.1007/978-981-13-3402-3_17
Download citation
DOI: https://doi.org/10.1007/978-981-13-3402-3_17
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-3401-6
Online ISBN: 978-981-13-3402-3
eBook Packages: Business and ManagementBusiness and Management (R0)