Fast and Efficient Algorithms for Nonnegative Tucker Decomposition

  • Anh Huy Phan
  • Andrzej Cichocki
Conference paper

DOI: 10.1007/978-3-540-87734-9_88

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5264)
Cite this paper as:
Phan A.H., Cichocki A. (2008) Fast and Efficient Algorithms for Nonnegative Tucker Decomposition. In: Sun F., Zhang J., Tan Y., Cao J., Yu W. (eds) Advances in Neural Networks - ISNN 2008. ISNN 2008. Lecture Notes in Computer Science, vol 5264. Springer, Berlin, Heidelberg

Abstract

In this paper, we propose new and efficient algorithms for nonnegative Tucker decomposition (NTD): Fast α-NTD algorithm which is much precise and faster than α-NTD [1]; and β-NTD algorithm based on the β divergence. These new algorithms include efficient normalization and initialization steps which help to reduce considerably the running time and increase dramatically the performance. Moreover, the multilevel NTD scheme is also presented, allowing further improvements (almost perfect reconstruction). The performance was also compared to other well-known algorithms (HONMF, HOOI, ALS algorithms) for synthetic and real-world data as well.

Keywords

Nonnegative Tucker decomposition (NTD) Nonnegative matrix factorization (NMF) Alpha divergence Beta divergence Hierarchical decomposition 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Anh Huy Phan
    • 1
  • Andrzej Cichocki
    • 1
  1. 1.RIKEN Brain Science InstituteWako-shiJapan

Personalised recommendations