Abstract
Non-negative Matrix Factorization (NMF) has received considerable attention due to its parts-based representation and interpretability of the issue correspondingly. On the other hand, data usually reside on a submanifold of the ambient space. One hopes to find a compact representation which captures the hidden semantic relationships between data items and reveals the intrinsic geometric structure simultaneously. However, it is difficult to estimate the intrinsic manifold of the data space in a principled way. In this paper, we propose a novel algorithm, called Hybrid Manifold Regularized Non-negative Matrix Factorization (HMNMF), for this purpose. In HMNMF, we develop a hybrid manifold regularization framework to approximate the intrinsic manifold by combining different initial guesses. Experiments on two real-world datasets validate the effectiveness of new method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. NIPS 14, 585–591 (2001)
Belkin, M., Niyogi, P.: Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput. 15(6), 1373–1396 (2003)
Belkin, M., Niyogi, P.: Towards a theoretical foundation for Laplacian-based manifold methods. J. Comput. Syst. Sci. 74(8), 1289–1308 (2008)
Belkin, M., Niyogi, P., Sindhwani, V.: Manifold regularization: a geometric framework for learning from labeled and unlabeled examples. J. Mach. Learn. Res. 7, 2399–2434 (2006)
Birgin, E.G., Martínez, J.M., Raydan, M.: Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim. 10(4), 1196–1211 (2000)
Cai, D., He, X., Han, J., Huang, T.S.: Graph regularized nonnegative matrix factorization for data representation. IEEE Trans. PAMI 33(8), 1548–1560 (2011)
Cai, D., He, X., Wu, X., Han, J.: Non-negative matrix factorization on manifold. In: Eighth IEEE ICDM, pp. 63–72. IEEE (2008)
Elhamifar, E., Vidal, R.: Sparse subspace clustering. In: IEEE Conference on CVPR, pp. 2790–2797. IEEE (2009)
Elhamifar, E., Vidal, R.: Sparse subspace clustering: algorithm, theory, and applications. IEEE Trans. PAMI 35(11), 2765–2781 (2013)
Hadsell, R., Chopra, S., LeCun, Y.: Dimensionality reduction by learning an invariant mapping. In: IEEEComputer Society Conference on CVPR, vol. 2, pp. 1735–1742. IEEE (2006)
He, X., Cai, D., Shao, Y., Bao, H., Han, J.: Laplacian regularized gaussian mixture model for data clustering. IEEE TKDE 23(9), 1406–1418 (2011)
He, X., Cai, D., Yan, S., Zhang, H.-J.: Neighborhood preserving embedding. In: Tenth IEEE International Conference on ICCV, vol. 2, pp. 1208–1213. IEEE (2005)
He, X., Yan, S., Hu, Y., Niyogi, P., Zhang, H.-J.: Face recognition using laplacianfaces. IEEE Trans. PAMI 27(3), 328–340 (2005)
Kim, K.I., Steinke, F., Hein, M.: Semi-supervised regression using hessian energy with an application to semi-supervised dimensionality reduction. In: NIPS, pp. 979–987 (2009)
Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nature 401(6755), 788–791 (1999)
Roweis, S.T., Saul, L.K.: Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500), 2323–2326 (2000)
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. PAMI 22(8), 888–905 (2000)
Tenenbaum, J.B., De Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290(5500), 2319–2323 (2000)
Turaga, P., Veeraraghavan, A., Chellappa, R.: Statistical analysis on stiefel and grassmann manifolds with applications in computer vision. In: IEEE Conference on CVPR, pp. 1–8. IEEE (2008)
Wang, S., Yuan, X., Yao, T., Yan, S., Shen, J.: Efficient subspace segmentation via quadratic programming. AAAI 1, 519–524 (2011)
Xu, W., Liu, X., Gong, Y.: Document clustering based on non-negative matrix factorization. In: Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Informaion Retrieval, pp. 267–273. ACM (2003)
Zhang, Z., Zhao, K.: Low-rank matrix approximation with manifold regularization. IEEE Trans. PAMI 35(7), 1717–1729 (2013)
Zhou, D., Bousquet, O., Lal, T.N., Weston, J., Schölkopf, B.: Learning with local and global consistency. NIPS 16(16), 321–328 (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Luo, P., Peng, J., Guan, Z., Fan, J. (2016). Hybrid Manifold Regularized Non-negative Matrix Factorization for Data Representation. In: You, Z., et al. Biometric Recognition. CCBR 2016. Lecture Notes in Computer Science(), vol 9967. Springer, Cham. https://doi.org/10.1007/978-3-319-46654-5_62
Download citation
DOI: https://doi.org/10.1007/978-3-319-46654-5_62
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-46653-8
Online ISBN: 978-3-319-46654-5
eBook Packages: Computer ScienceComputer Science (R0)