Semi-supervised classification learning by discrimination-aware manifold regularization

被引:23
作者
Wang, Yunyun [1 ,2 ]
Chen, Songcan [2 ]
Xue, Hui [3 ]
Fu, Zhenyong [1 ]
机构
[1] Nanjing Univ Posts & Telecommun, Dept Comp Sci & Engn, Nanjing 210016, Jiangsu, Peoples R China
[2] Nanjing Univ Aeronaut & Astronaut, Dept Comp Sci & Engn, Nanjing 210016, Jiangsu, Peoples R China
[3] Southeast Univ, Sch Comp Sci & Engn, Nanjing 210096, Jiangsu, Peoples R China
基金
高等学校博士学科点专项科研基金; 中国国家自然科学基金;
关键词
Semi-supervised classification; Manifold regularization; Discrimination; Unsupervised clustering;
D O I
10.1016/j.neucom.2014.06.059
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Manifold regularization (MR) provides a powerful framework for semi-supervised classification (SSC) using both the labeled and unlabeled data. It first constructs a single Laplacian graph over the whole dataset for representing the manifold structure, and then enforces the smoothness constraint over such graph by a Laplacian regularizer in learning. However, the smoothness over such a single Laplacian graph may take the risk of ignoring the discrimination among boundary instances, which are very likely from different classes though highly close to each other on the manifold. To compensate for such deficiency, researches have already been devoted by taking into account the discrimination together with the smoothness in learning. However, those works are only confined to the discrimination of the labeled instances, thus rather limited in boosting the semi-supervised learning. To mitigate such an unfavorable situation, we attempt to discover the possible discrimination in the available instances first by performing some unsupervised clustering over the whole dataset, and then incorporate it into MR to develop a novel discrimination-aware manifold regularization (DAMR) framework. In DAMR, instances with high similarity on the manifold will be restricted to share the same class label if belonging to the same cluster, or to have different class labels, otherwise. Our empirical results show the competitiveness of DAMR compared to MR and its variants likewise incorporating the discrimination in learning. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:299 / 306
页数:8
相关论文
共 24 条
  • [1] Abernethy Jacob., 2008, AIRWeb '08, P41, DOI [DOI 10.1145/1451983.1451994, DOI 10.1145/1451983.1451994.URL]
  • [2] [Anonymous], 2006, BOOK REV IEEE T NEUR
  • [3] [Anonymous], 2009, Introduction to semi-supervised learning
  • [4] [Anonymous], 2008, Technical Report
  • [5] [Anonymous], 2003, P 20 INT C MACH LEAR
  • [6] Belkin M, 2002, ADV NEUR IN, V14, P585
  • [7] Belkin M, 2006, J MACH LEARN RES, V7, P2399
  • [8] Bengio Y, 2006, 11 label propagation and quadratic criterion
  • [9] Blum A, 2001, P 18 INT C MACH LEAR, P19, DOI DOI 10.1184/R1/6606860.V1
  • [10] Graph Regularized Nonnegative Matrix Factorization for Data Representation
    Cai, Deng
    He, Xiaofei
    Han, Jiawei
    Huang, Thomas S.
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (08) : 1548 - 1560