Pages that link to "Item:Q1763158"

The following pages link to How fast is the \(k\)-means method? (Q1763158):

Displaying 14 items.

• \(k\)-means requires exponentially many iterations even in the plane (Q540436) (← links)
• A local search approximation algorithm for \(k\)-means clustering (Q598232) (← links)
• On the performance of the ICP algorithm (Q934025) (← links)
• An LP-based \(k\)-means algorithm for balancing weighted point sets (Q1694906) (← links)
• Data clustering via cooperative games: a novel approach and comparative study (Q2054061) (← links)
• The approximation algorithm based on seeding method for functional \(k\)-means problem (Q2076447) (← links)
• Frequency-based views to pattern collections (Q2489656) (← links)
• How fast is the \(k\)-means method? (Q2921753) (← links)
• A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM (Q3430335) (← links)
• The Planar k-Means Problem is NP-Hard (Q3605504) (← links)
• GEOMETRIC ALGORITHMS FOR THE CONSTRAINED 1-D K-MEANS CLUSTERING PROBLEMS AND IMRT APPLICATIONS (Q3634189) (← links)
• Étude exhaustive de l'algorithme de réallocation-recentrage dans un cas simple (Q3783066) (← links)
• Local Search Yields a PTAS for $k$-Means in Doubling Metrics (Q4634026) (← links)
• (Q5111721) (← links)