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

当前位置: 中文主页 >> 科学研究 >> 论文成果
标题:
Metric learning-guided least squares classifier learning
点击次数:
所属单位:
计算机科学与技术学院/人工智能学院/软件学院
发表刊物:
IEEE Trans. Neural Networks Learn. Sys.
摘要:
For a multicategory classification problem, discriminative least squares regression (DLSR) explicitly introduces an ϵ-dragging technique to enlarge the margin between the categories, yielding superior classification performance from a margin perspective. In this brief, we reconsider this classification problem from a metric learning perspective and propose a framework of metric learning-guided least squares classifier (MLG-LSC) learning. The core idea is to learn a unified metric matrix for the error of LSR, such that such a metric matrix can yield small distances for the same category, while large ones for the different categories. As opposed to the ϵ-dragging in DLSR, we call this the error-dragging (e-dragging). Different from DLSR and its related variants, our MLG-LSC implicitly carries out the e-dragging and can naturally reflect the roughly relative distance relationships among the categories from a metric learning perspective. Furthermore, our optimization objective functions are strictly (geodesically) convex and thus can obtain their corresponding closed-form solutions, resulting in higher computational performance. Experimental results on a set of benchmark data sets indicate the validity of our learning framework. © 2012 IEEE.
ISSN号:
2162-237X
是否译文:
发表时间:
2018-12-01
合写作者:
Geng, Chuanxing
通讯作者:
陈松灿
发表时间:
2018-12-01
扫一扫用手机查看