Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters

Cited in

(only showing first 100 items - show all)

A sweep-line algorithm for spatial clustering
A distance-relatedness dynamic model for clustering high dimensional data of arbitrary shapes and densities
A graph b-coloring framework for data clustering
Polygonizations of point sets in the plane
The weighted sum of split and diameter clustering
Pattern classification problems and fuzzy sets
The relative neighbourhood graph of a finite planar set
Clusteranalyse - Überblick und neuere Entwicklungen
A method for the analysis of Gaussian-like clusters
Graph theoretical clustering based on limited neighbourhood sets
Clustering based on multiple paths
Heuristic procedures for the m-partial cover problem on a plane
Some applications of graph theory to clustering
A direct method for cluster analysis
On the connectivity of clusters
The complexity of finding fixed-radius near neighbors
Agglomerative clustering using the concept of mutual nearest neighbourhood
Validity of clusters formed by graph-theoretic cluster methods
Single-link characteristics of a mode-seeking clustering algorithm
A heuristic clustering algorithm using union of overlapping pattern- cells
The MAP test for multimodality
Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection
Selection of alpha for alpha-hull in \(\mathbb{R}^ 2\)
Classification by restricted random walks
A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
Best data-dependent triangulations
Computing connectedness: disconnectedness and discreteness.
Sequential combination methods for data clustering analysis
Clustering by differencing potential of data field
An adaptive minimum spanning tree test for detecting irregularly-shaped spatial clusters
CciMST: a clustering algorithm based on minimum spanning tree and cluster centers
Clustering: a neural network approach
Recognition of spatial point patterns
Unsupervised face recognition by associative chaining
Quantum speed-up for unsupervised learning
Hierarchizing graph-based image segmentation algorithms relying on region dissimilarity: the case of the Felzenszwalb-Huttenlocher method
A polynomial algorithm for balanced clustering via graph partitioning
A survey of neighborhood construction algorithms for clustering and classifying data points
Statistical analysis of a hierarchical clustering algorithm with outliers
Hierarchical clustering of constrained dynamic systems using robust positively invariant sets
A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint
Multilayer bootstrap networks
Power spectral clustering
Multi-way sparsest cut problem on trees with a control on the number of parts and outliers
On closest pair in Euclidean metric: monochromatic is as hard as bichromatic
Clustering with \(r\)-regular graphs
MBLDA: a novel multiple between-class linear discriminant analysis
A review and proposal of (fuzzy) clustering for nonlinearly separable data
A density-sensitive hierarchical clustering method
Some theoretical links between shortest path filters and minimum spanning tree filters
A weighted framework for unsupervised ensemble learning based on internal quality measures
A subexponential algorithm for the coloured tree partition problem
A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning
A biased random-key genetic algorithm for data clustering
Using raster-based GIS and graph theory to analyze complex networks
Semi-supervised statistical region refinement for color image segmentation
Multivariate image similarity in the compressed domain using statistical graph matching
Clustering, classification and image segmentation on the grid
A new approach to clustering data with arbitrary shapes
Simultaneous fuzzy segmentation of multiple objects
Data complexity measured by principal graphs
A graph-theoretical clustering method based on two rounds of minimum spanning trees
Resistant estimation of multivariate location using minimum spanning trees
Density-based O-means clustering algorithm using minimum spanning tree
A novel dynamic minimum spanning tree based clustering method for image mining
Clustering with prim's sequential representation of minimum spanning tree
scientific article; zbMATH DE number 3833120 (Why is no real title available?)
Volume constrained 2-phase segmentation method utilizing a linear system solver based on the best uniform polynomial approximation of \(x^{- 1/2}\)
Intuitionistic fuzzy density-based aggregation operators and their applications to group decision making with intuitionistic preference relations
The dynamic clusters method in nonhierarchical clustering
Fast Constrained Image Segmentation Using Optimal Spanning Trees
Search techniques for a nonlinear multiprocessor scheduling problem
Simultaneous Fuzzy Segmentation of Multiple Objects
A Learning Algorithm for the Optimum-Path Forest Classifier
Formacion de conjuntos con una variante de las tecnicas “clustering”
An application of the minimal spanning tree approach to the cluster stability problem
Degree Frequencies in the Minimal Spanning Tree and Dimension Identification
An efficient and effective generic agglomerative hierarchical clustering approach
Graph clustering
Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree
Extending the Power Watershed Framework Thanks to \Gamma-Convergence
A multiseed non-hierarchical clustering technique for data analysis
Kernel-estimated nonparametric overlap-based syncytial clustering
Sequential minimal optimization in convex clustering repetitions
scientific article; zbMATH DE number 7370554 (Why is no real title available?)
Minimum Spanning Tree-Resembling algorithm for Clusters, Outliers and Hubs
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
A minimum spanning tree equipartition algorithm for microaggregation
Robust MST-based clustering algorithm
Consensus clustering with differential evolution
A novel fast heuristic to handle large-scale shape clustering
A fast minimum spanning tree algorithm based on \(K\)-means
GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
Topology-based signal separation
Maximum sum-of-splits clustering
The logical combinatorial approach to pattern recognition, an overview through selected works
Validity studies in clustering methodologies
Identification of spatial defects in semiconductor manufacturing
Outlier detection in network revenue management
Connecting the world efficiently

This page was built for publication: Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters

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