抄録
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.
| 元の言語 | 英語 |
|---|---|
| ページ（範囲） | 812-820 |
| ページ数 | 9 |
| ジャーナル | IEICE Transactions on Information and Systems |
| 巻 | E95-D |
| 発行部数 | 3 |
| DOI | |
| 出版物ステータス | 出版済み - 3 2012 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Software
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering
- Artificial Intelligence
これを引用
Linear semi-supervised dimensionality reduction with pairwise constraint for multiple subclasses. / Tong, Bin; Jia, Weifeng; Ji, Yanli; Suzuki, Einoshin.
：: IEICE Transactions on Information and Systems, 巻 E95-D, 番号 3, 03.2012, p. 812-820.研究成果: ジャーナルへの寄稿 › 記事
}
TY - JOUR
T1 - Linear semi-supervised dimensionality reduction with pairwise constraint for multiple subclasses
AU - Tong, Bin
AU - Jia, Weifeng
AU - Ji, Yanli
AU - Suzuki, Einoshin
PY - 2012/3
Y1 - 2012/3
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84857873028&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84857873028&partnerID=8YFLogxK
U2 - 10.1587/transinf.E95.D.812
DO - 10.1587/transinf.E95.D.812
M3 - Article
AN - SCOPUS:84857873028
VL - E95-D
SP - 812
EP - 820
JO - IEICE Transactions on Information and Systems
JF - IEICE Transactions on Information and Systems
SN - 0916-8532
IS - 3
ER -