TY - JOUR
T1 - An Ordinal Weighted EDM Model for Nonmetric Multidimensional Scaling
AU - Li, Qing Na
AU - Zhang, Chi
AU - Cao, Mengzhi
N1 - Publisher Copyright:
© 2022 World Scientific Publishing Co.
PY - 2022/6/1
Y1 - 2022/6/1
N2 - 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 n points, this will be of O(n4)), 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.
AB - 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 n points, this will be of O(n4)), 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.
KW - Euclidean distance matrix
KW - Nonmetric multidimensional scaling
KW - distance metric learning
KW - image ranking
KW - optimization methods
UR - http://www.scopus.com/inward/record.url?scp=85112734845&partnerID=8YFLogxK
U2 - 10.1142/S0217595921500330
DO - 10.1142/S0217595921500330
M3 - Article
AN - SCOPUS:85112734845
SN - 0217-5959
VL - 39
JO - Asia-Pacific Journal of Operational Research
JF - Asia-Pacific Journal of Operational Research
IS - 3
M1 - 2150033
ER -