Abstract
This paper proposes a new nonlinear dimensionality reduction algorithm called RCTKE for highly structured data. It is built on the original TKE by incorporating a mapping function into the objective functional of TKE as regularization terms where the mapping function can be learned from training data and be used for novel samples. The experimental results on highly structured data is used to verify the effectiveness of the algorithm.
| Original language | English |
|---|---|
| Title of host publication | AI 2007: Advances in Artificial Intelligence: Proceedings of the 20th Australian Joint Conference on Artificial Intelligence Gold Coast, Australia, December 2-6, 2007 |
| Editors | Orgun, Mehmet A, Thornton, J |
| Place of Publication | Berlin, Germany |
| Publisher | Springer |
| Pages | 659-663 |
| ISBN (Print) | 9783540769262 |
| DOIs | |
| Publication status | Published - 2007 |
| Event | AI 2007: 20th Australian Joint Conference on Artificial Intelligence - Gold Coast, Australia Duration: 2 Dec 2007 → 6 Dec 2007 |
Conference
| Conference | AI 2007: 20th Australian Joint Conference on Artificial Intelligence |
|---|---|
| City | Gold Coast, Australia |
| Period | 2/12/07 → 6/12/07 |
Keywords
- Pattern Recognition and Data Mining
Fingerprint
Dive into the research topics of 'Twin Kernel Embedding with Relaxed Constraints on Dimensionality Reduction for Structured Data'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver