scientific article; zbMATH DE number 3969923
This small monograph provides a descriptive account of the algorithms for clustering and nearest neighbour analysis. Starting from the simple algorithms like the single and complete linkage it extends to contiguity constrained clustering and interaction data. Application of these algorithms to pattern recognition and information storage and retrieval has been indicated. A special feature is the specification of the complexity of computation in terms of the number of steps involved. The relative merits of the algorithms are also touched upon. The monograph is addressed to the computationally oriented worker and succeeds in providing a rapid survey of the recent developments in the algorithms.
- The structure of narrative: The case of film scripts
- The effect of sample size on the extended self-organizing map network -- a market segmentation application
- Symmetry in data mining and analysis: a unifying view based on hierarchy
- ClustGeo: an R package for hierarchical clustering with spatial constraints
- Fast, linear time, m-adic hierarchical clustering for search and retrieval using the Baire metric, with linkages to generalized ultrametrics, hashing, formal concept analysis, and precision of data measurement
- Versatile linkage: a family of space-conserving strategies for agglomerative hierarchical clustering
- Cluster networks and Bruhat-Tits buildings
- Multidimensional clustering and hypergraphs
- \(p\)-adic mathematical physics: the first 30 years
- Hierarchical clustering of asymmetric networks
- Ultrametricity in the theory of complex systems
- The remarkable simplicity of very high dimensional data: application of model-based clustering
- Fast, linear time hierarchical clustering using the Baire metric
- Ward's hierarchical agglomerative clustering method: which algorithms implement Ward's criterion?
- Rhetorical strategy in forensic speeches: multidimensional statistics-based methodology
- Clustering by hypergraphs and dimensionality of cluster systems
- Theoretical Measures of Relative Performance of Classifiers for High Dimensional Data with Small Sample Sizes
- Clustering in the Presence of Scatter
- An Efficient Clustering Algorithm
- A multi-clustering fusion algorithm
- scientific article; zbMATH DE number 764292 (Why is no real title available?)
- Seriation and matrix reordering methods: An historical overview
- Model‐based clustering of regression time series data via APECM—an AECM algorithm sung to an even faster beat
- Thinking ultrametrically, thinking p-adically
- Robust Hierarchical Clustering for Directed Networks: An Axiomatic Approach
- Extending the Kohonen self-organizing map networks for clustering analysis.
- Merging K-means with hierarchical clustering for identifying general-shaped groups
- Multiple change point detection for nonstationary network autoregressive models with node-level dynamics
- Some simple algorithms for structural comparison
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3736743)