Learning Meta-Distance for Sequences by Learning a Ground Metric via Virtual Sequence Regression

被引:4
作者
Su, Bing [1 ]
Wu, Ying [2 ]
机构
[1] Renmin Univ China, Gaoling Sch Artificial Intelligence, Beijing Key Lab Big Data Management & Anal Method, Beijing 100872, Peoples R China
[2] Northwestern Univ, Dept Elect & Comp Engn, Evanston, IL 60208 USA
基金
中国国家自然科学基金; 美国国家科学基金会;
关键词
Metric learning; temporal alignment; virtual sequence regression; optimal transport; ACTION RECOGNITION;
D O I
10.1109/TPAMI.2020.3010568
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Distance between sequences is structural by nature because it needs to establish the temporal alignments among the temporally correlated vectors in sequences with varying lengths. Generally, distances for sequences heavily depend on the ground metric between the vectors in sequences to infer the alignments and hence can be viewed as meta-distances upon the ground metric. Learning such meta-distance from multi-dimensional sequences is appealing but challenging. We propose to learn the meta-distance through learning a ground metric for the vectors in sequences. The learning samples are sequences of vectors for which how the ground metric between vectors induces the meta-distance is given. The objective is that the meta-distance induced by the learned ground metric produces large values for sequences from different classes and small values for those from the same class. We formulate the ground metric as a parameter of the meta-distance and regress each sequence to an associated pre-generated virtual sequence w.r.t. the meta-distance, where the virtual sequences for sequences of different classes are well-separated. We develop general iterative solutions to learn both the Mahalanobis metric and the deep metric induced by a neural network for any ground-metric-based sequence distance. Experiments on several sequence datasets demonstrate the effectiveness and efficiency of the proposed methods.
引用
收藏
页码:286 / 301
页数:16
相关论文
共 50 条
  • [21] Efficient Dual Approach to Distance Metric Learning
    Shen, Chunhua
    Kim, Junae
    Liu, Fayao
    Wang, Lei
    van den Hengel, Anton
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2014, 25 (02) : 394 - 406
  • [22] Face Hallucination by Learning Local Distance Metric
    Zou, Yuanpeng
    Zhou, Fei
    Liao, Qingmin
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2017, E100D (02): : 384 - 387
  • [23] Distance metric learning for graph structured data
    Yoshida, Tomoki
    Takeuchi, Ichiro
    Karasuyama, Masayuki
    MACHINE LEARNING, 2021, 110 (07) : 1765 - 1811
  • [24] Distance Metric Learning for Radio Fingerprinting Localization
    Bai, Siqi
    Luo, Yongjie
    Yan, Mingjiang
    Wan, Qun
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 163 (163)
  • [25] Mixed-Type Distance Shrinkage and Selection for Clustering via Kernel Metric Learning
    Ghashti, Jesse S.
    Thompson, John R. J.
    JOURNAL OF CLASSIFICATION, 2024,
  • [26] SAR Image Change Detection via Spatial Metric Learning With an Improved Mahalanobis Distance
    Wang, Rongfang
    Chen, Jia-Wei
    Wang, Yule
    Jiao, Licheng
    Wang, Mi
    IEEE GEOSCIENCE AND REMOTE SENSING LETTERS, 2020, 17 (01) : 77 - 81
  • [27] Multi-granularity distance metric learning via neighborhood granule margin maximization
    Zhu, Pengfei
    Hu, Qinghua
    Zuo, Wangmeng
    Yang, Meng
    INFORMATION SCIENCES, 2014, 282 : 321 - 331
  • [28] Multiple metric learning via local metric fusion
    Guo, Xinyao
    Li, Lin
    Dang, Chuangyin
    Liang, Jiye
    Wei, Wei
    INFORMATION SCIENCES, 2023, 621 : 341 - 353
  • [29] Metric Learning via Penalized Optimization
    Huang, Hao
    Peng, Yanan
    Gan, Ting
    Tu, Weiping
    Zhou, Ruiting
    Wu, Sai
    KDD '21: PROCEEDINGS OF THE 27TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2021, : 656 - 664
  • [30] Learning Distance Metric for Support Vector Machine: A Multiple Kernel Learning Approach
    Zhang, Weiqi
    Yan, Zifei
    Xiao, Gang
    Zhang, Hongzhi
    Zuo, Wangmeng
    NEURAL PROCESSING LETTERS, 2019, 50 (03) : 2899 - 2923