Advances in PARAFAC Using Parallel Block Decomposition
- Anh Huy Phan,
- Andrzej Cichocki
Parallel factor analysis (PARAFAC) is a multi-way decomposition method which allows to find hidden factors from the raw tensor data with many potential applications in neuroscience, bioinformatics, chemometrics etc [1,2]. The Alternating Least Squares (ALS) algorithm can explain the raw tensor by a small number of rank-one tensors with a high fitness. However, for large scale data, due to necessity to compute Khatri-Rao products of long factors, and multiplication of large matrices, existing algorithms require high computational cost and large memory. Hence decomposition of large-scale tensor is still a challenging problem for PARAFAC. In this paper, we propose a new algorithm based on the ALS algorithm which computes Hadamard products and small matrices, instead of Khatri-Rao products. The new algorithm is able to process extremely large-scale tensor with billions of entries in parallel. Extensive experiments confirm the validity and high performance of the developed algorithm in comparison with other well-known algorithms.
- Record ID
- Leung Chi Sing, Chi Sing Leung Lee Minho, Minho Lee Chan Jonathan H. Jonathan H. Chan (eds.): Neural Information Processing, Lecture Notes In Computer Science, no. 5863, 2009, Springer Berlin Heidelberg, ISBN 978-3-642-10676-7, 978-3-642-10677-4
- Keywords in English
- Artificial Intelligence (incl. Robotics), Computation by Abstract Devices, Image Processing and Computer Vision, Information Systems Applications (incl.Internet), pattern recognition, Simulation and Modeling
- http://link.springer.com/chapter/10.1007/978-3-642-10677-4_36 Opening in a new tab
- Score (nominal)
- Publication indicators
- = 4
- Citation count
- Uniform Resource Identifier
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or PerishOpening in a new tab system.