Direct reading algorithm for hierarchical clustering (Q509277): Difference between revisions

@@ Property / DOI @@
-.1016/j.endm.2016.11.006
@@ Property / DOI: 10.1016/j.endm.2016.11.006 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2016.11.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2559377253
@@ Property / OpenAlex ID: W2559377253 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast, linear time hierarchical clustering using the Baire metric
+Normal rank
@@ Property / cites work @@
+Hierarchical trees can be perfectly scaled in one dimension
+Normal rank
@@ Property / cites work @@
+Seriation and matrix reordering methods: An historical overview
+Normal rank
@@ Property / cites work @@
+Least squares quantization in PCM
@@ Property / cites work: Least squares quantization in PCM / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetry in data mining and analysis: a unifying view based on hierarchy
+Normal rank
@@ Property / cites work @@
+Hierarchical Clustering of Massive, High Dimensional Data Sets by Exploiting Ultrametric Embedding
+Normal rank
@@ Property / DOI @@
+.1016/J.ENDM.2016.11.006
@@ Property / DOI: 10.1016/J.ENDM.2016.11.006 / rank @@
+Normal rank