Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
From MaRDI portal
Cited in
(only showing first 100 items - show all)- The complexity of finding fixed-radius near neighbors
- Simultaneous fuzzy segmentation of multiple objects
- Statistical analysis of a hierarchical clustering algorithm with outliers
- A graph-theoretical clustering method based on two rounds of minimum spanning trees
- Unsupervised face recognition by associative chaining
- A density-sensitive hierarchical clustering method
- CciMST: a clustering algorithm based on minimum spanning tree and cluster centers
- Quantum speed-up for unsupervised learning
- The relative neighbourhood graph of a finite planar set
- The logical combinatorial approach to pattern recognition, an overview through selected works
- Clusteranalyse - Überblick und neuere Entwicklungen
- Efficient spanning trees
- A review and proposal of (fuzzy) clustering for nonlinearly separable data
- On the connectivity of clusters
- A fast minimum spanning tree algorithm based on \(K\)-means
- The weighted sum of split and diameter clustering
- Simultaneous Fuzzy Segmentation of Multiple Objects
- Clustering with \(r\)-regular graphs
- Fast minimum spanning tree clustering algorithm based on granular-ball computing
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
- Consensus clustering with differential evolution
- An efficient and effective generic agglomerative hierarchical clustering approach
- Hierarchical clustering of constrained dynamic systems using robust positively invariant sets
- Multi-way sparsest cut problem on trees with a control on the number of parts and outliers
- A weighted framework for unsupervised ensemble learning based on internal quality measures
- MBLDA: a novel multiple between-class linear discriminant analysis
- A novel dynamic minimum spanning tree based clustering method for image mining
- Multivariate image similarity in the compressed domain using statistical graph matching
- Power spectral clustering
- Some theoretical links between shortest path filters and minimum spanning tree filters
- Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection
- Fast Constrained Image Segmentation Using Optimal Spanning Trees
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic
- A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning
- Sequential minimal optimization in convex clustering repetitions
- A biased random-key genetic algorithm for data clustering
- Search techniques for a nonlinear multiprocessor scheduling problem
- A polynomial algorithm for balanced clustering via graph partitioning
- Sequential combination methods for data clustering analysis
- scientific article; zbMATH DE number 7255153 (Why is no real title available?)
- Degree Frequencies in the Minimal Spanning Tree and Dimension Identification
- Topology-based signal separation
- Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree
- A distance-relatedness dynamic model for clustering high dimensional data of arbitrary shapes and densities
- Identification of spatial defects in semiconductor manufacturing
- Outlier detection in network revenue management
- Clustering with minimum spanning trees: how good can it be?
- Image categorization: Graph edit distance \(+\) edge direction histogram
- A Learning Algorithm for the Optimum-Path Forest Classifier
- Classic: A hierarchical clustering algorithm based on asymmetric similarities
- Text independent writer recognition using redundant writing patterns with contour-based orientation and curvature features
- A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint
- Best data-dependent triangulations
- Data complexity measured by principal graphs
- Clustering with prim's sequential representation of minimum spanning tree
- Minimum Spanning Tree-Resembling algorithm for Clusters, Outliers and Hubs
- Maximum sum-of-splits clustering
- scientific article; zbMATH DE number 3833120 (Why is no real title available?)
- A minimum spanning tree equipartition algorithm for microaggregation
- A direct method for cluster analysis
- Handwritten chinese text line segmentation by clustering with distance metric learning
- Validity studies in clustering methodologies
- Clustering by differencing potential of data field
- Formacion de conjuntos con una variante de las tecnicas “clustering”
- Hierarchizing graph-based image segmentation algorithms relying on region dissimilarity: the case of the Felzenszwalb-Huttenlocher method
- Clustering, classification and image segmentation on the grid
- Extending the Power Watershed Framework Thanks to \Gamma-Convergence
- Volume constrained 2-phase segmentation method utilizing a linear system solver based on the best uniform polynomial approximation of \(x^{- 1/2}\)
- Computing connectedness: disconnectedness and discreteness.
- A method for the analysis of Gaussian-like clusters
- A sweep-line algorithm for spatial clustering
- A clustering algorithm based on maximal \(\varTheta\)-distant subtrees
- Density-based O-means clustering algorithm using minimum spanning tree
- Recognition of spatial point patterns
- Semi-supervised statistical region refinement for color image segmentation
- An application of the minimal spanning tree approach to the cluster stability problem
- An improved active contour model based on Finsler -Laplacian
- Automatically finding clusters in normalized cuts
- A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
- Heuristic procedures for the m-partial cover problem on a plane
- A subexponential algorithm for the coloured tree partition problem
- Pattern classification problems and fuzzy sets
- The MAP test for multimodality
- An adaptive unsupervised approach toward pixel clustering and color image segmentation
- An adaptive minimum spanning tree test for detecting irregularly-shaped spatial clusters
- Some applications of graph theory to clustering
- Single-link characteristics of a mode-seeking clustering algorithm
- Validity of clusters formed by graph-theoretic cluster methods
- Finer-grained reductions in fine-grained hardness of approximation
- Resistant estimation of multivariate location using minimum spanning trees
- Clustering based on multiple paths
- Using raster-based GIS and graph theory to analyze complex networks
- Classification by restricted random walks
- A heuristic clustering algorithm using union of overlapping pattern- cells
- Agglomerative clustering using the concept of mutual nearest neighbourhood
- Robust MST-based clustering algorithm
- Graph theoretical clustering based on limited neighbourhood sets
- Intuitionistic fuzzy density-based aggregation operators and their applications to group decision making with intuitionistic preference relations
- Selection of alpha for alpha-hull in \(\mathbb{R}^ 2\)
- A multiseed non-hierarchical clustering technique for data analysis
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)