scientific article; zbMATH DE number 2205355
Clustering is to divide data into groups of similar objects so that certain patterns hidden in the data can be made explicit. For example, given a set of web sites a group of people visited, some one might be interested in looking for the surf pattern of this group. Thus, clustering techniques play important roles in data mining and in knowledge discovery. It has been developed into a very important and promising research area with many important applications in statistical analysis, image analysis, pattern recognition. Although many different techniques based on hierarchical analysis, partitioning, density, grid, etc. have been suggested and applied, there does not exist a coherent theoretical foundation. In particular, there does not exist a clear indicator as which one of those techniques should be used in a particular setting, and what criterion should be applied to measure its success. Since different techniques often lead to different results, an apparent question is thus which result you should believe in. This book tries to put an end to this situation by suggesting and arguing that if the data as recovered based on a clustering fits the original data, this clustering is a good one. The closer the fit is, the better. More formally, as the author points out in Section~5.1, given an observed data \(Y,\) \(F(A),\) the data we recover based on the data model \(A\) we use to characterize \(Y,\) should satisfy the following ``underlying equation: \[ Y=F(A)+E, \] where \(E,\) the ``residual caused by such flaws in data sampling, feature selection, and phenomenon modeling, should be minimized. This book then goes through eight chapters to argue why it should be done this way and explain how this can be done. More specifically, the author uses two quite informative introductory chapters to define and discuss some of the general concepts related to clustering, including exemplary problems and various perspective; and table data, including its nature, various features, and main analytical tools. He then, in Chapters~3 and 4, focuses on two of the popular clustering techniques, the \(K\)-means clustering and the Ward hierarchical clustering, since they are both based on statistical analysis, and share the same classifying criterion of least square distance minimization. Using these two techniques as leading examples, the author then presents the general data recovery model as a unifying theme for the clustering field, and other techniques such as principal component analysis in Chapter~5. The rest of the book consists of a discussion of other clustering techniques such as various extensions of the \(K\)-means clustering, fuzzy clustering, soft-organizing maps and expectation-maximization; and further exploration of other related issues such as feature selection, validity and reliability of clusters, approaches of dealing with missing data, options for data pre-processing and standardization, etc., in Chapter~6 and~7, respectively. After going through this book, there is no doubt in my mind that the author knows what he writes. Moreover, a large number\,(58) of examples taken from many different walks of life are used to demonstrate most of the techniques as discussed in the book. A nice feature I particularly like is that at the end of all these examples, a cross reference is given as to where this example will be used later and analyzed, sometimes in as many as 15 different places. This book also contains an extensive bibliography with 142 items, and a useful, two-level, index. On the other hand, this book contains a segment of goals and a list of key concepts, referred to as the \textit{base words,} at the beginning of each chapter, but there are no exercises assigned anywhere in the book. This might make this book less likely to be adopted as a textbook. Nevertheless, this book is definitely a wonderful resource for those who are interested in the topics as to what clustering is and how it should be applied.
- DIVCLUS-T: a monothetic divisive hierarchical clustering method
- Symmetry in data mining and analysis: a unifying view based on hierarchy
- Variance-based cluster selection criteria in a \(K\)-means framework for one-mode dissimilarity data
- Properties of the sample estimators used for statistical normalization of feature vectors
- Monitoring threshold functions over distributed data streams with node dependent constraints
- Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression
- Candidate groups search for K-harmonic means data clustering
- Using projection-based clustering to find distance- and density-based clusters in high-dimensional data
- Biclustering meets triadic concept analysis
- The majority decision function for trees with 3 leaves
- Pattern analysis in parallel coordinates based on pairwise comparison of parameters
- Feature relevance in Ward's hierarchical clustering using the L_p norm
- A convergence theorem for the fuzzy subspace clustering (FSC) algorithm
- Intelligent choice of the number of clusters in K-means clustering: an experimental study with different cluster spreads
- On the parameterized complexity of clustering problems for incomplete data
- Degeneracy on \(K\)-means clustering
- Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization
- Advances in k-means clustering. A data mining thinking.
- On Operations Research and Statistics Techniques: Keys to Quantitative Data Mining
- Clustering. A data recovery approach.
- A method for K-means seeds generation applied to text mining
- Cluster analysis for data mining and system identification.
- scientific article; zbMATH DE number 5343759 (Why is no real title available?)
- VNSOptClust: A Variable Neighborhood Search Based Approach for Unsupervised Anomaly Detection
- Statistical measures of two dimensional point set uniformity
- Book review of: J. Kogan, Introduction to clustering large and high-dimensional data
- Improving spectral bounds for clustering problems by Lagrangian relaxation
- A general framework for efficient clustering of large datasets based on activity detection
- Unsupervised modelling of a transitional boundary layer
- Clustering and maximum likelihood search for efficient statistical classification with medium-sized databases
- Selecting the Minkowski exponent for intelligent K-means with feature weighting
- Thinking ultrametrically, thinking p-adically
- Qualitative modeling of dynamical systems employing continuous-time recurrent fuzzy systems
- Iterative denoising
- Complexity evaluation of benchmark instances for the \(p\)-median problem
- Variable neighborhood search for harmonic means clustering
- Distance-based clustering of mixed data
- A model-based approach for clustering of multivariate semicontinuous data with application to dietary pattern analysis and intervention
- Scalable Clustering: Large Scale Unsupervised Learning of Gaussian Mixture Models with Outliers
- From data completion to problems on hypercubes: a parameterized analysis of the independent set problem
- From data completion to problems on hypercubes: a parameterized analysis of the independent set problem
- Tunnel clustering method
- Leveraging big data and crowdsourced data as auxiliary variables and clustering analysis to enhance the quality of small area estimation models
- Statistical learning of polyhedra volumes from metric features
- Swarm intelligence for self-organized clustering
- Finding cluster centers and sizes via multinomial parameterization
- A new clustering algorithm for coordinate-free data
- SEP/COP: an efficient method to find the best partition in hierarchical clustering based on a new cluster validity index
- Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316730)