Spectral clustering of high-dimensional data exploiting sparse representation vectors

Neurocomputing

Volumn 135, Issue , 2014, Pages 229-239

  Wu, Sen ^a   Feng, Xiaodong ^a,c   Zhou, Wenjun ^b  

^a University of Science and Technology Beijing   (China)

^b UNIVERSITY OF TENNESSEE   (United States)

^c University of Minnesota   (United States)

Author keywords

High dimensional data; Sparse representation; Spectral clustering; Weight matrix

Indexed keywords

VECTORS;

CONTEXTUAL INFORMATION; DATA OBJECTS; HIGH DIMENSIONAL DATA; HIGH-DIMENSIONAL; SPARSE REPRESENTATION; SPECTRAL CLUSTERING; SPECTRAL CLUSTERING ALGORITHMS; WEIGHT MATRICES;

CLUSTERING ALGORITHMS;

ARTICLE; CLASSIFICATION ALGORITHM; CLUSTER ANALYSIS; CONTROLLED STUDY; DATA ANALYSIS; DATA BASE; DATA MINING; DATA SYNTHESIS; EXPERIMENTAL STUDY; MACHINE LEARNING; PRIORITY JOURNAL; SIGNAL DETECTION;

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

References (67)

1. Liu Y., Wang X., Wu C. ConSOM. A conceptional self-organizing map model for text clustering. Neurocomputing 2008, 71:857-862.
2. Koren Y., Bell R., Volinsky C. Matrix factorization techniques for recommender systems. Computer 2009, 42:30-37.
3. Bhatt C.A., Kankanhalli M.S. Multimedia data mining. state of the art and challenges. Multimed. Tools Appl. 2011, 51:35-76.
4. Zhang X., Jiaqi L., Yu D., Tingjie L. A novel clustering method on time series data. Expert Syst. Appl. 2011, 38:11891-11900.
5. Sun J., Chen W., Fang W., Wun X., Xu W. Gene expression data analysis with the clustering method based on an improved quantum-behaved particle swarm optimization. Eng. Appl. Artif. Intell. 2012, 25:376-391.
6. M. Steinbach, L. Ertöz, V. Kumar, The challenges of clustering high dimensional data, in: New Directions in Statistical Physics, Springer Berlin Heidelberg, 2004, pp. 273-309.
7. Chen X., Ye Y., Xu X., Huang Z.J. A feature group weighting method for subspace clustering of high-dimensional data. Pattern Recognit. 2012, 45:434-446.
8. von Luxburg U. A tutorial on spectral clustering. Stat. Comput. 2007, 17:395-416.
9. Ng A.Y., Jordan M.I., Weiss Y. On spectral clustering. analysis and an algorithm. Adv. Neural Inf. Process. Syst. 2002, 2:849-856.
10. Belkin M., Niyogi P. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput. 2003, 15:1373-1396.
11. Tenenbaum J.B., de Silva V., Langford J.C. A global geometric framework for nonlinear dimensionality reduction. Science 2000, 290:2319-2323.
12. Donoho D.L. Compressed sensing. IEEE Trans. Inf. Theory 2006, 52:1289-1306.
13. Wright J., Ma Y., Mairal J., Sapiro G., Huang T.S., Yan S. Sparse representation for computer vision and pattern recognition. Proc. IEEE 2010, 98:1031-1044.
14. Lee D.D., Seung S.H. Learning the parts of objects by non-negative matrix factorization. Nature 1999, 401:788-791.
15. Paatero P., Tapper U. Positive matrix factorization. a non-negative factor model with optimal utilization of error estimates of data values. Environmetrics 1994, 5:111-126.
16. Lee D.D., Seung H.S. Algorithms for non-negative matrix factorization. Adv. Neural Inf. Process. Syst. 2001, 13:556-562.
17. Sandler R., Lindenbaum M. Nonnegative matrix factorization with earth mover's distance metric for image analysis. IEEE Trans. Pattern Anal. Mach. Intell. 2011, 33:1590-1602.
18. N. Guan, D. Tao, Z. Luo, J.S. Taylor, MahNMF: Manhattan non-negative matrix factorization, arXiv preprint, 2012. http://arXiv:1207.3438.
19. D. Kim, S. Sra, I.S. Dhillon, Fast newton-type methods for the least squares nonnegative matrix approximation problem, in: Proceedings of the 2007 SIAM International Conference on Data Mining, 2007.
20. Guan N., Tao D., Luo Z., Yuan B. Online nonnegative matrix factorization with robust stochastic approximation. IEEE Trans. Neural Netw. Learn. Syst. 2012, 23:1087-1099.
21. N. Gillis, R. Luce, Robust near-separable nonnegative matrix factorization using linear optimization, arXiv preprint, 2013. http://arXiv:1302.4385.
22. 1 normalization based on Kullback-Leibler divergence. IEEE Trans. Signal Process. 2012, 60:3876-3880.
23. Hoyer P.O. Non-negative matrix factorization with sparseness constraints. J. Mach. Learn. Res. 2004, 5:1457-1469.
24. Esser E., Moller M., Osher S., Sapiro G., Xin J. A convex model for nonnegative matrix factorization and dimensionality reduction on physical space. IEEE Trans. Image Process. 2012, 21:3239-3252.
25. Zafeiriou S., Tefas A., Zafeiriou S., Tefas A. Exploiting discriminant information in nonnegative matrix factorization with application to frontal face verification. IEEE Trans. Neural Netw. 2006, 17:683-695.
26. Cai D., He X., Han J., Huang T.S. Graph regularized nonnegative matrix factorization for data representation. IEEE Trans. Pattern Anal. Mach. Intell. 2011, 33:1548-1560.
27. Guan N., Tao D., Luo Z., Yuan B. Manifold regularized discriminative nonnegative matrix factorization with fast gradient descent. IEEE Trans. Image Process. 2011, 20:2030-2048.
28. Liu H., Wu Z., Li X., Cai D., Huang T.S. Constrained nonnegative matrix factorization for image representation. IEEE Trans. Pattern Anal. Mach. Intell. 2012, 34:1299-1311.
29. C.H. Ding, X. He, H.D. Simon, On the equivalence of nonnegative matrix factorization and spectral clustering, in: Proceedings of the 2005 SIAM International Conference on Data Mining, SIAM, 2005, pp. 606-610.
30. Roweis S.T., Saul L.K. Nonlinear dimensionality reduction by locally linear embedding. Science 2000, 290:2323-2326.
31. Luo Y., Tao D., Geng B., Xu C., Maybank S.J. Manifold regularized multi-task learning for semi-supervised multilabel image classification. IEEE Trans. Image Process. 2013, 22:523-536.
32. Belkin M., Niyogi P., Sindhwani V. Manifold regularization. a geometric framework for learning from labeled and unlabeled examples. J. Mach. Learn. Res. 2006, 7:2399-2434.
33. Gao S., Tsang I.W.-H., Chia L.-T. Laplacian sparse coding, hypergraph laplacian sparse coding, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 2013, 35:92-104.
34. Zhou Y., Barner K. Locality constrained dictionary learning for nonlinear dimensionality reduction. IEEE Signal Process. Lett. 2013, 20:335-338.
35. J. Wang, J. Yang, K. Yu, F. Lv, T. Huang, Y. Gong, Locality-constrained linear coding for image classification, in: Proceedings of the 23rd IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, 2010, pp. 3360-3367.
36. Yu J., Tao D., Wang M. Adaptive hypergraph learning and its application in image classification. IEEE Trans. Image Process. 2012, 21:3262-3272.
37. Luo Y., Tao D., Member S., Xu C., Xu C., Liu H., Wen Y. Multiview vector-valued manifold regularization for multilabel image classification. IEEE Trans. Neural Netw. Learn. Syst. 2013, 24:709-722.
38. Yu J., Wang M., Tao D. Semi-supervised multiview distance metric learning for cartoon synthesis. IEEE Trans. Image Process. 2012, 21:4636-4648.
39. Deng X., Liu X., Song M., Cheng J., Bu J., Chen C. LF-EME. Local features with elastic manifold embedding for human action recognition. Neurocomputing 2012, 99:144-153.
40. Yu J., Liu D., Tao D., Seah H.S. Complex object correspondence construction in two-dimensional animation. IEEE Trans. Image Process. 2011, 20:3257-3269.
41. 1-norm near-solution approximates the sparsest near-solution. Commun. Pure Appl. Math. 2006, 59:797-829.
42. Candès E.J. The restricted isometry property and its implications for compressed sensing. Comptes Rendus Math. 2008, 346:589-592.
43. E.J. Candès, Compressive sampling, in: Proceedings of the International Congress of Mathematicians, 2006, pp. 1433-1452.
44. Chen S.S., Donoho D.L., Saunders M.A. Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 1998, 20:33-61.
45. Tibshirani R. Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B (Stat. Methodol.) 1996, 58:267-288.
46. Zou H., Hastie T. Regularization and variable selection via the elastic net. J. R. Stat. Soc. Ser. B (Stat. Methodol.) 2005, 67:301-320.
47. Zhou T., Tao D. Double shrinking sparse dimension reduction. IEEE Trans. Pattern Anal. Mach. Intell. 2013, 22:244-257.
48. T. Zhou, D. Tao, GoDec: randomized low-rank & sparse matrix decomposition in noisy case, in: Proceedings of the 28th International Conference on Machine Learning, ACM, 2011, pp. 33-40.
49. Zhou T., Tao D., Wu X. Manifold elastic net. a unified framework for sparse dimension reduction. Data Min. Knowl. Discov. 2011, 22:340-371.
50. Zheng M., Bu J., Chen C., Wang C., Zhang L., Qiu G., Cai D. Graph regularized sparse coding for image representation. IEEE Trans. Image Process. 2011, 20:1327-1336.
51. Wright J., Yang A.Y., Ganesh A., Sastry S.S., Ma Y. Robust face recognition via sparse representation. IEEE Trans. Pattern Anal. Mach. Intell. 2009, 31:210-227.
52. C.-G. Li, J. Guo, H.-G. Zhang, Local sparse representation based classification, in: Proceedings of the 20th International Conference on Pattern Recognition, IEEE, 2010, pp. 649-652.
53. S. Gao, I. W.-H. Tsang, L.-T. Chia, Kernel sparse representation for image classification and face recognition, in: Proceedings of the 11th European Conference on Computer Vision, Part IV, 2010, pp. 1-14.
54. E. Elhamifar, R. Vidal, Sparse subspace clustering, in: Proceedings of the 2009 IEEE Conference on Computer Vision and Pattern Recognition, IEEE, 2009, pp. 2790-2797.
55. J. Jiao, X. Mo, C. Shen, Image clustering via sparse representation, in: Advances in Multimedia Modeling, Springer, 2010, pp. 761-766.
56. Y. Gao, A. Choudhary, G. Hua, A nonnegative sparsity induced similarity measure with application to cluster analysis of spam images, in: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, IEEE, 2010, pp. 5594-5597.
57. S. Yan, H. Wang, Semi-supervised learning by sparse representation, in: Proceedings of the SIAM International Conference on Data Mining, SIAM, 2009, pp. 792-801.
58. H. Cheng, Z. Liu, J. Yang, Sparsity induced similarity measure for label propagation, in: Proceedings of IEEE 12th International Conference on Computer Vision, IEEE, 2009, pp. 317-324.
59. K. Bache, M. Lichman, UCI machine learning repository, 〈〉, 2013. http://archive.ics.uci.edu/ml.
60. A. Georghiades, Yale face, 〈〉, 2013. http://cvc.yale.edu/projects/yalefaces/yalefaces.html.
61. A. Georghiades, P. Belhumeur, D. Kriegman, Yale face_b, 〈〉, 2013. http://cvc.yale.edu/projects/yalefacesB/yalefacesB.html.
62. ORL face, AT&T Lab Cambridge, 〈〉, 2013. http://www.face-rec.org/databases/.
63. K. Koh, S.-J. Kim, S. Boyd, l1_ls: Simple MATLAB solver for l1-regularized least squares problems, Version Beta, 〈〉, 2008 (accessed on 10.11.2012). http://www.stanford.edu/~boyd/l1_ls/.
64. Hartigan J.A., Wong M.A. Algorithm as 136. a k-means clustering algorithm. J. R. Stat. Soc. Ser. C (Appl. Stat.) 1979, 28:100-108.
65. Huang Z.J. Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Min. Knowl. Discov. 1998, 2:283-304.
66. Jing L., Ng M.K., Huang Z.J. An entropy weighting k-means algorithm for subspace clustering of high-dimensional sparse data. IEEE Trans. Knowl. Data Eng. 2007, 19:1026-1041.
67. Deng Z., Choi K.-S., Chung F.-L., Wang S. EEW-SC. Enhanced entropy-weighting subspace clustering for high dimensional gene expression data clustering analysis. Appl. Soft Comput. 2011, 11:4798-4806.