K-Means Clustering

📘 Artificial Intelligence & Machine Learning Basics 👁 102 views 📅 Nov 05, 2025
⏱ Estimated reading time: 1 min

Definition:
An unsupervised learning algorithm that groups data into K clusters based on similarity.

Key Points:

  • Each cluster has a centroid

  • Points are assigned to the cluster with the nearest centroid

  • Iteratively updates centroids until clusters stabilize

Applications:

  • Customer segmentation

  • Image compression

  • Market basket analysis

Advantages:

  • Simple and fast

  • Works well for large datasets

Limitations:

  • Requires predefined K

  • Sensitive to outliers

  • Not suitable for non-globular clusters


🔒 Some advanced sections are available for Registered Members
Register Now

Share this Post


← Back to Tutorials

Popular Competitive Exam Quizzes

🤖 AI Quizer Assistant

📝 Quiz
📚 Categories
🏆 Leaderboard
📊 My Score
❓ Help
👋 Hi! I'm your AI quiz assistant for Quizer.in!

I can help you with:
• 📝 Finding quizzes
• 🏆 Checking leaderboard
• 📊 Your performance stats

Type 'help' to get started! 🚀
AI is thinking...