Distributed-Memory Randomized Algorithms for Sparse Tensor CP Decomposition-Reference-Cited by-同舟云学术

Distributed-Memory Randomized Algorithms for Sparse Tensor CP Decomposition

Published:2024-06-17 Issue: Volume:27 Page:155-168
ISSN:
Container-title:Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Bharadwaj Vivek¹^ORCID,Malik Osman Asif²^ORCID,Murray Riley³^ORCID,Buluç Aydın⁴^ORCID,Demmel James¹^ORCID

Affiliation:

1. University of California, Berkeley, Berkeley, CA, USA

2. Encube Technologies, Stockholm, Sweden

3. Sandia National Laboratories, Albuquerque, NM, USA

4. Lawrence Berkeley National Laboratory, Berkeley, CA, USA

Funder

DOE U.S. Department of Energy

National Science Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3626183.3659980

Reference40 articles.

1. S. Smith, J. W. Choi, J. Li, R. Vuduc, J. Park, X. Liu, and G. Karypis, "FROSTT: The Formidable Repository of Open Sparse Tensors and Tools," 2017. [Online]. Available: http://frostt.io/

2. H.-H. Mao, C.-J. Wu, E. E. Papalexakis, C. Faloutsos, K.-C. Lee, and T.-C. Kao, "MalSpot: Multi2 Malicious Network Behavior Patterns Analysis," in Advances in Knowledge Discovery and Data Mining, ser. Lecture Notes in Computer Science, V. S. Tseng, T. B. Ho, Z.-H. Zhou, A. L. P. Chen, and H.-Y. Kao, Eds. Cham: Springer International Publishing, 2014, pp. 1--14.

3. TuckER: Tensor Factorization for Knowledge Graph Completion," in Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). Hong Kong, China;Balazevic I.;Association for Computational Linguistics,2019

4. Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysis

5. Generalized Canonical Polyadic Tensor Decomposition