Hierarchical Feature Extraction for Compact Representation and Classification of Datasets

Authors:
Markus Schubert;Jens Kohlmorgen
Affiliations:
Fraunhofer FIRST.IDA, Berlin, Germany 12489;Fraunhofer FIRST.IDA, Berlin, Germany 12489
Venue:
Neural Information Processing
Year:
2007

Citing 5
Cited 0

Algorithms for clustering data

Algorithms for clustering data
A Hierarchical Latent Variable Model for Data Visualization

IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern Classification (2nd Edition)

Pattern Classification (2nd Edition)
Beyond independent components: trees and clusters

The Journal of Machine Learning Research
Probabilistic principal component subspaces: a hierarchical finite mixture model for data visualization

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Feature extraction methods do generally not account for hierarchical structure in the data. For example, PCA and ICA provide transformations that solely depend on global properties of the overall dataset. We here present a general approach for the extraction of feature hierarchies from datasets and their use for classification or clustering. A hierarchy of features extracted from a dataset thereby constitutes a compact representation of the set that on the one hand can be used to characterize and understand the data and on the other hand serves as a basis to classify or cluster a collection of datasets. As a proof of concept, we demonstrate the feasibility of this approach with an application to mixtures of Gaussians with varying degree of structuredness and to a clinical EEG recording.