Independent Subspace Analysis Using k-Nearest Neighborhood Distances
- Cite this paper as:
- Póczos B., Lőrincz A. (2005) Independent Subspace Analysis Using k-Nearest Neighborhood Distances. In: Duch W., Kacprzyk J., Oja E., Zadrożny S. (eds) Artificial Neural Networks: Formal Models and Their Applications – ICANN 2005. ICANN 2005. Lecture Notes in Computer Science, vol 3697. Springer, Berlin, Heidelberg
A novel algorithm called independent subspace analysis (ISA) is introduced to estimate independent subspaces. The algorithm solves the ISA problem by estimating multi-dimensional differential entropies. Two variants are examined, both of them utilize distances between the k-nearest neighbors of the sample points. Numerical simulations demonstrate the usefulness of the algorithms.
Unable to display preview. Download preview PDF.