Abstract
Dimensionality reduction has been a fundamental tool when dealing with high-dimensional dataset. And trace ration optimization has been widely used in dimensionality reduction because Trace ratio can directly reflect the similarity (Euclidean distance) of data points. Conventionally, there is no close-form solution to the original trace ratio problem. Prior works have indicated that trace ratio problem can be solved by an iterative way. In this paper, we propose an efficient algorithm to find the optimal solutions. The proposed algorithm can be easily extended to its corresponding kernel version for handling the nonlinear problems. Finally, we evaluate our proposed algorithm based on extensive simulations of real world datasets. The results show our proposed method is able to deliver marked improvements over other supervised and unsupervised algorithms. © 2011 IEEE.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the International Joint Conference on Neural Networks |
| Pages | 145-152 |
| DOIs | |
| Publication status | Published - 2011 |
| Event | 2011 International Joint Conference on Neural Network, IJCNN 2011 - San Jose, United States Duration: 31 Jul 2011 → 5 Aug 2011 https://neural.memberclicks.net/assets/docs/2011%20ijcnn%20program%20book.pdf |
Conference
| Conference | 2011 International Joint Conference on Neural Network, IJCNN 2011 |
|---|---|
| Place | United States |
| City | San Jose |
| Period | 31/07/11 → 5/08/11 |
| Internet address |
Research Keywords
- Dimensionality reduction
- Discriminative learning
- Trace ratio criterion
Fingerprint
Dive into the research topics of 'ITR-Score algorithm: An efficient Trace ratio criterion based algorithm for supervised dimensionality reduction'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver