Sur la liaison et la division des points d'un ensemble fini
From MaRDI portal
Publication:5810356
DOI10.4064/cm-2-3-4-282-285zbMath0045.26103OpenAlexW1270205671MaRDI QIDQ5810356
Publication date: 1951
Published in: Colloquium Mathematicum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/cm-2-3-4-282-285
Related Items (19)
SingleCross-clustering: an algorithm for finding elongated clusters with automatic estimation of outliers and number of clusters ⋮ Determinantal consensus clustering ⋮ Consensus and fuzzy partition of dendrograms from a three-way dissimilarity array ⋮ A novel specialized single-linkage clustering algorithm for taxonomically ordered data ⋮ Relation-algebraic verification of Borůvka's minimum spanning tree algorithm ⋮ The saga of minimum spanning trees ⋮ Analysis of agglomerative clustering ⋮ Data Clustering with Actuarial Applications ⋮ Using projection-based clustering to find distance- and density-based clusters in high-dimensional data ⋮ A fast minimum spanning tree algorithm based on \(K\)-means ⋮ Combinatorial optimisation and hierarchical classifications ⋮ Hierarchical clustering with optimal transport ⋮ From hypertrees to arboreal quasi-ultrametrics ⋮ Sub-dominant theory in numerical taxonomy ⋮ Swarm intelligence for self-organized clustering ⋮ Validity of clusters formed by graph-theoretic cluster methods ⋮ Classification and specification of flat cluster methods ⋮ Principal component analysis and clustering on manifolds ⋮ Approximating dissimilarities by quasi-ultrametrics
This page was built for publication: Sur la liaison et la division des points d'un ensemble fini
