Machine Learning Model for Sparse PCM Completion
arXiv:2601.04366v1
Originality Synthesis-oriented
AI Analysis
This addresses the problem of handling incomplete data in decision-making processes for researchers and practitioners, but it appears incremental as it builds on existing methods.
The paper tackles the problem of completing sparse pairwise comparison matrices by proposing a machine learning model that combines classical PCM approaches with graph-based learning techniques, demonstrating effectiveness and scalability through numerical results.
In this paper, we propose a machine learning model for sparse pairwise comparison matrices (PCMs), combining classical PCM approaches with graph-based learning techniques. Numerical results are provided to demonstrate the effectiveness and scalability of the proposed method.