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