29 August 2016 Graph regularized deep semi-nonnegative matrix factorization for clustering
Author Affiliations +
Proceedings Volume 10033, Eighth International Conference on Digital Image Processing (ICDIP 2016); 100335O (2016) https://doi.org/10.1117/12.2244144
Event: Eighth International Conference on Digital Image Processing (ICDIP 2016), 2016, Chengu, China
Abstract
Matrix factorization technique has wide applications in data analysis, in which Semi-nonnegative Matrix Factorization (Semi-NMF) can learn an effective low-dimensional feature representation by semi-nonnegative limit inspired from cognition, and has a unique physical meaning that the whole is composed of the parts. In addition, the fashionable Deep Semi-NMF can learn more hidden information by deep factorization. But they do not consider the intrinsic geometric structure of complex data. However more effective feature representations can obtain by using the geometric structure information of complex data and local invariance. In this paper we regularize Semi-NMF and Deep Semi-NMF by using the neighbor graph for keeping the intrinsic geometric structure of the original data. So we propose two novel feature extracting algorithms: Graph Regularized Semi-NMF and Graph Regularized Deep Semi-NMF. The clustering experimental results on several benchmark datasets show that our Graph Regularized Semi-NMF and Graph Regularized Deep Semi-NMF outperform obviously Semi-NMF and Deep Semi-NMF respectively.
© (2016) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Xianhua Zeng, Xianhua Zeng, Shengwei Qu, Shengwei Qu, Zhilong Wu, Zhilong Wu, "Graph regularized deep semi-nonnegative matrix factorization for clustering", Proc. SPIE 10033, Eighth International Conference on Digital Image Processing (ICDIP 2016), 100335O (29 August 2016); doi: 10.1117/12.2244144; https://doi.org/10.1117/12.2244144
PROCEEDINGS
5 PAGES


SHARE
Back to Top