Linear semi-supervised dimensionality reduction with pairwise constraint for multiple subclasses

Bin Tong, Weifeng Jia, Yanli Ji, Einoshin Suzuki

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


We propose a new method, called Subclass-oriented Dimensionality Reduction with Pairwise Constraints (SODRPaC), for dimensionality reduction. In a high dimensional space, it is common that a group of data points with one class may scatter in several different groups. Current linear semi-supervised dimensionality reduction methods would fail to achieve fair performances, as they assume two data points linked by a must-link constraint are close each other, while they are likely to be located in different groups. Inspired by the above observation, we classify the must-link constraint into two categories, which are the inter-subclass must-link constraint and the intra-subclass must-link constraint, respectively. We carefully generate cannot-link constraints by using must-link constraints, and then propose a new discriminant criterion by employing the cannot-link constraints and the compactness of shared nearest neighbors. The manifold regularization is also incorporated in our dimensionality reduction framework. Extensive experiments on both synthetic and practical data sets illustrate the effectiveness of our method.

Original languageEnglish
Pages (from-to)812-820
Number of pages9
JournalIEICE Transactions on Information and Systems
Issue number3
Publication statusPublished - Mar 2012

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence


Dive into the research topics of 'Linear semi-supervised dimensionality reduction with pairwise constraint for multiple subclasses'. Together they form a unique fingerprint.

Cite this