Finding the Number of Clusters in a Dataset
From MaRDI portal
Publication:4468489
DOI10.1198/016214503000000666zbMath1046.62064OpenAlexW1973041621WikidataQ57406597 ScholiaQ57406597MaRDI QIDQ4468489
Catherine Sugar, Gareth M. James
Publication date: 10 June 2004
Published in: Journal of the American Statistical Association (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1198/016214503000000666
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Statistical aspects of information-theoretic topics (62B10)
Related Items (70)
Independent Component Analysis for the objective classification of globular clusters of the galaxy NGC 5128 ⋮ Cluster differences unfolding for two-way two-mode preference rating data ⋮ Profiles identification on hierarchical tree structure data sets ⋮ A non-parametric method to estimate the number of clusters ⋮ Estimating robot strengths with application to selection of alliance members in FIRST robotics competitions ⋮ A novel dynamic minimum spanning tree based clustering method for image mining ⋮ Sparse optimal discriminant clustering ⋮ Some clustering-based exact distribution-free \(k\)-sample tests applicable to high dimension, low sample size data ⋮ Intra-day co-movements of crude oil futures: China and the international benchmarks ⋮ Building initial partitions through sampling techniques ⋮ Self-learning \(K\)-means clustering: a global optimization approach ⋮ Determine the number of clusters by data augmentation ⋮ Identification of relevant subtypes via preweighted sparse clustering ⋮ A linguistic approach to classification of bacterial genomes ⋮ Unnamed Item ⋮ Model selection strategies for determining the optimal number of overlapping clusters in additive overlapping partitional clustering ⋮ Multivariate functional data modeling with time-varying clustering ⋮ Finite mixture biclustering of discrete type multivariate data ⋮ Individualized Multidirectional Variable Selection ⋮ Functional data clustering: a survey ⋮ Degrees of freedom and model selection for \(k\)-means clustering ⋮ Simultaneous estimation of cluster number and feature sparsity in high‐dimensional cluster analysis ⋮ Determining the number of clusters using information entropy for mixed data ⋮ A change-point detection and clustering method in the recurrent-event context ⋮ Resampling approach for cluster model selection ⋮ Bad communities with high modularity ⋮ Variance-based cluster selection criteria in a \(K\)-means framework for one-mode dissimilarity data ⋮ A statistical model of cluster stability ⋮ Identifying cluster number for subspace projected functional data clustering ⋮ Penalized cluster analysis with applications to family data ⋮ Determining the Number of Clusters Using Multivariate Ranks ⋮ Active image clustering with pairwise constraints from humans ⋮ Testing for Unobserved Heterogeneity via k-means Clustering ⋮ Selection of the number of clusters via the bootstrap method ⋮ KmL: k-means for longitudinal data ⋮ Clustering nonlinear, nonstationary time series using BSLEX ⋮ An application of the minimal spanning tree approach to the cluster stability problem ⋮ On the number of groups in clustering ⋮ Robust estimation of complicated profiles using wavelets ⋮ A Doubly Enhanced EM Algorithm for Model-Based Tensor Clustering ⋮ Robust estimation of the mean vector for high-dimensional data set using robust clustering ⋮ MCS: A method for finding the number of clusters ⋮ Information theoretic hierarchical clustering ⋮ Comparison of three hypothesis testing approaches for the selection of the appropriate number of clusters of variables ⋮ Estimating the number of clusters via a corrected clustering instability ⋮ Optimising \(k\)-means clustering results with standard software packages ⋮ Clustering confidence sets ⋮ Exploring the number of groups in robust model-based clustering ⋮ A computational study of a nonlinear minsum facility location problem ⋮ Vector quantization of amino acids: Analysis of the HIV V3 loop region ⋮ Yield and price forecasting for stochastic crop decision planning ⋮ A parametric \(k\)-means algorithm ⋮ Determining the Number of Clusters Using the Weighted Gap Statistic ⋮ Flexible parametric bootstrap for testing homogeneity against clustering and assessing the number of clusters ⋮ Selecting among multi-mode partitioning models of different complexities: a comparison of four model selection criteria ⋮ Finding standard dental arch forms from a nationwide standard occlusion study using a Gaussian functional mixture model ⋮ An efficient k‐means‐type algorithm for clustering datasets with incomplete records ⋮ A confusion index for measuring separation and clustering ⋮ Robust and sparse \(k\)-means clustering for high-dimensional data ⋮ Estimating the number of clusters in a ranking data context ⋮ A new nonparametric interpoint distance-based measure for assessment of clustering ⋮ Estimating the Number of Clusters Using Cross-Validation ⋮ Prokaryote clustering based on DNA curvature distributions ⋮ Mathematical methods in biomedical imaging ⋮ On Application of a ProbabilisticK-Nearest Neighbors Model for Cluster Validation Problem ⋮ On the behaviour of \(K\)-means clustering of a dissimilarity matrix by means of full multidimensional scaling ⋮ A randomized algorithm for estimating the number of clusters ⋮ Clustering and forecasting multiple functional time series ⋮ IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem ⋮ Intelligent choice of the number of clusters in \(K\)-means clustering: an experimental study with different cluster spreads
This page was built for publication: Finding the Number of Clusters in a Dataset