A density-based similarity matrix construction for spectral clustering

Neurocomputing

Volumn 151, Issue P2, 2015, Pages 835-844

  Beauchemin, Mario ^a  

^a CANADA CENTRE FOR REMOTE SENSING   (Canada)

Author keywords

Affinity matrix; Cluster ensembles; K means algorithm; Non parametric density estimation; Spectral clustering

Indexed keywords

MATRIX ALGEBRA;

AFFINITY MATRIX; ASYMPTOTIC PROPERTIES; CLUSTER ENSEMBLES; CO-OCCURRENCE PROBABILITY; DENSITY ESTIMATION METHODS; EVIDENCE ACCUMULATION; NONPARAMETRIC DENSITY ESTIMATION; SPECTRAL CLUSTERING;

K-MEANS CLUSTERING;

ACCURACY; ALGORITHM; ARTICLE; CLUSTER ANALYSIS; DENSITY BASED SIMILARITY MATRIX CONSTRUCTION; PRINCIPAL COMPONENT ANALYSIS; PROBABILITY;

EID: 84919478149     PISSN: 09252312     EISSN: 18728286     Source Type: Journal    
DOI: 10.1016/j.neucom.2014.10.012     Document Type: Article

References (35)

1. Zhang X., Li J., Yu H. Local density adaptive similarity measurement for spectral clustering. Pattern Recognit. Lett. 2011, 32:352-358.
2. Xia T., Cao J, Zhang Y.-d, Li J-T. On defining affinity graph for spectral clustering through ranking on manifold. Neurocomputing 2009, 72:3203-3211.
3. Zhang Z., Jordan M.I. Multiway spectral clustering: a margin-based perspective. Stat. Sci. 2008, 23(3):383-403.
4. R. Zass, A. Shashua, A unifying approach to hard and probabilistic clustering, in: Proceedings of the Tenth IEEE International Conference on Computer Vision, Beijing, China, 2005, pp. 294-301.
5. von Luxburg U. A tutorial on spectral clustering. Stat. Comput. 2007, 17:395-416.
6. Shi J., Malik J. Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 2000, 22(8):888-905.
7. Zelnik-Manor L., Perona P. Self-tuning spectral clustering. Advances in Neural Information Processing Systems 17 2004, 1601-1608. MIT Press, Vancouver, BC, Canada.
8. Wang X., Yang C., Zhou J. Clustering aggregation by probability accumulation. Pattern Recognit. 2009, 42(5):668-675.
9. D. Erdogmus, M.A. Carreira-Perpinan, U. Ozertem, Kernel density estimation, affinity-based clustering, and typical cuts, in: Proceedings of the 31st IEEE International Conference on Acoustics, Speech, and Signal Processing, Toulouse, France, 2006.
10. Jenssen R., Erdogmus D., Principe J.C., Eltoft T. The Laplacian classifier. IEEE Trans. Signal Process. 2007, 55(7):3262-3271.
11. Ozertem U., Erdogmus D., Jenssen R. Mean shift spectral clustering. Pattern Recognit. 2008, 41(6):1924-1938.
12. Champaneri A. Multivariate Probability Density Estimation: Some Statistical Properties 2001, (Ph.D. Dissertation), George Mason University.
13. MA. Wong, Asymptotic properties of K-means clustering algorithm as a density estimation procedure, Working Paper #2000-80, Sloan School of Management, Massachusetts Institute of Technology, 1980.
14. MA. Wong, Using the K-means clustering method as a density estimation procedure, Working paper #1340-82, Sloan School of Management, Massachusetts Institute of Technology, 1982b.
15. Wong M.A. A hybrid clustering algorithm for identifying high density clusters. J. Am. Stat. Assoc. 1982, 77:841-847.
16. Hearne L.B., Wegman E.J. Adaptive probability density estimation in lower dimensions using random tessellations. Comput. Sci. Stat. 1991, 23:241-245.
17. Hearne L.B., Wegman E.J. Maximum entropy density estimation using random tessellations. Comput. Sci. Stat. 1992, 24:483-487.
18. Fred A.L.N., Jain A.K. Combining multiple clustering using evidence accumulation. IEEE Trans. Pattern Anal. Mach. Intell. 2005, 27(6):835-850.
19. Silverman B.W. Density Estimation for Statistics and Data Analysis 1986, Chapman and Hall, London, UK.
20. Lugosi G., Nobel A. Consistency of data-driven histogram methods for density estimation and classification. Ann. Stat. 1996, 24(2):687-706.
21. Browne M. Regularized tessellation density estimation with bootstrap aggregation and complexity penalization. Pattern Recognit. 2012, 45:1531-1539.
22. LB. Hearne, Univariate non-parametric density estimation using random linear tesselation, in: Proceedings of the 20th International Conference Information Interfaces (ITI), Pula, Croatia, 1998, pp. 19-32.
23. Wegman E.J., Carr D.B. Statistical Graphics and Visualization. Handbook of Statistics 9 1993, 857-958. Elsevier. C. Rao (Ed.).
24. Andonova S., Elisseeff A., Evgeniou T., Pontil M. A Simple Algorithm for Learning Stable Machines 2002, 513-517. [U+05F3]ECAI[U+05F3], IOS Press, Lyon, France. Frank van Harmelen (Ed.).
25. Marron J.S., Wand M.P. Exact mean integrated squared error. Ann. Stat. 1992, 20(2):712-736.
26. Rousseeuw P., Hubert M. Robust statistics for outlier detection. WIREs Data Min. Knowl. Discov. 2011, 1:73-79.
27. Bruske J., Sommer G. Intrinsic dimensionality estimation with optimally topology preserving maps. IEEE Trans. Pattern Anal. Mach. Intell. 1998, 20:572-575.
28. Fern X., Lin W. Cluster ensemble selection. Stat. Anal. Data Min. 2008, 1(3):128-141.
29. Li X.-Y., Guo L.-j Constructing affinity matrix in spectral clustering based on neighbor propagation. Neurocomputing 2012, 97:125-130.
30. Ng A.Y., Jordan M., Weiss Y. On spectral clustering: analysis and an algorithm. in: Advances in Neural Information Processing Systems 14 2001, 849-856. Vancouver, Canada.
31. Nadler B., Galun M. Fundamental limitations of spectral clustering 2006, 1017-1024. MIT Press, Vancouver, BC, Canada, (Advances in Neural Information Processing Systems).
32. Wang Y., Jiang Y., Wu Y., Zhou Z.-H. Spectral clustering on multiple manifolds. IEEE Trans. Neural Netw. 2011, 22(7):1149-1161.
33. Aidos H., Fred A.L.N. A study of embedding methods under the evidence accumulation framework 2011, 7005:290-503. Springer.
34. Ayad H.G., Kamel M.S. Cumulative voting consensus method for partitions with variable number of clusters. IEEE Pattern Anal. Mach. Intel. 2008, 30(1):160-173.
35. Stuart A., Ord J.K. Kendall[U+05F3]s Advanced Theory of Statistics 1993, John Wiley and Sons Inc., New York. Sixth Ed.