Parallel randomly compressed cubes : A scalable distributed architecture for big tensor decomposition

IEEE Signal Processing Magazine

Volumn 31, Issue 5, 2014, Pages 57-70

  Sidiropoulos, Nicholas D ^a   Papalexakis, Evangelos E ^b   Faloutsos, Christos ^c  

^a UNIVERSITY OF MINNESOTA   (United States)

^b Carnegie Mellon University ^*  (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIG DATA; DIGITAL STORAGE; MEMORY ARCHITECTURE; PARALLEL ARCHITECTURES;

COMPUTATIONAL SAVINGS; DISTRIBUTED ARCHITECTURE; DISTRIBUTED COMPUTATIONS; LOW-RANK DECOMPOSITION; MASSIVE PARALLELISM; NOVEL ARCHITECTURE; PARALLEL PROCESSING; TENSOR DECOMPOSITION;

TENSORS;

EID: 85032751899     PISSN: 10535888     EISSN: None     Source Type: Journal    
DOI: 10.1109/MSP.2014.2329196     Document Type: Article

References (36)

1. N. Sidiropoulos, E. Papalexakis, and C. Faloutsos, "A parallel algorithm for big tensor decomposition using randomly compressed cubes (PARACOMP)," in Proc. IEEE ICASSP 2014, May 4-9, Florence, Italy.
2. D. Nion, K. Mokios, N. Sidiropoulos, and A. Potamianos, "Batch and adaptive PARAFAC-based blind separation of convolutive speech mixtures," IEEE Trans. Audio, Speech, Lang. Processing, vol. 18, no. 6, pp. 1193-1207, 2010.
3. C. Fevotte and A. Ozerov, "Notes on nonnegative tensor factorization of the spectrogram for audio source separation: Statistical insights and towards self-clustering of the spatial cues," in Exploring Music Contents, ser. Lecture Notes in Computer Science, S. Ystad, M. Aramaki, R. Kronland-Martinet, and K. Jensen, Eds. Berlin: Springer, 2011, vol. 6684, pp. 102-115.
4. N. Sidiropoulos, G. Giannakis, and R. Bro, "Blind PARAFAC receivers for DSCDMA systems," IEEE Trans. Signal Processing, vol. 48, no. 3, pp. 810-823, 2000. (Pubitemid 30576249)
5. N. Sidiropoulos, R. Bro, and G. Giannakis, "Parallel factor analysis in sensor array processing," IEEE Trans. Signal Processing, vol. 48, no. 8, pp. 2377-2388, 2000.
6. E. E. Papalexakis, C. Faloutsos, and N. D. Sidiropoulos, "Parcube: Sparse parallelizable tensor decompositions." in ECML/PKDD (1), ser. Lecture Notes in Computer Science, P. A. Flach, T. D. Bie, and N. Cristianini, Eds. Berlin: Springer, 2012, vol. 7523, pp. 521-536.
7. R. Bro and N. Sidiropoulos, "Least squares regression under unimodality and non-negativity constraints," J. Chemomet., vol. 12, no. 4, pp. 223-247, July/Aug. 1998. (Pubitemid 128478954)
8. A. Cichocki, D. Mandic, C. Caiafa, A.-H. Phan, G. Zhou, Q. Zhao, and L. De Lathauwer, "Multiway component analysis: Tensor decompositions for signal processing applications," IEEE Signal Processing Mag., to be published.
9. B. W. Bader and T. G. Kolda, "Efficient MATLAB computations with sparse and factored tensors," SIAM J. Sci. Comput., vol. 30, no. 1, pp. 205-231, Dec. 2007.
10. T. G. Kolda and J. Sun, "Scalable tensor decompositions for multi-aspect data mining," in Proc. 8th IEEE Int. Conf. Data Mining (ICDM 2008), Dec. 2008, pp. 363-372.
11. D. Nion and N. Sidiropoulos, "Adaptive algorithms to track the PARAFAC decomposition of a third-order tensor," IEEE Trans. Signal Processing, vol. 57, no. 6, pp. 2299-2310, 2009.
12. A. Phan and A. Cichocki, "PARAFAC algorithms for large-scale problems," Neurocomputing, vol. 74, no. 11, pp. 1970-1984, 2011.
13. N. Sidiropoulos and A. Kyrillidis, "Multi-way compressed sensing for sparse low-rank tensors," IEEE Signal Processing Lett., vol. 19, no. 11, pp. 757-760, 2012.
14. E. Papalexakis, N. Sidiropoulos, and R. Bro, "From k-means to higher-way co-clustering: Multilinear decomposition with sparse latent factors," IEEE Trans. Signal Processing, vol. 61, no. 2, pp. 493-506, 2013.
15. N. Sidiropoulos, "Low-rank decomposition of multi-way arrays: A signal processing perspective," in Proc. IEEE SAM Workshop, Sitges, Barcelona, Spain, 2004, pp. 52-58. (Pubitemid 41703403)
16. T. Kolda and B. Bader, "Tensor decompositions and applications," SIAM Rev., vol. 51, no. 3, pp. 455-500, 2009.
17. A. Smilde, R. Bro, P. Geladi, and J. Wiley, Multi-Way Analysis with Applications in the Chemical Sciences. Hoboken, NJ: Wiley, 2004.
18. P. Kroonenberg, Applied Multiway Data Analysis. Hoboken, NJ: Wiley, 2008.
19. R. Harshman, "Foundations of the PARAFAC procedure: Models and conditions for an "explanatory" multimodal factor analysis," UCLA Working Pap. Phonet., vol. 16, pp. 1-84, Dec. 1970.
20. R. Harshman, "Determination and proof of minimum uniqueness conditions for PARAFAC-1," UCLA Working Pap. Phonet., vol. 22, pp. 111-117, 1972.
21. J. Carroll and J. Chang, "Analysis of individual differences in multidimensional scaling via an n-way generalization of Eckart-Young decomposition," Psychometrika, vol. 35, no. 3, pp. 283-319, 1970.
22. J. Kruskal, "Three-way arrays: Rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics," Linear Algebra Appl., vol. 18, no. 2, pp. 95-138, 1977.
23. N. Sidiropoulos and R. Bro, "On the uniqueness of multilinear decomposition of N-way arrays," J. Chemomet., vol. 14, no. 3, pp. 229-239, 2000.
24. T. Jiang and N. Sidiropoulos, "Kruskal's permutation lemma and the identification of CANDECOMP/PARAFAC and bilinear models with constant modulus constraints," IEEE Trans. Signal Processing, vol. 52, no. 9, pp. 2625-2636, 2004.
25. A. Stegeman and N. Sidiropoulos, "On Kruskal's uniqueness condition for the CANDECOMP/PARAFAC decomposition," Linear Algebra Appl., vol. 420, no. 2-3, pp. 540-552, 2007. (Pubitemid 44751783)
26. L. Chiantini and G. Ottaviani, "On generic identifiability of 3-tensors of small rank," SIAM. J. Matrix Anal. Appl., vol. 33, no. 3, pp. 1018-1037, 2012.
27. A. Stegeman, J. ten Berge, and L. De Lathauwer, "Sufficient conditions for uniqueness in CANDECOMP/PARAFAC and INDSCAL with random component matrices," Psychometrika, vol. 71, no. 2, pp. 219-229, 2006. (Pubitemid 44116380)
28. R. Bro, N. Sidiropoulos, and G. Giannakis. (1999). A fast least squares algorithm for separating trilinear mixtures, in Proc. ICA99 Int. Workshop on Independent Component Analysis and Blind Signal Separation, pp. 289-294. [Online]. Available: http://www.ece.umn.edu/nikos/comfac.m
29. J. Brewer, "Kronecker products and matrix calculus in system theory," IEEE Trans. Circuits Syst., vol. 25, no. 9, pp. 772-781, 1978. (Pubitemid 9394325)
30. D. Donoho and M. Elad, "Optimally sparse representation in general (nonorthogonal) dictionaries via minimization," Proc. Nat. Acad. Sci., vol. 100, no. 5, pp. 2197-2202, 2003. (Pubitemid 36297476)
31. J. Dean and S. Ghemawat, "MapReduce: simplified data processing on large clusters," Commun. ACM, vol. 51, no. 1, pp. 107-113, 2008.
32. Apache. Hadoop. [Online]. Available: http://hadoop.apache.org/
33. A. Hadoop. Word count example. [Online]. Available: http://wiki.apache. org/hadoop/WordCount
34. U. Kang, E. Papalexakis, A. Harpale, and C. Faloutsos, "Gigatensor: Scaling tensor analysis up by 100 times-algorithms and discoveries," in Proc. 18th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, 2012, pp. 316-324.
35. U. Kang, B. Meeder, and C. Faloutsos, "Spectral analysis for billion-scale graphs: Discoveries and implementation," in Advances in Knowledge Discovery and Data Mining. New York: Springer, 2011, pp. 13-25.
36. U. Kang, C. E. Tsourakakis, and C. Faloutsos, "Pegasus: A peta-scale graph mining system implementation and observations," in Proc. 9th IEEE Int. Conf. Data Mining 2009 (ICDM'09), pp. 229-238.