arXiv Machine Learning
N$^2$: A Unified Python Package and Test Bench for Nearest Neighbor-Based Matrix Completion
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Aug 26
Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion
arXiv:2411.12965v3 Announce Type: replace-cross Abstract: Nearest neighbor (NN) algorithms have been extensively used for missing data problems in recommender systems and sequential decision-making s...
arXiv Machine Learning
Sep 4
Coupled Tensor-Tensor Completion Method with Applications in Drug Repurposing
The paper introduces Coupled Tensor‑Tensor Completion (CTTC), a new framework that incorporates side information in tensor form to enhance tensor completion tasks. CTTC leverages hidden connections among multimodal tensors and is grounded in distance metric learning and group theory. Experiments on the DTD and LINCS datasets show that CTTC outperforms existing methods such as HaLRTC, CTRC, Cell, and NTDDR in both runtime and root‑sum‑of‑squares error for drug effect prediction.
Hugging Face Trending Papers
Sep 2
Coupled Tensor-Tensor Completion Method with Applications in Drug Repurposing
The paper introduces Coupled Tensor‑Tensor Completion (CTTC), a new framework that incorporates side information in tensor form to enhance tensor completion tasks. CTTC leverages hidden connections among multimodal tensors and is grounded in distance metric learning and group theory. Experiments on the DTD and LINCS datasets show that CTTC outperforms existing methods such as HaLRTC, CTRC, Cell, and NTDDR in both run‑time and root‑sum‑of‑errors accuracy for predicting drug effects.
arXiv AI
Jun 2
Rank-Constrained Deep Matrix Completion for Group Recommendation
arXiv:2606. 01948v1 Announce Type: cross Abstract: The growing popularity of group activities has increased the need for methods that provide recommendations to groups of users given their individual preferences.
arXiv Machine Learning
Jul 13
Graph-Regularized Low-Rank Matrix Completion by Variable Projection
arXiv:2607. 09546v1 Announce Type: new Abstract: We address the low-rank matrix completion problem by incorporating graph regularization into the existing Riemannian Trust-Region Matrix Completion (RTRMC) framework.
arXiv Machine Learning
Jul 23
Non--negative matrix factorization using the \textit{R} package \textsf{nnmf}
arXiv:2607. 20084v1 Announce Type: cross Abstract: Non--negative matrix factorization (NMF) has become an established dimensionality reduction technique for extracting latent structures from non--negative data and has found widespread applications in fields such as bioinformatics, text mining, image analysis, and recommender systems.