scientific article
From MaRDI portal
Publication:3243608
zbMath0079.16403MaRDI QIDQ3243608
Publication date: 1957
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections, Data complexity measured by principal graphs, Unnamed Item, A survey on feature weighting based K-means algorithms, Soft clustering by convex electoral model, Unnamed Item, A new attempt to identify long-term precursors for endogenous financial crises in the market correlation structures, On the use of the K-means algorithm for determination of mass distributions in dumbbell-like celestial bodies, Model selection strategies for determining the optimal number of overlapping clusters in additive overlapping partitional clustering, Comparing clusterings using combination of the kappa statistic and entropy-based measure, Statistical learning guarantees for compressive clustering and compressive mixture modeling, Efficient two-scale simulations of engineering structures using the Hashin-Shtrikman type finite element method, Strong consistency of \(k\)-parameters clustering, Sparsity enabled cluster reduced-order models for control, The \(k\)-means algorithm for 3D shapes with an application to apparel design, Unsupervised classification of children's bodies using currents, Flexibly regularized mixture models and application to image segmentation, A hybrid MCDM model with Monte Carlo simulation to improve decision-making stability and reliability, Distance geometry and data science, Independence versus indetermination: basis of two canonical clustering criteria, Also for \(k\)-means: more data does not imply better performance, Strategic oscillation for the balanced minimum sum-of-squares clustering problem, Algorithms for searching paths in huge graphs, Sur la représentation d'une population infinie par un nombre fini d'éléments, Identifiability of nonparametric mixture models and Bayes optimal clustering, Spectral clustering and the high-dimensional stochastic blockmodel, Affinity propagation: An exemplar‐based tool for clustering in psychological research, An improved column generation algorithm for minimum sum-of-squares clustering, Cluster-based network model, Using combinatorial optimization in model-based trimmed clustering with cardinality constraints, Optimal vector quantization in terms of Wasserstein distance, An exact algorithm for the two-mode \(KL\)-means partitioning problem, Robust Clustering Algorithms Employing Fuzzy-Possibilistic Product Partition, Building the library of RNA 3D nucleotide conformations using the clustering approach, Note: \(t\) for two (clusters), KFC: A clusterwise supervised learning procedure based on the aggregation of distances, A review on suppressed fuzzy c-means clustering models, Model order reduction of nonlinear homogenization problems using a Hashin-Shtrikman type finite element method, Metric for attractor overlap, Optimal string clustering based on a Laplace-like mixture and EM algorithm on a set of strings, \(K\)-expectiles clustering
