A Graph-Theoretic Approach to Nonparametric Cluster Analysis

DOI10.1109/TC.1976.1674719MaRDI QIDQ4098700zbMATH OpenOpenAlexFDO

Authors Warren L. G. Koontz, Patrenahalli M. Narendra, Keinosuke Fukunaga

Publication date 1976

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1976.1674719

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Algorithms in computer science (68W99)

Cited in

(16)

• Unsupervised space-time clustering using persistent homology
• A heuristic clustering algorithm using union of overlapping pattern- cells
• Implementing Persistence-Based Clustering of Point Clouds in the Topology ToolKit
• Analytical and statistical properties of local depth functions motivated by clustering applications
• Effective image retrieval using dominant color descriptor and fuzzy support vector machine
• Single-link characteristics of a mode-seeking clustering algorithm
• Graph theoretical clustering based on limited neighbourhood sets
• Clustering based on multiple paths
• Genetic clustering for automatic evolution of clusters and application to image classification
• A survey of neighborhood construction algorithms for clustering and classifying data points
• Genetic algorithm for text clustering based on latent semantic indexing
• Agglomerative clustering using the concept of mutual nearest neighbourhood
• Clustering Dynamics on Graphs: From Spectral Clustering to Mean Shift Through Fokker–Planck Interpolation
• A tree-structured framework for purifying ``complex clusters with structural roles of individual data
• Comments on single-link characteristics of a mode-seeking clustering algorithm
• Validity studies in clustering methodologies

This page was built for publication: A Graph-Theoretic Approach to Nonparametric Cluster Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4098700)