Parallel Candecomp/Parafac Decomposition of Sparse Tensors Using Dimension Trees (Q4603494): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Efficient MATLAB Computations with Sparse and Factored Tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5323737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young'' decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical Singular Value Decomposition of Tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor rank is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Decompositions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of algorithms for fitting the PARAFAC model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448854 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/16m1102744 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2788854599 / rank
 
Normal rank

Latest revision as of 09:58, 30 July 2024

scientific article; zbMATH DE number 6841478
Language Label Description Also known as
English
Parallel Candecomp/Parafac Decomposition of Sparse Tensors Using Dimension Trees
scientific article; zbMATH DE number 6841478

    Statements

    Parallel Candecomp/Parafac Decomposition of Sparse Tensors Using Dimension Trees (English)
    0 references
    0 references
    0 references
    21 February 2018
    0 references
    sparse tensors
    0 references
    CP decomposition
    0 references
    dimension tree
    0 references
    parallel algorithms
    0 references
    alternating least squares based algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references