Pages that link to "Item:Q1009338"

The following pages link to NP-hardness of Euclidean sum-of-squares clustering (Q1009338):

Displaying 50 items.

• Cross-entropy clustering (Q85407) (← links)
• Exact algorithms for size constrained 2-clustering in the plane (Q288798) (← links)
• A survey on feature weighting based K-means algorithms (Q333337) (← links)
• Demand point aggregation method for covering problems with gradual coverage (Q337550) (← links)
• A bad instance for \texttt{k-means++} (Q393129) (← links)
• The planar \(k\)-means problem is NP-hard (Q441888) (← links)
• The complexity of finding uniform sparsest cuts in various graph classes (Q450559) (← links)
• A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets (Q463361) (← links)
• Guaranteed clustering and biclustering via semidefinite programming (Q463740) (← links)
• An approximation polynomial-time algorithm for a sequence bi-clustering problem (Q498594) (← links)
• Improved and simplified inapproximability for \(k\)-means (Q506167) (← links)
• J-means and I-means for minimum sum-of-squares clustering on networks (Q526420) (← links)
• Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering (Q628745) (← links)
• Variable neighborhood search for harmonic means clustering (Q636511) (← links)
• An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
• Dense and sparse graph partition (Q714027) (← links)
• New heuristic for harmonic means clustering (Q887198) (← links)
• Recovery guarantees for exemplar-based clustering (Q897656) (← links)
• New and efficient DCA based algorithms for minimum sum-of-squares clustering (Q898299) (← links)
• On the complexity of piecewise affine system identification (Q901110) (← links)
• NP-hardness of some quadratic Euclidean 2-clustering problems (Q906118) (← links)
• Particle swarm optimization with age-group topology for multimodal functions and data clustering (Q907172) (← links)
• Modeling time-dependent randomness in stochastic dual dynamic programming (Q1622820) (← links)
• Information-theoretic feature selection with discrete \(k\)-median clustering (Q1639220) (← links)
• An LP-based \(k\)-means algorithm for balancing weighted point sets (Q1694906) (← links)
• On the complexity of clustering with relaxed size constraints in fixed dimension (Q1704856) (← links)
• Size matters: choosing the most informative set of window lengths for mining patterns in event sequences (Q1715925) (← links)
• Graph summarization with quality guarantees (Q1741300) (← links)
• Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center (Q1746358) (← links)
• An iterated greedy heuristic for a market segmentation problem with multiple attributes (Q1753559) (← links)
• Robust K-Median and K-means clustering algorithms for incomplete data (Q1793159) (← links)
• An efficient \(K\)-means clustering algorithm for tall data (Q1987188) (← links)
• Temporally consistent tone mapping of images and video using optimal \(K\)-means clustering (Q2014481) (← links)
• A dual reformulation and solution framework for regularized convex clustering problems (Q2029898) (← links)
• Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability (Q2043627) (← links)
• Convex programming based spectral clustering (Q2051294) (← links)
• A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks (Q2053830) (← links)
• A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering (Q2066643) (← links)
• The approximation algorithm based on seeding method for functional \(k\)-means problem (Q2076447) (← links)
• Boosting isomorphic model filtering with invariants (Q2079277) (← links)
• The bi-criteria seeding algorithms for two variants of \(k\)-means problem (Q2082186) (← links)
• An approximation algorithm for the uniform capacitated \(k\)-means problem (Q2082194) (← links)
• The seeding algorithm for spherical \(k\)-means clustering with penalties (Q2082212) (← links)
• Approximation algorithm for spherical \(k\)-means problem with penalty (Q2086912) (← links)
• K-means clustering via a nonconvex optimization approach (Q2117651) (← links)
• Scenario reduction revisited: fundamental limits and guarantees (Q2118076) (← links)
• Iterative algorithm for discrete structure recovery (Q2131266) (← links)
• Network bipartitioning in the anti-communicability Euclidean space (Q2131522) (← links)
• An improved approximation algorithm for squared metric \(k\)-facility location (Q2150578) (← links)
• Soft clustering by convex electoral model (Q2156895) (← links)