An Ordinal Weighted EDM Model for Nonmetric Multidimensional Scaling
Qingna Li, Chi Zhang, Mengzhi Cao
Abstract
Qingna Li, Chi Zhang, Mengzhi Cao
Abstract
Multidimensional scaling (MDS) is to recover a set of points by making use of noised pairwise Euclidean distances. In some situations, the observed Euclidean distances may contain large errors or even missing values. In such cases, the order of the distances is far more important than their magnitude. Non-metric multidimensional scaling (NMDS) is then to deal with this problem by taking use of the ordinal information. The challenge of NMDS is to tackle the large number of ordinal constraints on distances (for [Formula: see text] points, this will be of [Formula: see text]), which will slow down existing numerical algorithms. In this paper, we propose an ordinal weighted Euclidean distance matrix model for NMDS. By designing an ordinal weighted matrix, we get rid of the large number of ordinal constraints and tackle the ordinal constraints in a soft way. We then apply our model to image ranking. The key insight is to view the image ranking problem as NMDS in the kernel space. We conduct extensive numerical test on two state-of-the-art datasets: FG-NET aging dataset and MSRA-MM dataset. The results show the improvement of the proposed approach over the existing methods.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Multidimensional scaling (MDS) is to recover a set of points by making use of noised pairwise Euclidean distances. In some situations, the observed Euclidean distances may contain large errors or even missing values. In such cases, the order of the distances is far more important than their magnitude. Non-metric multidimensional scaling (NMDS) is then to deal with this problem by taking use of the ordinal information. The challenge of NMDS is to tackle the large number of ordinal constraints on distances (for [Formula: see text] points, this will be of [Formula: see text]), which will slow down existing numerical algorithms. In this paper, we propose an ordinal weighted Euclidean distance matrix model for NMDS. By designing an ordinal weighted matrix, we get rid of the large number of ordinal constraints and tackle the ordinal constraints in a soft way. We then apply our model to image ranking. The key insight is to view the image ranking problem as NMDS in the kernel space. We conduct extensive numerical test on two state-of-the-art datasets: FG-NET aging dataset and MSRA-MM dataset. The results show the improvement of the proposed approach over the existing methods.
Key concepts: Multidimensional scaling, Pairwise comparison, Ordinal data, Mathematics, Ranking (information retrieval), Ordinal regression, Euclidean distance, Metric (unit)