Mathematical classification and clustering
To write a book about classification and clustering is not an easy task. There is the fact that the whole world is organized through clusters: scientific knowledge is based on concepts which are ideal clusters; laws are applicable to groups of people satisfying certain conditions, i.e. clusters; social life is organized in classes or clusters. With these facts in mind the author gives an overall analysis and view of classification and cluster theory. He starts with an enumeration and definitions of the different forms of classifications, followed by the types of data. The central part of the book presents and classifies all the different forms of algorithms, useful for someone looking for the best technique to solve a particular problem. The three main techniques, `subset', `partition' and `hierarchy', are studied in depth in three different chapters. Here, all aspects of the methods are analysed and supplemented with useful statements and demonstrations. Many numerical examples illustrate the behaviour of the algorithms, proper to each method. The different chapters are well written, with adequate subdivisions for the different aspects of the subjects. Clearly visible frames surround the most important statements that the author wants to stress and many subdivisions close with a few discussion points. This makes the book pleasant and efficient to read. One regret: only little attention is paid to most recently developed classes of techniques such as fuzzy clustering and scattering matrix based methods. Overall it should be emphasized that this book is a monumental work with a large treasure of information. It certainly contains one of the most complete compilation of classification and clustering methods together with all relevant technical and theoretical explanations. The author should be praised for this most interesting work.
- scientific article; zbMATH DE number 1222269
- scientific article; zbMATH DE number 848149
- Mathematics of data science. A computational approach to clustering and classification
- Cluster analysis and mathematical programming
- Classifying clustering schemes
- scientific article; zbMATH DE number 4007495
- Recent advances in mathematical programming for classification and cluster analysis
- Statistical theory in clustering
- Cluster Analysis and Applications
- scientific article; zbMATH DE number 3899973
- Symmetry in data mining and analysis: a unifying view based on hierarchy
- Cluster analysis and mathematical programming
- Recognition of Robinsonian dissimilarities
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- A clustering algorithm based on graph connectivity
- Sequential combination methods for data clustering analysis
- Pyramids and weak hierarchies in the ordinal model for clustering
- Variational algorithms for biclustering models
- Partition of a binary matrix into \(k\) (\(k \geq 3\)) exclusive row and column submatrices is difficult
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices
- Nearest neighbour approach in the least-squares data imputation algorithms
- Personnel allocation among bank branches using a two-stage multi-criterial approach.
- The k-weak hierarchical representations: An extension of the indexed closed weak hierarchies
- Synergies between operations research and data mining: the emerging use of multi-objective approaches
- Towards a general theory of classifications
- Classification based on formal concept analysis and biclustering: possibilities of the approach
- Multiset neurons
- On similarity
- Developing \texttt{Biceps} to completely compute in subquadratic time a new generic type of bicluster in dense and sparse matrices
- Noise-free latent block model for high dimensional data
- Biclustering meets triadic concept analysis
- Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices
- Nearest neighbours in least-squares data imputation algorithms with different missing patterns
- Profile likelihood biclustering
- Decision reducts and bireducts in a covering approximation space and their relationship to set definability
- Ordering properties of the first eigenvector of certain similarity matrices
- Robust classifying of prokaryotic genomes
- A method for finding patterns of party support and electoral change: An analysis of British general and Finnish municipal elections
- On Robinsonian dissimilarities, the consecutive ones property and latent variable models
- Annealing and the normalized N-cut
- Algorithms for the \(q\)-model clustering problem with application in switching cabinet manufacturing
- Some refinements of rough \(k\)-means clustering
- Classes and clusters in data analysis
- Fuzzy partition models for fitting a set of partitions
- Analytically tractable case of fuzzy c-means clustering
- Intelligent choice of the number of clusters in K-means clustering: an experimental study with different cluster spreads
- FINDCLUS: fuzzy individual differences clustering
- Block-relaxation approaches for fitting the INDCLUS model
- Bi-objective optimization of biclustering with binary data
- Co-clustering algorithms for distributional data with automated variable weighting
- scientific article; zbMATH DE number 1674018 (Why is no real title available?)
- Summary and semi-average similarity criteria for individual clusters
- Applying the gradient projection method to a model of proportional membership for fuzzy cluster analysis
- scientific article; zbMATH DE number 2125804 (Why is no real title available?)
- scientific article; zbMATH DE number 3888936 (Why is no real title available?)
- scientific article; zbMATH DE number 3852234 (Why is no real title available?)
- Approximate functions in a problem of sets separation
- Sequential clustering with radius and split criteria
- A survey on Mesh Segmentation Techniques
- Unifying some association criteria between partitions by using relational matrices
- Evolutionary Rough k-Medoid Clustering
- scientific article; zbMATH DE number 3936253 (Why is no real title available?)
- scientific article; zbMATH DE number 33710 (Why is no real title available?)
- Summarizing transactional databases with overlapped hyperrectangles
- Entropy on covers
- Local equivalences of distances between clusterings -- a geometric perspective
- scientific article; zbMATH DE number 1222269 (Why is no real title available?)
- Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
- An efficient and effective generic agglomerative hierarchical clustering approach
- Clustering Objects on Subsets of Attributes (with Discussion)
- Probabilistic Models for Bacterial Taxonomy
- scientific article; zbMATH DE number 848149 (Why is no real title available?)
- Clustering. Theoretical and practical aspects
- Seriation and matrix reordering methods: An historical overview
- Book review of: B. Goldengorin et al., Cell formation in industrial engineering. Theory, algorithms and experiments
- Data clustering with actuarial applications
- Mathematics of data science. A computational approach to clustering and classification
- Thinking ultrametrically, thinking p-adically
- Nearest neighbour in least squares data imputation algorithms for marketing data
- Unsupervised learning of compositional sparse code for natural image representation
- A new tractable case of the QAP with a Robinson matrix
- k-POD: A Method for k-Means Clustering of Missing Data
- Bisecting K-means and 1D projection divisive clustering: a unified framework and experimental comparison
- Stability-based validation of bicluster solutions
- On the metrization of the infinite partition lattice
- Recovering hierarchies in terms of content similarity
- Partitional clustering via successive transportation problems
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
- A hybrid ACO-GRASP algorithm for clustering analysis
- A note on clustering aggregation for binary clusterings
- The cluster D-trace loss for differential network analysis
- An improved column generation algorithm for minimum sum-of-squares clustering
- Robust asymmetric non-negative matrix factorization for clustering nodes in directed networks
- A logic with probabilistic Jaccard similarity
- Fault-tolerant k-supplier with outliers
- Interrelating neuronal morphology by coincidence similarity networks
- A penalized criterion for selecting the number of clusters for K-medians
- Boolean matrix factorization in the framework of formal concept analysis with the help of biclustering
- BRKGA applied to the cluster ensemble problem
- Kernel-based hard clustering methods in the feature space with automatic variable weighting
- Clustering for time-varying relational count data
- Multi-objective biclustering: When non-dominated solutions are not enough
- Evolution of the population of a genetic algorithm using particle swarm optimization: application to clustering analysis
- On the random generation and counting of weak order extensions of a poset with given class cardinalities
- Triadic formal concept analysis and triclustering: searching for optimal patterns
- Interactive error correction in implicative theories
- A hybrid stochastic genetic-GRASP algorithm for clustering analysis
- On the random generation of monotone data sets
This page was built for publication: Mathematical classification and clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2564098)
