Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
From MaRDI portal
Publication:5681016
DOI10.1109/T-C.1971.223083zbMath0264.68040OpenAlexW1972969203MaRDI QIDQ5681016
Publication date: 1971
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/t-c.1971.223083
Related Items
GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING ⋮ A minimum spanning tree equipartition algorithm for microaggregation ⋮ Topology-based signal separation ⋮ Robust MST-Based Clustering Algorithm ⋮ The logical combinatorial approach to pattern recognition, an overview through selected works ⋮ A novel fast heuristic to handle large-scale shape clustering ⋮ Unnamed Item ⋮ Sequential combination methods for data clustering analysis ⋮ A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint ⋮ A novel dynamic minimum spanning tree based clustering method for image mining ⋮ A subexponential algorithm for the coloured tree partition problem ⋮ Clustering with prim's sequential representation of minimum spanning tree ⋮ Data complexity measured by principal graphs ⋮ The MAP test for multimodality ⋮ Polygonizations of point sets in the plane ⋮ Volume constrained 2-phase segmentation method utilizing a linear system solver based on the best uniform polynomial approximation of \(x^{- 1/2}\) ⋮ Clustering by differencing potential of data field ⋮ Minimum Spanning Tree-Resembling algorithm for Clusters, Outliers and Hubs ⋮ Connectivity of the mutual \(k\)-nearest-neighbor graph in clustering and outlier detection ⋮ INTUITIONISTIC FUZZY DENSITY-BASED AGGREGATION OPERATORS AND THEIR APPLICATIONS TO GROUP DECISION MAKING WITH INTUITIONISTIC PREFERENCE RELATIONS ⋮ A graph-theoretical clustering method based on two rounds of minimum spanning trees ⋮ Unnamed Item ⋮ A clustering algorithm based on maximal \(\varTheta\)-distant subtrees ⋮ An adaptive minimum spanning tree test for detecting irregularly-shaped spatial clusters ⋮ Selection of alpha for alpha-hull in \(\mathbb{R}^ 2\) ⋮ Validity studies in clustering methodologies ⋮ The weighted sum of split and diameter clustering ⋮ The dynamic clusters method in nonhierarchical clustering ⋮ Multilayer bootstrap networks ⋮ Unnamed Item ⋮ Pattern classification problems and fuzzy sets ⋮ The relative neighbourhood graph of a finite planar set ⋮ Clusteranalyse - Überblick und neuere Entwicklungen ⋮ Unnamed Item ⋮ Classification by restricted random walks ⋮ A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning ⋮ Quantum speed-up for unsupervised learning ⋮ A method for the analysis of Gaussian-like clusters ⋮ A biased random-key genetic algorithm for data clustering ⋮ An application of the minimal spanning tree approach to the cluster stability problem ⋮ Graph theoretical clustering based on limited neighbourhood sets ⋮ A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree. ⋮ Graph clustering ⋮ Clustering based on multiple paths ⋮ Power spectral clustering ⋮ Multi-way sparsest cut problem on trees with a control on the number of parts and outliers ⋮ Heuristic procedures for the m-partial cover problem on a plane ⋮ CciMST: a clustering algorithm based on minimum spanning tree and cluster centers ⋮ On closest pair in Euclidean metric: monochromatic is as hard as bichromatic ⋮ Image categorization: Graph edit distance \(+\) edge direction histogram ⋮ Fast Constrained Image Segmentation Using Optimal Spanning Trees ⋮ Hierarchizing graph-based image segmentation algorithms relying on region dissimilarity: the case of the Felzenszwalb-Huttenlocher method ⋮ Using raster-based GIS and graph theory to analyze complex networks ⋮ Resistant estimation of multivariate location using minimum spanning trees ⋮ GAKREM: A novel hybrid clustering algorithm ⋮ Search techniques for a nonlinear multiprocessor scheduling problem ⋮ A fast minimum spanning tree algorithm based on \(K\)-means ⋮ An adaptive unsupervised approach toward pixel clustering and color image segmentation ⋮ Semi-supervised statistical region refinement for color image segmentation ⋮ Some applications of graph theory to clustering ⋮ Clustering with \(r\)-regular graphs ⋮ Unnamed Item ⋮ Multivariate image similarity in the compressed domain using statistical graph matching ⋮ Automatically finding clusters in normalized cuts ⋮ Nonlinear dimensionality reduction with hybrid distance for trajectory representation of dynamic texture ⋮ A direct method for cluster analysis ⋮ Maximum sum-of-splits clustering ⋮ Clustering: a neural network approach ⋮ Text independent writer recognition using redundant writing patterns with contour-based orientation and curvature features ⋮ A polynomial algorithm for balanced clustering via graph partitioning ⋮ MBLDA: a novel multiple between-class linear discriminant analysis ⋮ Extending the Power Watershed Framework Thanks to $\Gamma$-Convergence ⋮ On the connectivity of clusters ⋮ The complexity of finding fixed-radius near neighbors ⋮ Agglomerative clustering using the concept of mutual nearest neighbourhood ⋮ Formacion de conjuntos con una variante de las tecnicas “clustering” ⋮ Handwritten chinese text line segmentation by clustering with distance metric learning ⋮ Validity of clusters formed by graph-theoretic cluster methods ⋮ Single-link characteristics of a mode-seeking clustering algorithm ⋮ A multiseed non-hierarchical clustering technique for data analysis ⋮ A heuristic clustering algorithm using union of overlapping pattern- cells ⋮ A sweep-line algorithm for spatial clustering ⋮ Degree Frequencies in the Minimal Spanning Tree and Dimension Identification ⋮ A distance-relatedness dynamic model for clustering high dimensional data of arbitrary shapes and densities ⋮ Sequential minimal optimization in convex clustering repetitions ⋮ A review and proposal of (fuzzy) clustering for nonlinearly separable data ⋮ A Learning Algorithm for the Optimum-Path Forest Classifier ⋮ On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic ⋮ A survey of neighborhood construction algorithms for clustering and classifying data points ⋮ Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree ⋮ Density-based O-Means clustering algorithm using minimum spanning tree ⋮ A density-sensitive hierarchical clustering method ⋮ Some theoretical links between shortest path filters and minimum spanning tree filters ⋮ A graph b-coloring framework for data clustering ⋮ Best data-dependent triangulations ⋮ Statistical analysis of a hierarchical clustering algorithm with outliers ⋮ Clustering, classification and image segmentation on the grid ⋮ Recognition of spatial point patterns ⋮ A weighted framework for unsupervised ensemble learning based on internal quality measures ⋮ Computing connectedness: disconnectedness and discreteness. ⋮ A new approach to clustering data with arbitrary shapes ⋮ Simultaneous fuzzy segmentation of multiple objects ⋮ Efficient spanning trees ⋮ Unsupervised face recognition by associative chaining ⋮ Classic: A hierarchical clustering algorithm based on asymmetric similarities ⋮ Hierarchical clustering of constrained dynamic systems using robust positively invariant sets ⋮ Simultaneous Fuzzy Segmentation of Multiple Objects
