Bibliographic Details
| Title: |
Matrix recovery from permutations. |
| Authors: |
Tsakiris, Manolis C.1 (AUTHOR) manolis@amss.ac.cn |
| Source: |
Applied & Computational Harmonic Analysis. Nov2024, Vol. 73, pN.PAG-N.PAG. 1p. |
| Subjects: |
Algebraic geometry, Commutative algebra, Principal components analysis, Data recovery, Permutations |
| Abstract: |
In data science, a number of applications have been emerging involving data recovery from permutations. Here, we study this problem theoretically for data organized in a rank-deficient matrix. Specifically, we give unique recovery guarantees for matrices of bounded rank that have undergone arbitrary permutations of their entries. We use methods and results of commutative algebra and algebraic geometry, for which we include a preparation for a general audience. [ABSTRACT FROM AUTHOR] |
|
Copyright of Applied & Computational Harmonic Analysis is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
