Connectivity of the mutual \(k\)-nearest-neighbor graph in clustering and outlier detection
From MaRDI portal
Publication:1365183
DOI10.1016/S0167-7152(96)00213-1zbMath0898.62077MaRDI QIDQ1365183
E. L. Chávez, María Rosa Brito, Joseph E. Yukich, Adolfo J. Quiroz
Publication date: 28 August 1997
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Hypothesis testing in multivariate analysis (62H15)
Related Items (20)
A New Similarity Measure and Its Use in Determining the Number of Clusters in a Multivariate Data Set ⋮ Local contrast as an effective means to robust clustering against varying densities ⋮ Investigation of a new GRASP-based clustering algorithm applied to biological data ⋮ GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING ⋮ Supervised distance preserving projection using alternating direction method of multipliers ⋮ Cluster Identification in Nearest-Neighbor Graphs ⋮ Spectral clustering based on local linear approximations ⋮ Nonlinear Correlation Analysis of Time Series Based on Complex Network Similarity ⋮ A graph-based estimator of the number of clusters ⋮ Localization processes for functional data analysis ⋮ Unnamed Item ⋮ Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters ⋮ Edge integrity of nearest neighbor graphs and separator theorems ⋮ A survey of neighborhood construction algorithms for clustering and classifying data points ⋮ Clustering based on eigenvectors of the adjacency matrix ⋮ A New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter ⋮ Parallel Transport Unfolding: A Connection-Based Manifold Learning Approach ⋮ Hypergraph regularized discriminative nonnegative matrix factorization on sample classification and co-differentially expressed gene selection ⋮ Graph-theoretic procedures for dimension identification ⋮ Nearest neighbors methods for support vector machines
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Agglomerative clustering using the concept of mutual nearest neighbourhood
- Parallel concepts in graph theory
- A Hybrid Clustering Method for Identifying High-Density Clusters
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
This page was built for publication: Connectivity of the mutual \(k\)-nearest-neighbor graph in clustering and outlier detection
