The following pages link to (Q3243608):
Displayed 41 items.
- A survey on feature weighting based K-means algorithms (Q333337) (← links)
- Strong consistency of \(k\)-parameters clustering (Q391580) (← links)
- Optimal vector quantization in terms of Wasserstein distance (Q550175) (← links)
- Spectral clustering and the high-dimensional stochastic blockmodel (Q651016) (← links)
- An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
- Building the library of RNA 3D nucleotide conformations using the clustering approach (Q747556) (← links)
- Algorithms for searching paths in huge graphs (Q906255) (← links)
- Using combinatorial optimization in model-based trimmed clustering with cardinality constraints (Q962299) (← links)
- Sparsity enabled cluster reduced-order models for control (Q1683852) (← links)
- A review on suppressed fuzzy c-means clustering models (Q2061300) (← links)
- \(K\)-expectiles clustering (Q2078530) (← links)
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections (Q2131141) (← links)
- Soft clustering by convex electoral model (Q2156895) (← links)
- Model selection strategies for determining the optimal number of overlapping clusters in additive overlapping partitional clustering (Q2169873) (← links)
- Comparing clusterings using combination of the kappa statistic and entropy-based measure (Q2175381) (← links)
- Distance geometry and data science (Q2192022) (← links)
- Identifiability of nonparametric mixture models and Bayes optimal clustering (Q2215737) (← links)
- Note: \(t\) for two (clusters) (Q2304084) (← links)
- Model order reduction of nonlinear homogenization problems using a Hashin-Shtrikman type finite element method (Q2310200) (← links)
- Optimal string clustering based on a Laplace-like mixture and EM algorithm on a set of strings (Q2323348) (← links)
- The \(k\)-means algorithm for 3D shapes with an application to apparel design (Q2418258) (← links)
- Unsupervised classification of children's bodies using currents (Q2418364) (← links)
- Data complexity measured by principal graphs (Q2629455) (← links)
- Statistical learning guarantees for compressive clustering and compressive mixture modeling (Q2664825) (← links)
- Efficient two-scale simulations of engineering structures using the Hashin-Shtrikman type finite element method (Q2665026) (← links)
- Sur la représentation d'une population infinie par un nombre fini d'éléments (Q3270960) (← links)
- KFC: A clusterwise supervised learning procedure based on the aggregation of distances (Q3389603) (← links)
- On the use of the K-means algorithm for determination of mass distributions in dumbbell-like celestial bodies (Q4568591) (← links)
- Affinity propagation: An exemplar‐based tool for clustering in psychological research (Q4627522) (← links)
- (Q4969037) (← links)
- A new attempt to identify long-term precursors for endogenous financial crises in the market correlation structures (Q5078664) (← links)
- Cluster-based network model (Q5144527) (← links)
- Robust Clustering Algorithms Employing Fuzzy-Possibilistic Product Partition (Q5213740) (← links)
- (Q5214254) (← links)
- Metric for attractor overlap (Q5229750) (← links)
- An exact algorithm for the two-mode \(KL\)-means partitioning problem (Q5964470) (← links)
- Flexibly regularized mixture models and application to image segmentation (Q6072505) (← links)
- A hybrid MCDM model with Monte Carlo simulation to improve decision-making stability and reliability (Q6095598) (← links)
- Independence versus indetermination: basis of two canonical clustering criteria (Q6103805) (← links)
- Also for \(k\)-means: more data does not imply better performance (Q6134361) (← links)
- Strategic oscillation for the balanced minimum sum-of-squares clustering problem (Q6149519) (← links)