Multidimensional Scaling on Multiple Input Distance Matrices

Authors

  • Song Bai Huazhong University of Science and Technology
  • Xiang Bai Huazhong University of Science and Technology
  • Longin Jan Latecki Temple University
  • Qi Tian University of Texas at San Antonio

DOI:

https://doi.org/10.1609/aaai.v31i1.10732

Keywords:

Multidimensional Scaling, Image Retrieval and Clustering, Multi-view Learning

Abstract

Multidimensional Scaling (MDS) is a classic technique that seeks vectorial representations for data points, given the pairwise distances between them. In recent years, data are usually collected from diverse sources or have multiple heterogeneous representations. However, how to do multidimensional scaling on multiple input distance matrices is still unsolved to our best knowledge. In this paper, we first define this new task formally. Then, we propose a new algorithm called Multi-View Multidimensional Scaling (MVMDS) by considering each input distance matrix as one view. The proposed algorithm can learn the weights of views (i.e., distance matrices) automatically by exploring the consensus information and complementary nature of views. Experimental results on synthetic as well as real datasets demonstrate the effectiveness of MVMDS. We hope that our work encourages a wider consideration in many domains where MDS is needed.

Downloads

Published

2017-02-12

How to Cite

Bai, S., Bai, X., Latecki, L. J., & Tian, Q. (2017). Multidimensional Scaling on Multiple Input Distance Matrices. Proceedings of the AAAI Conference on Artificial Intelligence, 31(1). https://doi.org/10.1609/aaai.v31i1.10732

Issue

Section

Main Track: Machine Learning Applications