Multi-task Sparse Regression Metric Learning for Heterogeneous Classification

被引:0
作者
Wu, Haotian [1 ]
Zhou, Bin [2 ]
Zhu, Pengfei [1 ]
Hu, Qinghua [1 ]
Shi, Hong [1 ]
机构
[1] Tianjin Univ, Coll Intelligence & Comp, Tianjin 300350, Peoples R China
[2] Natl Key Lab Sci & Technol Aerosp Automat Control, Beijing 100854, Peoples R China
来源
ARTIFICIAL NEURAL NETWORKS AND MACHINE LEARNING - ICANN 2019: DEEP LEARNING, PT II | 2019年 / 11728卷
基金
中国国家自然科学基金;
关键词
Heterogeneous data; Metric learning; Sparse regression; Multi-task learning; DICTIONARIES;
D O I
10.1007/978-3-030-30484-3_44
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
With the ubiquitous usage of digital devices, social networks and industrial sensors, heterogeneous data explosively increase. Metric learning can boost the classification performance via jointly learning a set of distance metrics from heterogeneous data. The metric learning algorithms are affected by the noisy doublets, i.e., the similar and dissimilar sample pairs. It is also a challenging issue to balance commonality and individuality for multi-view metric learning. To address the above issues, in this paper, we propose a novel multi-task group sparse regression metric learning (MT-SRML) for heterogeneous classification. Metric learning is formulated as sparse regression problem. The group sparse regularization on the repression coefficients of the doublets can restrain the effect of the noisy sample pairs jointly for multiple views. Experiments on heterogeneous data show that the proposed MT-SRML outperforms the state-of-the art metric learning algorithms in terms of both accuracy and efficiency.
引用
收藏
页码:543 / 553
页数:11
相关论文
共 33 条
[1]  
Abiteboul S, 1997, LECT NOTES COMPUT SC, V1186, P351
[2]   K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation [J].
Aharon, Michal ;
Elad, Michael ;
Bruckstein, Alfred .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) :4311-4322
[3]   Global viewing of heterogeneous data sources [J].
Castano, S ;
De Antonellis, V ;
di Vimercati, SD .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2001, 13 (02) :277-297
[4]  
Dalal N., 2005, P CVPR, DOI [10.1109/ISISE.2008.308, DOI 10.1109/ISISE.2008.308]
[5]  
Davis J. V., 2007, P 24 INT C MACH LEAR, P209, DOI DOI 10.1145/1273496.1273523
[6]   Optimally sparse representation in general (nonorthogonal) dictionaries via l1 minimization [J].
Donoho, DL ;
Elad, M .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2003, 100 (05) :2197-2202
[7]   Image denoising via sparse and redundant representations over learned dictionaries [J].
Elad, Michael ;
Aharon, Michal .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2006, 15 (12) :3736-3745
[8]  
Fei-Fei L., 2004, CVPR WORKSHOP, P178, DOI [DOI 10.1016/J.CVIU.2005.09.012, DOI 10.1109/CVPR.2004.383]
[9]   Is that you? Metric Learning Approaches for Face Identification [J].
Guillaumin, Matthieu ;
Verbeek, Jakob ;
Schmid, Cordelia .
2009 IEEE 12TH INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2009, :498-505
[10]   Deep Metric Learning Using Triplet Network [J].
Hoffer, Elad ;
Ailon, Nir .
SIMILARITY-BASED PATTERN RECOGNITION, SIMBAD 2015, 2015, 9370 :84-92