Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Hierarchical subtrees agglomerative clustering algorithms

From MaRDI portal
Publication:3411533
Jump to:navigation, search

zbMATH Open1106.68401MaRDI QIDQ3411533FDOQ3411533


Authors: Yujian Li Edit this on Wikidata


Publication date: 11 December 2006





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


zbMATH Keywords

minimal spanning tree


Mathematics Subject Classification ID

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



Cited In (5)

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





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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3411533&oldid=16701705"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 17:53. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki