TY - JOUR

T1 - Constrained topological mapping for nonparametric regression analysis

AU - Cherkassky, Vladimir S

AU - Lari-Najafi, Hossein

PY - 1991

Y1 - 1991

N2 - The idea of using Kohonen's self-organizing maps is applied to the problem of nonparametric regression analysis, that is, evaluation (approximation) of the unknown function of N-1 variables given a number of data points (possibly corrupted by random noise) in N-dimensional input space. Simple examples show that the original Kohonen's algorithm performs poorly for regression problems of even low dimensionality, due to the fact that topologically correct ordering of units in N-dimensional space may violate the natural topological ordering of projections of those units onto (N-1)-dimensional subspace of independent variables. A modification of the original algorithm called the constrained topological mapping algorithm is proposed for regression analysis applications. Given a number of data points in N-dimensional input space, the proposed algorithm performs correct topological mapping of units (as the original algorithm) and at the same time preserves topological ordering of projections of these units onto (N-1)-dimensional subspace of independent coordinates. Simulation examples illustrate good performance (i.e., accuracy, convergence) of the proposed algorithm for approximating 2- and 3-variable functions. Moreover, for multivariate problems the proposed neural approach may alleviate "the curse of dimensionality," that is, reduce the size of the training set required for evaluation of the unknown function (of many variables), by increasing the number of units (knots) in the topological map.

AB - The idea of using Kohonen's self-organizing maps is applied to the problem of nonparametric regression analysis, that is, evaluation (approximation) of the unknown function of N-1 variables given a number of data points (possibly corrupted by random noise) in N-dimensional input space. Simple examples show that the original Kohonen's algorithm performs poorly for regression problems of even low dimensionality, due to the fact that topologically correct ordering of units in N-dimensional space may violate the natural topological ordering of projections of those units onto (N-1)-dimensional subspace of independent variables. A modification of the original algorithm called the constrained topological mapping algorithm is proposed for regression analysis applications. Given a number of data points in N-dimensional input space, the proposed algorithm performs correct topological mapping of units (as the original algorithm) and at the same time preserves topological ordering of projections of these units onto (N-1)-dimensional subspace of independent coordinates. Simulation examples illustrate good performance (i.e., accuracy, convergence) of the proposed algorithm for approximating 2- and 3-variable functions. Moreover, for multivariate problems the proposed neural approach may alleviate "the curse of dimensionality," that is, reduce the size of the training set required for evaluation of the unknown function (of many variables), by increasing the number of units (knots) in the topological map.

KW - Constrained topological mapping

KW - Curse of dimensionality

KW - Nonparametric regression

KW - Self-organization

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

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

U2 - 10.1016/0893-6080(91)90028-4

DO - 10.1016/0893-6080(91)90028-4

M3 - Article

AN - SCOPUS:0026097068

VL - 4

SP - 27

EP - 40

JO - Neural Networks

JF - Neural Networks

SN - 0893-6080

IS - 1

ER -