Pages that link to "Item:Q5681016"
From MaRDI portal
The following pages link to Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters (Q5681016):
Displayed 50 items.
- Maximum sum-of-splits clustering (Q583774) (← links)
- Validity studies in clustering methodologies (Q600195) (← links)
- Handwritten chinese text line segmentation by clustering with distance metric learning (Q733043) (← links)
- Efficient spanning trees (Q796551) (← links)
- Classic: A hierarchical clustering algorithm based on asymmetric similarities (Q801622) (← links)
- A clustering algorithm based on maximal \(\varTheta\)-distant subtrees (Q869022) (← links)
- Image categorization: Graph edit distance \(+\) edge direction histogram (Q936445) (← links)
- GAKREM: A novel hybrid clustering algorithm (Q955234) (← links)
- A sweep-line algorithm for spatial clustering (Q1009933) (← links)
- A distance-relatedness dynamic model for clustering high dimensional data of arbitrary shapes and densities (Q1015175) (← links)
- A graph b-coloring framework for data clustering (Q1040797) (← links)
- Polygonizations of point sets in the plane (Q1093906) (← links)
- The weighted sum of split and diameter clustering (Q1126399) (← links)
- Pattern classification problems and fuzzy sets (Q1140433) (← links)
- The relative neighbourhood graph of a finite planar set (Q1141155) (← links)
- Clusteranalyse - Überblick und neuere Entwicklungen (Q1144342) (← links)
- A method for the analysis of Gaussian-like clusters (Q1151699) (← links)
- Graph theoretical clustering based on limited neighbourhood sets (Q1163319) (← links)
- Clustering based on multiple paths (Q1167548) (← links)
- Heuristic procedures for the m-partial cover problem on a plane (Q1169687) (← links)
- Some applications of graph theory to clustering (Q1222008) (← links)
- A direct method for cluster analysis (Q1231357) (← links)
- On the connectivity of clusters (Q1244017) (← links)
- The complexity of finding fixed-radius near neighbors (Q1244819) (← links)
- Agglomerative clustering using the concept of mutual nearest neighbourhood (Q1247143) (← links)
- Validity of clusters formed by graph-theoretic cluster methods (Q1251676) (← links)
- Single-link characteristics of a mode-seeking clustering algorithm (Q1253073) (← links)
- A heuristic clustering algorithm using union of overlapping pattern- cells (Q1257314) (← links)
- The MAP test for multimodality (Q1344862) (← links)
- Connectivity of the mutual \(k\)-nearest-neighbor graph in clustering and outlier detection (Q1365183) (← links)
- Selection of alpha for alpha-hull in \(\mathbb{R}^ 2\) (Q1373781) (← links)
- Classification by restricted random walks (Q1402697) (← links)
- A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree. (Q1423266) (← links)
- Best data-dependent triangulations (Q1576443) (← links)
- Computing connectedness: disconnectedness and discreteness. (Q1582062) (← links)
- Sequential combination methods for data clustering analysis (Q1613232) (← links)
- Recognition of spatial point patterns (Q1838328) (← links)
- Unsupervised face recognition by associative chaining (Q1856669) (← links)
- Clustering with \(r\)-regular graphs (Q2270835) (← links)
- A subexponential algorithm for the coloured tree partition problem (Q2370434) (← links)
- A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning (Q2426672) (← links)
- Using raster-based GIS and graph theory to analyze complex networks (Q2463760) (← links)
- Semi-supervised statistical region refinement for color image segmentation (Q2485064) (← links)
- Multivariate image similarity in the compressed domain using statistical graph matching (Q2498683) (← links)
- Clustering, classification and image segmentation on the grid (Q2563647) (← links)
- A new approach to clustering data with arbitrary shapes (Q2568082) (← links)
- Simultaneous fuzzy segmentation of multiple objects (Q2573238) (← links)
- A graph-theoretical clustering method based on two rounds of minimum spanning trees (Q2654240) (← links)
- Resistant estimation of multivariate location using minimum spanning trees (Q2746355) (← links)
- (Q3038421) (← links)