Pages that link to "Item:Q3932726"
From MaRDI portal
The following pages link to The complexity of the generalized Lloyd - Max problem (Corresp.) (Q3932726):
Displayed 11 items.
- An efficient optimization method for solving unsupervised data classification problems (Q304699) (← links)
- \(K\)-harmonic means data clustering with simulated annealing heuristic (Q879469) (← links)
- \(K\)-harmonic means data clustering with tabu-search method (Q949929) (← links)
- Soft clustering by convex electoral model (Q2156895) (← links)
- \(k\)-means genetic algorithms with greedy genetic operators (Q2217036) (← links)
- Robust classifying of prokaryotic genomes (Q2359344) (← links)
- Fast gapped variants for Lempel-Ziv-Welch compression (Q2373875) (← links)
- Application of honey-bee mating optimization algorithm on clustering (Q2383894) (← links)
- Compressive statistical learning with random feature moments (Q2664824) (← links)
- Statistical learning guarantees for compressive clustering and compressive mixture modeling (Q2664825) (← links)
- (Q4633019) (← links)