Hierarchical subtrees agglomerative clustering algorithms

MaRDI QIDQ3411533zbMATH OpenFDO

Authors Yujian Li

Publication date 11 December 2006

zbMATH Keywords

minimal spanning tree

Mathematics Subject Classification ID

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

Recommendations

• Fast hierarchical clustering and its validation
• Geometric algorithms for agglomerative hierarchical clustering
• Euro-Par 2004 Parallel Processing
• scientific article; zbMATH DE number 894865
• A New Agglomerative 2–3 Hierarchical Clustering Algorithm

Cited in

(5)

• Clustering in trees: Optimizing cluster sizes and number of subtrees
• Hierarchical adaptive clustering
• Aggregation tree construction using hierarchical structures
• Solving non-uniqueness in agglomerative hierarchical clustering using multidendrograms
• A clustering algorithm based on maximal \(\varTheta\)-distant subtrees

This page was built for publication: Hierarchical subtrees agglomerative clustering algorithms

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