paper-with-me

Papers

High Order Singular Value Decomposition for Plant Biodiversity Estimation

2019-11-29

We propose a new method to estimate plant biodiversity with R{\'e}nyi and Rao indexes through the so called High Order Singular Value Decomposition (HOSVD) of tensors. Starting from NASA multispectral images we evaluate biodiversity and we compare original biodiversity estimates with those realised via the HOSVD compression methods for big data. Our strategy turns out to be extremely powerful in terms of storage memory and precision of the outcome. The obtained results are so promising that we can support the efficiency of our method in the ecological framework.

📄 PDF Abstract BibTeX arXiv:1911.13076

Code (0)

등록된 구현이 없습니다.

Tasks

Vocal Bursts Intensity Prediction

Similar Papers 제목 키워드 기반

Approximation of Images via Generalized Higher Order Singular Value Decomposition over Finite-dimensional Commutative Semisimple Algebra

2022-02-01 · Liang Liao, Sen Lin, Lun Li, Xiuwei Zhang 외

Low-rank approximation of images via singular value decomposition is well-received in the era of big data. However, singular value decomposition (SVD) is only for order-two data, i.e., matrices. It is necessary to flatte…

Optimal Sparse Singular Value Decomposition for High-dimensional High-order Data

2018-09-06 · Anru Zhang, Rungang Han

In this article, we consider the sparse tensor singular value decomposition, which aims for dimension reduction on high-dimensional high-order data with certain sparsity structure. A method named Sparse Tensor Alternatin…

Dimensionality ReductionVocal Bursts Intensity Prediction

Empirical Evaluation of Four Tensor Decomposition Algorithms

2007-11-13 · Peter D. Turney

Higher-order tensor decompositions are analogous to the familiar Singular Value Decomposition (SVD), but they transcend the limitations of matrices (second-order tensors). SVD is a powerful tool that has achieved impress…

Collaborative FilteringInformation RetrievalRetrievalTensor Decomposition

A Tight Lower Bound for the Approximation Guarantee of Higher-Order Singular Value Decomposition

2025-08-08 · Matthew Fahrbach, Mehrdad Ghadiri arxiv

We prove that the classic approximation guarantee for the higher-order singular value decomposition (HOSVD) is tight by constructing a tensor for which HOSVD achieves an approximation ratio of $N/(1+\varepsilon)$, for an…

Quantum tensor singular value decomposition with applications to recommendation systems

2019-10-03 · Xiaoqiang Wang, Lejia Gu, Joseph Heung-wing Joseph Lee, Guofeng Zhang

In this paper, we present a quantum singular value decomposition algorithm for third-order tensors inspired by the classical algorithm of tensor singular value decomposition (t-svd) and then extend it to order-$p$ tensor…

Recommendation Systems