陈松灿
  • 招生学科专业:
    计算机科学与技术 -- 【招收博士、硕士研究生】 -- 计算机科学与技术学院
    软件工程 -- 【招收博士、硕士研究生】 -- 计算机科学与技术学院
    网络空间安全 -- 【招收硕士研究生】 -- 计算机科学与技术学院
    电子信息 -- 【招收博士、硕士研究生】 -- 计算机科学与技术学院
  • 学位:工学博士学位
  • 职称:教授
  • 所在单位:计算机科学与技术学院/人工智能学院/软件学院
电子邮箱:
所在单位:计算机科学与技术学院/人工智能学院/软件学院
学历:南京航空航天大学
毕业院校:杭州大学/上海交通大学/南京航空航天大学

当前位置: 中文主页 >> 科学研究 >> 论文成果
标题:
Multi-dimensional classification via a metric approach
点击次数:
所属单位:
计算机科学与技术学院/人工智能学院/软件学院
发表刊物:
NEUROCOMPUTING
关键字:
Multi-dimensional classification Problem transformation Distance metric learning Closed-form solution
摘要:
Multi-dimensional classification (MDC) refers to learning an association between individual inputs and their multiple dimensional output discrete variables, and is thus more general than multi-class classification (MCC) and multi-label classification (MLC). One of the core goals of MDC is to model output structure for improving classification performance. To this end, one effective strategy is to firstly make a transformation for output space and then learn in the transformed space. However, existing transformation approaches are all rooted in label power-set (LP) method and thus inherit its drawbacks (e. g., class imbalance and class overfitting). In this study, we first analyze the drawbacks of the LP, then propose a novel transformation method which can not only overcome these drawbacks but also construct a bridge from MDC to MLC. As a result, many off-the-shelf MLC methods can be adapted to our newlyformed problem. However, instead of adapting these methods, we propose a novel metric learning based method, which can yield a closed-form solution for the newly-formed problem. Interestingly, our metric learning based method can also naturally be applicable to MLC, thus itself can be of independent interest as well. Extensive experiments justify the effectiveness of our transformation approach and our metric learning based method. (C) 2017 Elsevier B.V. All rights reserved.
ISSN号:
0925-2312
是否译文:
发表时间:
2018-01-31
合写作者:
Ma, Zhongchen
通讯作者:
陈松灿
发表时间:
2018-01-31
扫一扫用手机查看