Approximate spectral clustering with utilized similarity information using geodesic based hybrid distance measures

Pattern Recognition

Volumn 48, Issue 4, 2015, Pages 1465-1477

  Taşdemir, Kadim ^a   Yalҫin, Berna ^b   Yildirim, Isa ^b  

^a ANTALYA INTERNATIONAL UNIVERSITY   (Turkey)

^b ISTANBUL TECHNICAL UNIVERSITY   (Turkey)

Author keywords

Approximate spectral clustering; Cluster validity indices; Geodesic distances; Hybrid similarity measures; Manifold learning

Indexed keywords

CLUSTERING ALGORITHMS; GEODESY; LARGE DATASET; REMOTE SENSING; TOPOLOGY;

CLUSTER VALIDITY INDICES; GEODESIC DISTANCES; MANIFOLD LEARNING; SIMILARITY MEASURE; SPECTRAL CLUSTERING;

INFORMATION USE;

EID: 84920663980     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2014.10.023     Document Type: Article

References (56)

1. J. Shi, J. Malik, Normalized cuts and image segmentation, IEEE Trans. Pattern Anal. Mach. Intell. 22 (8) (2000) 888-905.
2. A. Ng, M. Jordan, Y. Weiss, On spectral clustering: analysis and an algorithm, in: T. Dietterich, S. Becker, Z. Ghahramani (Eds.), Advances in Neural Information Processing Systems, vol. 14, MIT Press, 2002, pp. 849-856.
3. M. Meila, J. Shi, A random walks view of spectral segmentation, in: 8th International Workshop on Artificial Intelligence and Statistics (AISTATS), 2001.
4. U. von Luxburg, A tutorial on spectral clustering, J. Stat. Comput. 17 (4) (2007) 395-416.
5. M. Filippone, F. Camastra, F. Masulli, S. Rovetta, A survey of kernel and spectral methods for clustering, Pattern Recognit. 41 (1) (2008) 176-190.
6. D. Verma, M. Meila, A Comparison of Spectral Clustering Algorithms, Technical Report UW TR CSE-03-05-01, University of Washington, 2003.
7. R. Kannan, S. Vempala, A. Vetta, On clusterings: good, bad and spectral, J. ACM 51 (3) (2004) 497-515.
8. T. Xiang, S. Gong, Spectral clustering with eigenvector selection, Pattern Recognit. 41 (3) (2008) 1012-1029.
9. K. Ersahin, I.G. Cumming, R.K. Ward, Segmentation and classification of polarimetric SAR data using spectral graph partitioning, IEEE Trans. Geosci. Remote Sens. 48 (1) (2010) 164-174.
10. K. Taşdemir, P. Milenov, B. Tapsall, A hybrid method combining som-based clustering and object-based analysis for identifying land in good agricultural condition, Comput. Electron. Agric. 83 (0) (2012) 92-101, doi: doi:10.1016/j.compag.2012.01.017.
11. W.-Y. Chen, Y. Song, H. Bai, C.-J. Lin, E.Y. Chang, Parallel spectral clustering in distributed systems, IEEE Trans. Pattern Anal. Mach. Intell. 33 (3) (2011) 568-586.
12. C. Fowlkes, S. Belongie, F. Chung, J. Malik, Spectral grouping using the Nyström method, IEEE Trans. Pattern Anal. Mach. Intell. 26 (2) (2004) 214-225.
13. J. Bezdek, R. Hathaway, J. Huband, C. Leckie, R. Kotagiri, Approximate clustering in very large relational data, Int. J. Intell. Syst. 21 (8) (2006) 817-841.
14. L. Wang, J. Bezdek, C. Leckie, R. Kotagiri, Selective sampling for approximate clustering of very large datasets, Int. J. Intell. Syst. 23 (3) (2008) 313-331.
15. L. Wang, C. Leckie, K. Ramamohanarao, J.C. Bezdek, Approximate spectral clustering, in: T. Theeramunkong, B. Kijsirikul, N. Cercone, T.B. Ho (Eds.), PAKDD, Lecture Notes in Computer Science, vol. 5476, Springer, Berlin, Heidelberg, 2009, pp. 134-146.
16. D. Yan, L. Huang, M.I. Jordan, Fast approximate spectral clustering, in: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD'09, 2009, pp. 907-916.
17. L. Wang, C. Leckie, R. Kotagiri, J. Bezdek, Approximate pairwise clustering for large data sets via sampling plus extension, Pattern Recognit. 44 (2) (2011) 222-235.
18. K. Taşdemir, Vector quantization based approximate spectral clustering of large datasets, Pattern Recognit. 45 (8) (2012) 3034-3044.
19. M.-A. Belabbas, P.J. Wolfe, Spectral methods in machine learning and new strategies for very large datasets, Proc. Natl. Acad. Sci. (PNAS) 106 (2) (2009) 369-374.
20. T. Kohonen, Self-Organizing Maps, 2nd ed., Springer-Verlag, Berlin, Heidelberg, 1997.
21. T. Martinetz, S. Berkovich, K. Schulten, Neural gas network for vector quantization and its application to time series prediction, IEEE Trans. Neural Netw. 4 (4) (1993) 558-569.
22. D. Arthur, S. Vassilvitskii, k-means + + : the advantages of careful seeding, in: SODA'07: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, Louisiana, 7-9 January, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2007, pp. 1027-1035.
23. K. Taşdemir, E. Merényi, Exploiting data topology in visualization and clustering of self-organizing maps, IEEE Trans. Neural Netw. 20 (4) (2009) 549-562.
24. A. Asuncion, D. Newman, UCI Machine Learning Repository, 2007. URL: 〈http://www.ics.uci.edu/~mlearn/MLRepository.html〉.
25. T. Villmann, E. Merényi, B. Hammer, Neural maps in remote sensing image analysis, Neural Netw. (Special Issue on Self-Organizing Maps for Analysis of Complex Scientific Data) 3-4 (16) (2003) 389-403.
26. E. Merényi, B. Csathó, K. Taşdemir, Knowledge discovery in urban environments from fused multi-dimensional imagery, in: P. Gamba, M. Crawford (Eds.), Proceedings of the 4th IEEE GRSS/ISPRS Joint Workshop on Remote Sensing and Data Fusion over Urban Areas (URBAN 2007), Paris, France, 11-13 April 2007, IEEE Catalog number 07EX1577, 2007.
27. S. Guha, R. Rastogi, K. Shim, Cure: An ef ficient clustering algorithm for large databases, in: In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'96), 1996.
28. T. Martinetz, K. Schulten, Topology representing networks, Neural Netw. 7 (3) (1993) 507-522.
29. T.W. Cheng, D.B. Goldgof, L.O. Hall, Fast fuzzy clustering, Fuzzy Sets Sys. 93 (1998) 49-56.
30. D. Pavlov, D. Chudova, P. Smyth, Towards scalable support vector machines using squashing, in: Proceedings of the ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining, 2000, pp. 295-299.
31. F.J. Provost, D. Jensen, T. Oates, Efficient progressive sampling, in: Knowledge Discovery and Data Mining, 1999, pp. 23-32.
32. R.J. Hathaway, J.C. Bezdek, J.M. Huband, Scalable visual assessment of cluster tendency for large data sets, Pattern Recognit. 39 (7) (2006) 1315-1324.
33. L. Zelnik-Manor, P. Perona, Self-tuning spectral clustering, in: Advances in Neural Information Processing Systems, 2004.
34. X. Zhang, J. Li, H. Yu, Local density adaptive similarity measurement for spectral clustering, Pattern Recognit. Lett. 32 (2) (2011) 352-358.
35. K. Taşdemir, A hybrid similarity measure for approximate spectral clustering of remote sensing images, in: 2013 IEEE International Geoscience and Remote Sensing Symposium (IGARSS), 2013, pp. 3136-3139. doi: http://dx.doi.org/10.1109/IGARSS.2013.6723491.
36. E. Merényi, K. Taşdemir, L. Zhang, Learning highly structured manifolds: harnessing the power of SOMs, in: M. Biehl, B. Hammer, M. Verleysen, T. Villmann (Eds.), Similarity Based Clustering, Lecture Notes in Artificial Intelligence, vol. 5400, Springer, Berlin, Heidelberg, 2009, pp. 138-168.
37. A. Ultsch, Maps for the visualization of high-dimensional data spaces, in: Workshop on Self-Organizing Maps (WSOM), 2003, pp. 225-230.
38. G.A. Carpenter, S. Martens, O.J. Ogas, Self-organizing information fusion and hierarchical knowledge discovery: a new framework using ARTMAP neural networks, Neural Netw. 18 (3) (2005) 287-295.
39. L. Hubert, P. Arabie, Comparing partitions, J. Classif. (1985) 193-218.
40. J. Santos, M. Embrechts, On the use of the adjusted rand index as a metric for evaluating supervised classification, in: International Conference on Artificial Neural Networks-ICANN (2009), Limassol, Cyprus, 14-17 September 2009, pp. 175-184.
41. W.M. Rand, Objective criteria for the evaluation of clustering methods, J. Am. Stat. Assoc. 66 (1971) 846-850.
42. J.C. Bezdek, N.R. Pal, Some new indexes of cluster validity, IEEE Trans. Syst. Man Cybern. Part B 28 (3) (1998) 301-315.
43. K. Taşdemir, E. Merényi, A validity index for prototype-based clustering of data sets with complex cluster structures, IEEE Trans. Syst. Man Cybern. Part B 41 (4) (2011) 1039-1053.
44. L. Kaufman, P. Rousseauw, Finding Groups in Data, John Wiley & Sons, Inc., Hoboken, New Jersey, 1990.
45. T. Calinski, J. Harabasz, A dendrite method for cluster analysis, Commun. Stat. 3 (1) (1974) 1-27.
46. M.K. Pakhira, S. Bandyopadhyay, U. Maulik, Validity index for crisp and fuzzy clusters, Pattern Recognit. 37 (2004) 487-501.
47. D.L. Davies, D.W. Bouldin, A cluster separation measure, IEEE Trans. Pattern Anal. Mach. Intell. (PAMI) 1 (2) (1979) 224-227.
48. S. Zhong, J. Ghosh, A unified framework for model-based clustering, J. Mach. Learn. Res. 4 (2003) 1001-1037.
49. H.-J. Mucha, H.-G. Bartel, An accelerated k-means algorithm based on adaptive distances, in: W.A. Gaul, A. Geyer-Schulz, L. Schmidt-Thieme, J. Kunze (Eds.), Challenges at the Interface of Data Analysis, Computer Science, and Optimization, Studies in Classification, Data Analysis, and Knowledge Organization, Springer, Berlin, Heidelberg, 2012, pp. 37-47.
50. M. Halkidi, M. Vazirgiannis, A density-based cluster validity approach using multi-representatives, Pattern Recognit. Lett. 6 (2008) 773-786.
51. J.C. Dunn, Well separated clusters and optimal fuzzy partitions, J. Cybern. 4 (1974) 95-104.
52. M. Kim, R.S. Ramakrishna, New indices for cluster validity assessment, Pattern Recognit. Lett. 26 (15) (2005) 2353-2363.
53. G.W. Milligan, M.C. Cooper, An examination of procedures for determining the number of clusters in a data set, Psychometrika 50 (1985) 159-179.
54. U. Maulik, S. Bandyopadhyay, Performance evaluation of some clustering algorithms and validity indices, IEEE Trans. Pattern Anal. Mach. Intell. 24 (12) (2002) 1650-1654.
55. D. Kim, K.H. Lee, D. Lee, On cluster validity index for estimation of the optimal number of fuzzy clusters, Pattern Recognit. 37 (2004) 2009-2025.
56. L. Vendramin, R.J.G.B. Campello, E.R. Hruschka, A robust methodology for comparing performances of clustering validity criteria, in: Lecture Notes in Artificial Intelligence (LNAI), vol. 5249, 2008, pp. 237-247.