Linear manifold clustering in high dimensional spaces by stochastic search

DOI10.1016/J.PATCOG.2007.01.020MaRDI QIDQ2373462zbMATH OpenOpenAlexFDO

Authors Rave Harpaz, Robert Haralick

Publication date 11 July 2007

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2007.01.020

zbMATH Keywords

clusteringdata explorationhistogram thresholdinglinear manifoldrandom projectionssubspace

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Nonnumerical algorithms (68W05)

Recommendations

• Robust linear clustering
• Subquadratic approximation algorithms for clustering problems in high dimensional spaces
• Subquadratic approximation algorithms for clustering problems in high dimensional spaces
• Generalized density clustering
• Automata, Languages and Programming

Cites work

• Asymptotics of graphical projection pursuit
• scientific article; zbMATH DE number 778109 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)

Cited in

(3)

• Random walk distances in data clustering and applications
• Fast multiscale clustering and manifold identification
• A metric multidimensional scaling-based nonlinear manifold learning approach for unsupervised data reduction

Describes a project that uses

Uses Software

• UCI

This page was built for publication: Linear manifold clustering in high dimensional spaces by stochastic search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373462)