Independent Subspace Analysis Using k-Nearest Neighborhood Distances
Lists
Only you see this
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.
BibTeX
@inproceedings{poczos2005independent,
author = {Barnabás Póczos and András Lörincz},
title = {{Independent Subspace Analysis Using k-Nearest Neighborhood Distances}},
booktitle = {ICANN},
year = {2005},
url = {https://openreview.net/forum?id=z5qZKMD8wj},
}Loading related content...