Skip to main content

A Novel Fast Non-negative Matrix Factorization Algorithm and Its Application in Text Clustering

  • Conference paper
Advances in Swarm Intelligence (ICSI 2010)

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

Included in the following conference series:

  • 2195 Accesses

Abstract

In non-negative matrix factorization, it is difficult to find the optimal non-negative factor matrix in each iterative update. However, with the help of transformation matrix, it is able to derive the optimal non-negative factor matrix for the transformed cost function. Transformation matrix based nonnegative matrix factorization method is proposed and analyzed. It shows that this new method, with comparable complexity as the priori schemes, is efficient in enhancing nonnegative matrix factorization and achieves better performance in NMF based text clustering.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Non-negative matrix factorization, http://en.wikipedia.org/wiki/

  2. Liu, W.X., Zheng, N.N., You, Q.B.: Non-negative matrix factorization and its applications in pattern recognition. Chinese Science Bulletin 51, 17–18 (2006)

    Article  MathSciNet  Google Scholar 

  3. Pascual-Montano, A., Carazo, J.M., Kochi, K., Lehmann, D., Pascual-Marqui, R.D.: Non-smooth Non-Negative Matrix Factorization (nsNMF). IEEE Transactions on Pattern Analysis and Machine Intelligence 28, 403–415 (2006)

    Article  Google Scholar 

  4. Pascual-Montano, A., Carmona-Saez, P., Chagoyen, M., Tirado, F., Carazo, J.M., Pascual-Marqui, R.D.: bioNMF: a versatile tool for non-negative matrix factorization in biology. BMC Bioinformatics (2006)

    Google Scholar 

  5. Daniel, D., Lee, H., Sebastian, S.: Learning the parts of objects by non-negative matrix factorization. Nature 401, 788–791 (1999)

    Article  Google Scholar 

  6. Daniel, D., Lee, H., Sebastian, S.: Algorithms for Non-negative Matrix Factorization. In: Advances in Neural Information Processing Systems, vol. 13, pp. 556–562. MIT Press, Cambridge (2001)

    Google Scholar 

  7. Chih-Jen, L.: Projected Gradient Methods for Non-negative Matrix Factorization. Neural Computation 19, 2756–2779 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  8. Ngoc-Diep, H., Van Dooren, P., Blondel, V.D.: Descent Methods for Non-negative Matrix Factorization. Numerical Linear Algebra in Signals (2007)

    Google Scholar 

  9. Tan, S.B., Wang, Y.F.: Chinese text categorization corpora –TanCorp V1.0, http://www.searchforum.org.cn/tansongbo/corpus.htm

  10. Tan, S.B., Cheng, X.Q., Moustafa, M.G., Wang, B., Xu, H.B.: A Novel Refinement Approach for Text Categorization. In: 14th ACM Conf. on Information and Knowledge Management, pp. 469–476. ACM Press, Bremen (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, F., Zhu, Q. (2010). A Novel Fast Non-negative Matrix Factorization Algorithm and Its Application in Text Clustering . In: Tan, Y., Shi, Y., Tan, K.C. (eds) Advances in Swarm Intelligence. ICSI 2010. Lecture Notes in Computer Science, vol 6146. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13498-2_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13498-2_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13497-5

  • Online ISBN: 978-3-642-13498-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics