On a minimal spanning tree approach in the cluster validation problem

MaRDI QIDQ3395295zbMATH OpenFDO

Authors Z. Barzily, Başak Akteke-Öztürk, Z. Volkovich, Gerhard-Wilhelm Weber

Publication date 25 August 2009

zbMATH Keywords

cluster validationclusteringminimal spanning treetwo sample test

Mathematics Subject Classification ID

Data structures (68P05) Pattern recognition, speech recognition (68T10) Nonnumerical algorithms (68W05)

Recommendations

• An application of the minimal spanning tree approach to the cluster stability problem
• A resampling approach to cluster validation
• On an adjacency cluster merit approach
• Stability-Based Validation of Clustering Solutions
• A statistical model of cluster stability

Cited in

(10)

• A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
• Estimating the cluster tree of a density by analyzing the minimal spanning tree of a sample
• Self-learning \(K\)-means clustering: a global optimization approach
• On an adjacency cluster merit approach
• Dynamical gene-environment networks under ellipsoidal uncertainty: set-theoretic regression analysis based on ellipsoidal OR
• Clustering with prim's sequential representation of minimum spanning tree
• On application of a probabilistic K-nearest neighbors model for cluster validation problem
• Resampling approach for cluster model selection
• An application of the minimal spanning tree approach to the cluster stability problem
• A randomized algorithm for estimating the number of clusters

This page was built for publication: On a minimal spanning tree approach in the cluster validation problem

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