Skip to main content

Learning Latent Features for Multi-view Clustering Based on NMF

  • Conference paper
  • First Online:
Book cover Rough Sets (IJCRS 2016)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9920))

Included in the following conference series:

Abstract

Multi-view data coming from multiple ways or being presented in multiple forms, have more information than single-view data. So multi-view clustering benefits from exploiting the more information. Nonnegative matrix factorization (NMF) is an efficient method to learn low-rank approximation of nonnegative matrix of nonnegative data, but it may not be good at clustering. This paper presents a novel multi-view clustering algorithm (called MVCS) which properly combines the similarity and NMF. It aims to obtain latent features shared by multiple views with factorizations, which is a common factor matrix attained from the views and the common similarity matrix. Besides, according to the reconstruction precisions of data matrices, MVCS could adaptively learn the weight. Experiments on real-world data sets demonstrate that our approach may effectively facilitate multi-view clustering and induce superior clustering results.

This work is supported by the National Science Foundation of China (Nos. 61170111 and 61572407), the Project of National Science and Technology Support Program (No. 2015BAH19F02) and the Science and Technology Planning Project of Sichuan Province (No. 2014SZ0207).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Liu, J., Jiang, Y., Li, Z., Zhou, Z.H., Lu, H.: Partially shared latent factor learning with multiview data. IEEE Trans. Neural Netw. Learn. Syst. 26(6), 1233–1246 (2015)

    Article  MathSciNet  Google Scholar 

  2. Xu, C., Tao, D., Xu, C.: A survey on multi-view learning. CoRR [Online], vol. abs/1304.5634 (2013). arxiv.org/abs/1304.5634

  3. Blum, A., Mitchell, T.: Combining labeled and unlabeled data with co-training. In: Proceedings of the Workshop on Computational Learning, pp. 92–100 (1998)

    Google Scholar 

  4. Wang, Z., Chen, S., Sun, T.: MultiK-MHKS: a novel multiple kernel learning algorithm. IEEE Trans. Pattern Anal. Mach. Intell. 30(2), 348–353 (2008)

    Article  Google Scholar 

  5. Subrahmanya, N., Shin, Y.C.: Sparse multiple kernel learning for signal processing applications. IEEE Trans. Pattern Anal. Mach. Intell. 32(5), 788–798 (2010)

    Article  Google Scholar 

  6. Wang, W., Zhou, Z.H.: A new analysis of co-training. In: Proceedings of the 27th International Conference on Machine Learning, pp. 1135–1142 (2010)

    Google Scholar 

  7. Yu, S., Krishnapuram, B., Rosales, R., Rao, R.B.: Bayesian co-training. J. Mach. Learn. Res. 12, 2649–2680 (2011)

    MathSciNet  MATH  Google Scholar 

  8. Amini, M.R., Usunier, N., Goutte, C., et al.: Learning from multiple partially observed viewsan application to multilingual text categorization. In: Advances in Neural Information Processing Systems, vol. 22, no. 1, pp. 28–36 (2010)

    Google Scholar 

  9. Quadrianto, N., Lampert, C.H.: Learning multi-view neighborhood preserving projections. In: Proceedings of the International Conference on Machine Learning, pp. 425–432 (2011)

    Google Scholar 

  10. Zhang, J.S., Wang, C.P., Yang, Y.Q.: Learning latent features by nonnegative matrix factorization combining similarity judgments. Neurocomputing 155, 43–52 (2015)

    Article  Google Scholar 

  11. Muslea, I., Minton, S., Knoblock, C.A.: Active+Semi-supervised Learning=Robust Multiview Learning. In: Machine Learning-international Workshop then Conference, pp. 435–442 (2002)

    Google Scholar 

  12. Kumar, A., Rai, P., Daume III, H.: Co-regularized multi-view spectral clustering. In: Advances in Neural Information Processing Systems, pp. 1413–1432 (2011)

    Google Scholar 

  13. Lanckriet, G.R.G., Cristianini, N., Bartlett, P., Ghaoui, L.E., Jordan, M.I.: Learning the kernel matrix with semidefinite programming. J. Mach. Learn. Res. 5, 27–72 (2004)

    MathSciNet  MATH  Google Scholar 

  14. Kloft, M., Blanchard, G.: The local rademacher complexity of Lp-norm multiple kernel learning. CoRR [Online], vol. abs/1304.0790 (2011). arXiv.org/abs/1304.0790

  15. Kursun, O., Alpaydin, E.: Canonical correlation analysis for multiview semisupervised feature extraction. In: Rutkowski, L., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2010. LNCS, vol. 6113, pp. 430–436. Springer, Heidelberg (2010). doi:10.1007/978-3-642-13208-7_54

    Chapter  Google Scholar 

  16. Lee, D., Seung, H.S.: Learning the parts of objects by nonnegative matrix factorization. Nature 401, 788–791 (1999)

    Article  Google Scholar 

  17. Lee, H., Yoo, J., Choi, S.: Semi-supervised nonnegative matrix factorization. IEEE Sign. Process. Lett. 17, 4–7 (2010)

    Article  Google Scholar 

  18. Sato, M., Sato, Y.: Structural model of similarity for fuzzy clustering. In: IEEE International Conference on Fuzzy Systems, vol. 2, pp. 963–968 (1997)

    Google Scholar 

  19. Wang, H., Nie, F., Huang, H., Yang, Y.: Learning frame relevance for video classification. In: Proceedings of the 2011 ACM Multimedia Conference and Co-located Workshops, pp. 1345–1348 (2011)

    Google Scholar 

  20. Miao, L.D., Qi, H.R.: Endmember extraction from highly mixed data using minimum volume constrained nonnegative matrix factorization. IEEE Trans. Geosci. Remote Sens. 45(3), 765–777 (2007)

    Article  Google Scholar 

  21. Xiao, C., Nie, F., Huang, H.: Multi-view K-means clustering on Big Data. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence, pp. 2598–2604 (2013)

    Google Scholar 

  22. Xia, R., Pan, Y., Du, L., Yin, J.: Robust multi-view spectral clustering via low-rank, sparse decomposition. In: Proceedings of 28th AAAI Conference on Artificial Intelligence, vol. 3, pp. 2149–2155 (2011)

    Google Scholar 

  23. Kumar, A., Rai, P., Daum, H.: Co-regularized multi-view spectral clustering. In: Advances in Neural Information Processing Systems (2011)

    Google Scholar 

  24. Tzortz, G., Likas, A.: Kernel-based weighted multi-view clustering. In: Proceedings of 12th International Conference on Data Mining, pp. 675–684 (2012)

    Google Scholar 

  25. Chen, X., Xu, X., Huang, J., Ye, Y.: TW-K-means: automated two-level variable weighting clustering algorithm for multiview data. IEEE Trans. Knowl. Data Eng. 25(4), 932–944 (2013)

    Article  Google Scholar 

  26. Liu, J., Wang, C., Gao, J., Han, J.: Multi-view clustering via joint nonnegative matrix factorization. In: Proceedings of the 2013 SIAN International Conference on Data Mining, pp. 252–260 (2013)

    Google Scholar 

  27. Rand, W.M.: Objective critera for the evaluation of clustering methods. J. Am. Stat. Assoc. 66(336), 846–850 (1971)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yan Yang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

He, M., Yang, Y., Wang, H. (2016). Learning Latent Features for Multi-view Clustering Based on NMF. In: Flores, V., et al. Rough Sets. IJCRS 2016. Lecture Notes in Computer Science(), vol 9920. Springer, Cham. https://doi.org/10.1007/978-3-319-47160-0_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-47160-0_42

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-47159-4

  • Online ISBN: 978-3-319-47160-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics