Dimension selective self-organizing maps with time-varying structure for subspace and projected clustering

IEEE Transactions on Neural Networks and Learning Systems

Volumn 26, Issue 3, 2015, Pages 458-471

  Bassani, Hansenclever F ^a   Araujo, Aluizio F R ^a  

^a FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

Author keywords

High dimensional data; local receptive field; relevance learning; self organizing maps (SOMs); subspace clustering.

Indexed keywords

CONFORMAL MAPPING; SELF ORGANIZING MAPS;

HIGH DIMENSIONAL DATA; RECEPTIVE FIELDS; RELEVANCE LEARNING; SELF ORGANIZING MAPS(SOMS); SUB-SPACE CLUSTERING;

CLUSTERING ALGORITHMS;

EID: 85027943614     PISSN: 2162237X     EISSN: 21622388     Source Type: Journal    
DOI: 10.1109/TNNLS.2014.2315571     Document Type: Article

References (33)

1. A. Sharma and R. Dhir, "A Wordsets based document clustering algorithm for large datasets," in Proc. Int. Conf. Methods Models Comput. Sci., 2009, pp. 1-7.
2. E. M. Smith, J. Littrell, and M. Olivier, "Automated SNP genotype clustering algorithm to improve data completeness in high-throughput SNP genotyping datasets from custom arrays," Genomics Proteomics Bioinf., vol. 5, nos. 3-4, pp. 256-259, Dec. 2007.
3. L. Parsons, E. Haque, and H. Liu, "Subspace clustering for high dimensional data: A review," ACM SIGKDD Explorations Newslett., vol. 6, no. 1, pp. 90-105, 2004.
4. H.-P. Kriegel, P. Kröger, and A. Zimek, "Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering," ACM Trans. Knowl. Discovery Data, vol. 3, no. 1, pp. 1-58, Mar. 2009.
5. R. Vidal, "Subspace clustering," IEEE Trans. Signal Process. Magn., vol. 28, no. 2, pp. 52-68, Mar. 2011.
6. H. F. Bassani and A. F. R. Araujo, "Dimension selective self-organizing maps for clustering high dimensional data," in Proc. IEEE Int. Joint Conf. Neural Netw., Brisbane, CA, USA, Aug. 2012, pp. 1-8.
7. M. Köppen, "The curse of dimensionality," in Proc. 5th Online World Conf. Soft. Comput. Ind. Appl., 2000, pp. 4-8.
8. E. Müller, S. Günnemann, I. Assent, and T. Seidl, "Evaluating clustering in subspace projections of high dimensional data," in Proc. 35th Int. Conf. Very Large Data Bases, Lyon, France, 2009.
9. M. Coelho, E. Valle, C. S. Junior, and A. Araujo, "Subspace clustering for information retrieval in urban scene databases," in Proc. SIBGRAPI Conf. Graph., Patterns Images, 2011, pp. 173-180.
10. P. B. Chou, E. Grossman, D. Gunopulos, and P. Kamesam, "Identifying prospective customers," in Proc. ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, New York, NY, USA, 2000, pp. 447-456.
11. D. Jiang, C. Tang, and A. Zhang, "Cluster analysis for gene expression data: A survey," IEEE Trans. Knowl. Data Eng., vol. 16, no. 11, pp. 1370-1386, Nov. 2004.
12. K. S. H. Sim, "Enhanced subspace clustering," Ph.D. dissertation, Dept. Electr. Electron. Eng., Nanyang Technol. Univ., Singapore, 2012.
13. G. A. Carpenter and S. Grossberg, "Art 2: Self-organization of stable category recognition codes for analog input patterns," Appl. Opt., vol. 26, no. 23, pp. 4919-4930, Dec. 1987.
14. Y. Cao and J. Wu, "Projective art for clustering data sets in high dimensional spaces," Neural Netw., vol. 15, no. 1, pp. 105-120, 2002.
15. T. Kohonen, "The self-organizing map," Proc. IEEE, vol. 78, no. 9, pp. 1464-1480, Sep. 1990.
16. J. A. Kangas, T. K. Kohonen, and J. T. Laaksonen, "Variants of selforganizing maps," IEEE Trans. Neural Netw., vol. 1, no. 1, pp. 93-99, Jan. 1990.
17. F. R. B. Araujo, H. F. Bassani, and A. F. R. Araujo, "Learning vector quantization with local adaptive weighting for relevance determination in genome-wide association studies," in Proc. IEEE Int. Joint Conf. Neural Netw., Dallas, TX, USA, Aug. 2013, pp. 1-8.
18. A. F. Araujo and R. L. Rego, "Self-organizing maps with a time varying structure," ACM Comput. Surv., vol. 46, no. 1, pp. 7:1-7:38, Jul. 2013.
19. A. F. R. Araujo and D. C. Costa, "Local adaptive receptive field selforganizing map for image color segmentation," Image Vis. Comput., vol. 27, no. 9, pp. 1229-1239, 2009.
20. C. Aggarwal, J. Wolf, P. Yu, C. Procopiuc, and J. Park, "Fast algorithms for projected clustering," in Proc. ACM SIGMOD Int. Conf. Manage. Data, 1999, pp. 61-72.
21. C. E. A. Procopiuc, "A Monte Carlo algorithm for fast projective clustering," in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2002, pp. 418-427.
22. M. L. Yiu and N. Mamoulis, "Frequent-pattern based iterative projected clustering," in Proc. IEEE Int. Conf. Data Mining, 2004, pp. 689-692.
23. G. Moise and J. Sander, "Finding non-redundant, statistically significant regions in high dimensional data: A novel approach to projected and subspace clustering," in Proc. ACM Int. Conf. Knowl. Discovery Data Mining, 2008, pp. 533-541.
24. G. Moise, A. Zimek, P. Kröger, H.-P. Kriegel, and J. Sander, "Subspace and projected clustering: Experimental evaluation and analysis," Knowl. Inf. Syst., vol. 21, no. 3, pp. 299-326, 2009.
25. R. Vidal, Y. Ma, and S. Sastry, "Generalized principal component analysis (GPCA)," IEEE Trans. Pattern Anal. Mach. Intell., vol. 27, no. 12, pp. 1-15, Dec. 2005.
26. E. Elhamifar and R. Vidal, "Sparse subspace clustering," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., Jun. 2009, pp. 2790-2797.
27. G. Gan, J. Wu, and Z. Yang, "PARTCAT: A subspace clustering algorithm for high dimensional categorical data," in Proc. Int. Joint Conf. Neural Netw., Jul. 2006, pp. 4406-4412.
28. I. Assent, R. Krieger, E. Müller, and T. Seidl, "INSCY: Indexing subspace clusters with in-process-removal of redundancy," in Proc. IEEE Int. Conf. Data Mining, Dec. 2008, pp. 719-724.
29. D. Ruppert, Statistics and Data Analysis for Financial Engineering (Springer Texts in Statistics). Berlin, Germany: Springer-Verlag, 2010.
30. A. Asuncion and D. Newman. (2007). UCI Machine Learning Repository [Online]. Available: http://www.ics.uci.edu/~mlearn/MLRepository.html
31. A. Saltelli, K. Chan, and E. M. Scott, Sensitivity Analysis. New York, NY, USA: Wiley, 2009.
32. J. Helton, F. Davis, and J. Johnson, "A comparison of uncertainty and sensitivity analysis results obtained with random and latin hypercube sampling," Rel. Eng., Syst. Safety, vol. 89, no. 3, pp. 305-330, 2005.
33. A. Patrikainen and M. Meila, "Comparing subspace clusterings," IEEE Trans. Knowl. Data Eng., vol. 18, no. 7, pp. 902-916, Jul. 2006.