Graph theoretical clustering based on limited neighbourhood sets

DOI10.1016/0031-3203(82)90069-3zbMath0483.62050MaRDI QIDQ1163319

Roderick Urquhart

Publication date: 1982

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0031-3203(82)90069-3

zbMATH Keywords

pattern recognition; Delaunay triangulation; minimal spanning tree; Gabriel graph; hierarchic clustering; geometrical complexity; region of influence

Mathematics Subject Classification ID

62H30: Classification and discrimination; cluster analysis (statistical aspects)

05C05: Trees

68T10: Pattern recognition, speech recognition

05C99: Graph theory

Related Items

GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING, Semantic fusion of laser and vision in pedestrian detection, A distance-relatedness dynamic model for clustering high dimensional data of arbitrary shapes and densities, Assignment of tools to machines in a flexible manufacturing system, A survey of constrained classification, Classification by restricted random walks, Sequential combination methods for data clustering analysis, Proximity drawings in polynomial area and volume, Clustering with \(r\)-regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Validity studies in clustering methodologies
• The relative neighbourhood graph of a finite planar set
• Agglomerative clustering using the concept of mutual nearest neighbourhood
• Hierarchical clustering schemes
• The structure and construction of taxonomic hierarchies
• Two algorithms for constructing a Delaunay triangulation
• Bicriterion Cluster Analysis
• An Alternative Definition for "Neighborhood of a Point"
• A Graph-Theoretic Approach to Nonparametric Cluster Analysis
• Admissible clustering procedures
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters