Chapter

Artificial Neural Networks: Formal Models and Their Applications – ICANN 2005

Volume 3697 of the series Lecture Notes in Computer Science pp 163-168

Independent Subspace Analysis Using k-Nearest Neighborhood Distances

  • Barnabás PóczosAffiliated withDepartment of Information Systems, Eötvös Loránd University, Research Group on Intelligent Information Systems, Hungarian Academy of Sciences
  • , András LőrinczAffiliated withDepartment of Information Systems, Eötvös Loránd University, Research Group on Intelligent Information Systems, Hungarian Academy of Sciences

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.