Matrix recovery from permutations: An algebraic geometry approach
MC Tsakiris - 2023 IEEE International Symposium on …, 2023 - ieeexplore.ieee.org
We prove that a generic matrix of bounded rank is uniquely recoverable—up to a
permutation of its rows and columns—from an arbitrary permutation of its entries. This can …
permutation of its rows and columns—from an arbitrary permutation of its entries. This can …
Matrix recovery from permutations
MC Tsakiris - Applied and Computational Harmonic Analysis, 2024 - Elsevier
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 …
permutations. Here, we study this problem theoretically for data organized in a rank-deficient …
Unlabeled Sensing Using Rank-One Moment Matrix Completion
We study the unlabeled sensing problem that aims to solve a linear system of equations Ax=
π (y) for an unknown permutation π. For a generic matrix A and a generic vector y, we …
π (y) for an unknown permutation π. For a generic matrix A and a generic vector y, we …
[PDF][PDF] Ten Machine Learning Algorithms for Short-Term Forecasting: A Comparative Study in Gas Warning Systems
RMX Wu, N Shafiabady, H Zhang, HH Lu… - Research …, 2023 - opus.lib.uts.edu.au
This research aims to explore more efficient machine learning (ML) algorithms with better
prediction assessments for short-term forecasting. Up-to-date literature shows a lack of …
prediction assessments for short-term forecasting. Up-to-date literature shows a lack of …