Mathematical classification and clustering
From MaRDI portal
Publication:2564098
zbMath0874.90198MaRDI QIDQ2564098
Publication date: 7 January 1997
Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)
Inference from spatial processes (62M30) Applications of mathematical programming (90C90) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (78)
Sequential combination methods for data clustering analysis ⋮ Pyramids and weak hierarchies in the ordinal model for clustering ⋮ Robust classifying of prokaryotic genomes ⋮ The \(k\)-weak hierarchical representations: An extension of the indexed closed weak hierarchies ⋮ k-POD: A Method for k-Means Clustering of Missing Data ⋮ 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 ⋮ A method for finding patterns of party support and electoral change: An analysis of British general and Finnish municipal elections ⋮ On similarity ⋮ Cluster analysis and mathematical programming ⋮ Approximate functions in a problem of sets separation ⋮ Sequential clustering with radius and split criteria ⋮ On the random generation and counting of weak order extensions of a poset with given class cardinalities ⋮ Variational algorithms for biclustering models ⋮ Probabilistic Models for Bacterial Taxonomy ⋮ Developing \texttt{Biceps} to completely compute in subquadratic time a new generic type of bicluster in dense and sparse matrices ⋮ Recognition of Robinsonian dissimilarities ⋮ Bi-objective optimization of biclustering with binary data ⋮ Co-clustering algorithms for distributional data with automated variable weighting ⋮ Synergies between operations research and data mining: the emerging use of multi-objective approaches ⋮ Stability-based validation of bicluster solutions ⋮ Triadic formal concept analysis and triclustering: searching for optimal patterns ⋮ Summarizing transactional databases with overlapped hyperrectangles ⋮ Entropy on covers ⋮ Classification based on formal concept analysis and biclustering: possibilities of the approach ⋮ Applying the Gradient Projection Method to a Model of Proportional Membership for Fuzzy Cluster Analysis ⋮ Interactive error correction in implicative theories ⋮ On the metrization of the infinite partition lattice ⋮ Recovering hierarchies in terms of content similarity ⋮ Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering ⋮ Partitional clustering via successive transportation problems ⋮ Local equivalences of distances between clusterings -- a geometric perspective ⋮ Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data ⋮ A hybrid ACO-GRASP algorithm for clustering analysis ⋮ On Robinsonian dissimilarities, the consecutive ones property and latent variable models ⋮ A survey on Mesh Segmentation Techniques ⋮ Partition of a binary matrix into \(k\) (\(k \geq 3\)) exclusive row and column submatrices is difficult ⋮ Noise-free latent block model for high dimensional data ⋮ Data Clustering with Actuarial Applications ⋮ Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder) ⋮ An improved column generation algorithm for minimum sum-of-squares clustering ⋮ Annealing and the normalized \(N\)-cut ⋮ Book review of: B. Goldengorin et al., Cell formation in industrial engineering. Theory, algorithms and experiments ⋮ A hybrid stochastic genetic-GRASP algorithm for clustering analysis ⋮ Unifying Some Association Criteria Between Partitions by Using Relational Matrices ⋮ Biclustering meets triadic concept analysis ⋮ Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices ⋮ New special cases of the quadratic assignment problem with diagonally structured coefficient matrices ⋮ On the random generation of monotone data sets ⋮ Algorithms for the \(q\)-model clustering problem with application in switching cabinet manufacturing ⋮ Unsupervised learning of compositional sparse code for natural image representation ⋮ Nearest neighbours in least-squares data imputation algorithms with different missing patterns ⋮ Nearest neighbour approach in the least-squares data imputation algorithms ⋮ A New Tractable Case of the QAP with a Robinson Matrix ⋮ Clustering Objects on Subsets of Attributes (with Discussion) ⋮ Some refinements of rough \(k\)-means clustering ⋮ Classes and clusters in data analysis ⋮ Unnamed Item ⋮ Evolutionary Rough k-Medoid Clustering ⋮ Fuzzy partition models for fitting a set of partitions ⋮ Bisecting K-means and 1D projection divisive clustering: a unified framework and experimental comparison ⋮ Kernel-based hard clustering methods in the feature space with automatic variable weighting ⋮ Profile likelihood biclustering ⋮ Seriation and matrix reordering methods: An historical overview ⋮ Personnel allocation among bank branches using a two-stage multi-criterial approach. ⋮ Summary and Semi-average Similarity Criteria for Individual Clusters ⋮ Decision reducts and bireducts in a covering approximation space and their relationship to set definability ⋮ Symmetry in data mining and analysis: a unifying view based on hierarchy ⋮ Analytically tractable case of fuzzy c-means clustering ⋮ Ordering properties of the first eigenvector of certain similarity matrices ⋮ Multiset neurons ⋮ A clustering algorithm based on graph connectivity ⋮ Thinking Ultrametrically, Thinking p-Adically ⋮ Nearest Neighbour in Least Squares Data Imputation Algorithms for Marketing Data ⋮ 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
This page was built for publication: Mathematical classification and clustering
