Graph theoretical clustering based on limited neighbourhood sets

DOI10.1016/0031-3203(82)90069-3zbMath0483.62050OpenAlexW2003004389MaRDI 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 recognitionDelaunay triangulationminimal spanning treeGabriel graphhierarchic clusteringgeometrical complexityregion of influence

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Trees (05C05) Pattern recognition, speech recognition (68T10) Graph theory (05C99)

Related Items (12)

Sequential combination methods for data clustering analysis ⋮ Proximity drawings in polynomial area and volume ⋮ Volume constrained 2-phase segmentation method utilizing a linear system solver based on the best uniform polynomial approximation of \(x^{- 1/2}\) ⋮ A survey of constrained classification ⋮ GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING ⋮ Assignment of tools to machines in a flexible manufacturing system ⋮ Classification by restricted random walks ⋮ Fast Constrained Image Segmentation Using Optimal Spanning Trees ⋮ Clustering with \(r\)-regular graphs ⋮ Semantic fusion of laser and vision in pedestrian detection ⋮ A distance-relatedness dynamic model for clustering high dimensional data of arbitrary shapes and densities ⋮ A survey of neighborhood construction algorithms for clustering and classifying data points

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

This page was built for publication: Graph theoretical clustering based on limited neighbourhood sets