On Some Clustering Techniques
From MaRDI portal
Publication:5725073
DOI10.1147/rd.81.0022zbMath0116.09705OpenAlexW2008427435MaRDI QIDQ5725073
Publication date: 1964
Published in: IBM Journal of Research and Development (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1147/rd.81.0022
Related Items
A recursive Lagrangian method for clustering problems ⋮ Validity studies in clustering methodologies ⋮ The dynamic clusters method in nonhierarchical clustering ⋮ A clique-detection algorithm based on neighborhoods in graphs ⋮ Cluster‐based gradient method for stochastic optimal control problems with elliptic partial differential equation constraint ⋮ DDCAL: evenly distributing data into low variance clusters based on iterative feature scaling ⋮ A graph‐theoretic definition of a sociometric clique† ⋮ Using projection-based clustering to find distance- and density-based clusters in high-dimensional data ⋮ Some applications of graph theory to clustering ⋮ Nonmetric grouping: clusters and cliques ⋮ On the connectivity of clusters ⋮ An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique ⋮ Some statistical methods in machine intelligence research ⋮ A model for taxonomy. II ⋮ On the use of complete subgraphs in cluster analysis ⋮ Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection ⋮ A stratificational overlapping cluster scheme ⋮ Constructing optimal ultrametrics ⋮ The maximum clique problem
