Semi-supervised discriminatively regularized classifier with pairwise constraints

  • Authors:
  • Jijian Huang;Hui Xue;Yuqing Zhai

  • Affiliations:
  • School of Computer Science and Engineering, Southeast University, Nanjing, P.R. China;School of Computer Science and Engineering, Southeast University, Nanjing, P.R. China;School of Computer Science and Engineering, Southeast University, Nanjing, P.R. China

  • Venue:
  • PRICAI'12 Proceedings of the 12th Pacific Rim international conference on Trends in Artificial Intelligence
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In many real-world classifications such as video surveillance, web retrieval and image segmentation, we often encounter that class information is reflected by the pairwise constraints between data pairs rather than the usual labels for each data, which indicate whether the pairs belong to the same class or not. A common solution is combining the pairs into some new samples labeled by the constraints and then designing a smoothness-driven regularized classifier based on these samples. However, it still utilizes the limited discriminative information involved in the constraints insufficiently. In this paper, we propose a novel semi-supervised discriminatively regularized classifier (SSDRC). By introducing a new discriminative regularization term into the classifier instead of the usual smoothness-driven term, SSDRC can not only use the discriminative information more fully but also explore the local geometry of the new samples further to improve the classification performance. Experiments demonstrate the superiority of our SSDRC.