Fast non-linear dimension reduction

Nandakishore Kambhatla; Todd K. Leen

doi:10.1109/ICNN.1993.298730

Fast non-linear dimension reduction

Nandakishore Kambhatla, Todd K. Leen

Biomedical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

30 Scopus citations

Abstract

This paper presents a new algorithm for nonlinear dimension reduction. The algorithm builds a piece-wise linear model of the data. This piece-wise linear model provides compression that is superior to the globally linear model produced by principal component analysis. On several examples the piece-wise linear model also provides compression that is superior to the global non-linear model constructed by a five-layer, autoassociative neural network. Furthermore, the new algorithm trains significantly faster than the autoassociative network.

Original language	English (US)
Title of host publication	1993 IEEE International Conference on Neural Networks, ICNN 1993
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1213-1218
Number of pages	6
ISBN (Electronic)	0780309995
DOIs	https://doi.org/10.1109/ICNN.1993.298730
State	Published - 1993
Event	IEEE International Conference on Neural Networks, ICNN 1993 - San Francisco, United States Duration: Mar 28 1993 → Apr 1 1993

Publication series

Name	IEEE International Conference on Neural Networks - Conference Proceedings
Volume	1993-January
ISSN (Print)	1098-7576

Other

Other	IEEE International Conference on Neural Networks, ICNN 1993
Country/Territory	United States
City	San Francisco
Period	3/28/93 → 4/1/93

ASJC Scopus subject areas

Software

Access to Document

10.1109/ICNN.1993.298730

Cite this

Fast non-linear dimension reduction. / Kambhatla, Nandakishore; Leen, Todd K.
1993 IEEE International Conference on Neural Networks, ICNN 1993. Institute of Electrical and Electronics Engineers Inc., 1993. p. 1213-1218 298730 (IEEE International Conference on Neural Networks - Conference Proceedings; Vol. 1993-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Kambhatla, N & Leen, TK 1993, Fast non-linear dimension reduction. in 1993 IEEE International Conference on Neural Networks, ICNN 1993., 298730, IEEE International Conference on Neural Networks - Conference Proceedings, vol. 1993-January, Institute of Electrical and Electronics Engineers Inc., pp. 1213-1218, IEEE International Conference on Neural Networks, ICNN 1993, San Francisco, United States, 3/28/93. https://doi.org/10.1109/ICNN.1993.298730

@inproceedings{77e7cf28ade8425b8182de5c0529c541,

title = "Fast non-linear dimension reduction",

abstract = "This paper presents a new algorithm for nonlinear dimension reduction. The algorithm builds a piece-wise linear model of the data. This piece-wise linear model provides compression that is superior to the globally linear model produced by principal component analysis. On several examples the piece-wise linear model also provides compression that is superior to the global non-linear model constructed by a five-layer, autoassociative neural network. Furthermore, the new algorithm trains significantly faster than the autoassociative network.",

author = "Nandakishore Kambhatla and Leen, {Todd K.}",

note = "Publisher Copyright: {\textcopyright} 1993 IEEE.; IEEE International Conference on Neural Networks, ICNN 1993 ; Conference date: 28-03-1993 Through 01-04-1993",

year = "1993",

doi = "10.1109/ICNN.1993.298730",

language = "English (US)",

series = "IEEE International Conference on Neural Networks - Conference Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1213--1218",

booktitle = "1993 IEEE International Conference on Neural Networks, ICNN 1993",

}

TY - GEN

T1 - Fast non-linear dimension reduction

AU - Kambhatla, Nandakishore

AU - Leen, Todd K.

PY - 1993

Y1 - 1993

N2 - This paper presents a new algorithm for nonlinear dimension reduction. The algorithm builds a piece-wise linear model of the data. This piece-wise linear model provides compression that is superior to the globally linear model produced by principal component analysis. On several examples the piece-wise linear model also provides compression that is superior to the global non-linear model constructed by a five-layer, autoassociative neural network. Furthermore, the new algorithm trains significantly faster than the autoassociative network.

AB - This paper presents a new algorithm for nonlinear dimension reduction. The algorithm builds a piece-wise linear model of the data. This piece-wise linear model provides compression that is superior to the globally linear model produced by principal component analysis. On several examples the piece-wise linear model also provides compression that is superior to the global non-linear model constructed by a five-layer, autoassociative neural network. Furthermore, the new algorithm trains significantly faster than the autoassociative network.

UR - http://www.scopus.com/inward/record.url?scp=84943245912&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84943245912&partnerID=8YFLogxK

U2 - 10.1109/ICNN.1993.298730

DO - 10.1109/ICNN.1993.298730

M3 - Conference contribution

AN - SCOPUS:84943245912

T3 - IEEE International Conference on Neural Networks - Conference Proceedings

SP - 1213

EP - 1218

BT - 1993 IEEE International Conference on Neural Networks, ICNN 1993

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - IEEE International Conference on Neural Networks, ICNN 1993

Y2 - 28 March 1993 through 1 April 1993

ER -

Fast non-linear dimension reduction

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this