Twin kernel embedding with relaxed constraints on dimensionality reduction for structured data

  • Yi Guo
  • , Junbin Gao
  • , Paul W. Kwan

Research output: Chapter in Book / Conference PaperConference Paperpeer-review

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 languageEnglish
Title of host publicationAI 2007
Subtitle of host publicationAdvances in Artificial Intelligence - 20th Australian Joint Conference on Artificial Intelligence, Proceedings
PublisherSpringer Verlag
Pages659-663
Number of pages5
ISBN (Print)9783540769262
DOIs
Publication statusPublished - 2007
Externally publishedYes
Event20th Australian Joint Conference on Artificial Intelligence, AI 2007 - Gold Coast, Australia
Duration: 2 Dec 20076 Dec 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4830 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference20th Australian Joint Conference on Artificial Intelligence, AI 2007
Country/TerritoryAustralia
CityGold Coast
Period2/12/076/12/07

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