Skip to main content

Co-clustering under Nonnegative Matrix Tri-Factorization

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7063))

Abstract

The nonnegative matrix tri-factorization (NMTF) approach has recently been shown to be useful and effective to tackle the co-clustering. In this work, we embed this problem in the NMF framework and we derive from the double k-means objective function a new formulation of the criterion. To optimize it, we develop two algorithms based on two multiplicative update rules. In addition we show that the double k-means is equivalent to algebraic problem of NMF under some suitable constraints. Numerical experiments on simulated and real datasets demonstrate the interest of our approach.

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

Buying options

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 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dhillon, I., Mallela, S., Modha, D.S.: Information-theoretic coclustering. In: Proceedings of KDD 2003, pp. 89–98 (September 2003)

    Google Scholar 

  2. Ding, C., Li, T., Peng, W., Park, H.: Orthogonal nonnegative matrix tri-factorizations for clustering. In: Proceedings of KDD 2006, Philadelphia, PA, pp. 635–640 (September 2006)

    Google Scholar 

  3. Edelman, A., Arias, T., Smith, S.T.: The geometry of algorithms with orthogonality constraints. SIAM Journal of Matrix Analysis and Application 20(2), 303–353 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. Govaert, G., Nadif, M.: Latent block model for contingency table. Communications in Statistics, Theory and Methods 39, 416–425 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Lee, D.D., Seung, H.S.: Algorithms for non-negative matrix factorization. In: Advances in Neural Information Processing Systems NIPS, vol.13, pp. 303–353. MIT Press (2001)

    Google Scholar 

  6. Li, T., Ma, S.: Iterative feature and data clustering. In: International Conference on Data Mining (SDM), pp. 536–543. SIAM (September 2004)

    Google Scholar 

  7. Long, B., Zhang, Z., Yu, P.S.: Co-clustering by value decomposition. In: Procedings of KDD 2005, pp. 635–640 (September 2005)

    Google Scholar 

  8. Xu, W., Liu, X., Gong, Y.: Document clustering based on non-negative matrix factorization. In: Proceedings of the ACM SIGIR 2003, Toronto, Canada, pp. 267–273 (September 2003)

    Google Scholar 

  9. Yang, Z., Yuan, Z., Laaksonen, J.: Projective non-negative matrix factorization with application to facial image processing. International Journal on Pattern Regognition and Artificial Intelligence 21, 1353–1362 (2007)

    Article  Google Scholar 

  10. Yoo, J., Choi, S.: Orthogonal nonnegative matrix tri-factorization for co-clustering: Multiplicative updates on stiefel manifolds. Information Processing and Management 46(5), 559–570 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Labiod, L., Nadif, M. (2011). Co-clustering under Nonnegative Matrix Tri-Factorization. In: Lu, BL., Zhang, L., Kwok, J. (eds) Neural Information Processing. ICONIP 2011. Lecture Notes in Computer Science, vol 7063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24958-7_82

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24958-7_82

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24957-0

  • Online ISBN: 978-3-642-24958-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics