K-Means vs. Affinity Propagation Clustering
Last Updated on July 24, 2023 by Editorial Team
Author(s): Michelangiolo Mazzeschi
Originally published on Towards AI.
Finding Clusters

Clustering is one of the simplest algorithms to implement with any Machine Learning tools. There are two different sets of algorithms dedicated to Clustering, depending on if we use Numerical Data (K-Means or Affinity Propagation), or Categorical Data (K-Mode).
Example of Clustering
Because with Categorical Clustering your data is not encoded in any mathematical space (you could solve that with labeling, but you would forcibly associate a numerical value to each one of your categories) it is very hard to deal with. You need to choose a specific algorithm and perform analysis using different metrics and evaluation methods. Therefore, in this article,… Read the full blog for free on Medium.
Join thousands of data leaders on the AI newsletter. Join over 80,000 subscribers and keep up to date with the latest developments in AI. From research to projects and ideas. If you are building an AI startup, an AI-related product, or a service, we invite you to consider becoming a sponsor.
Published via Towards AI
Towards AI Academy
We Build Enterprise-Grade AI. We'll Teach You to Master It Too.
15 engineers. 100,000+ students. Towards AI Academy teaches what actually survives production.
Start free — no commitment:
→ 6-Day Agentic AI Engineering Email Guide — one practical lesson per day
→ Agents Architecture Cheatsheet — 3 years of architecture decisions in 6 pages
Our courses:
→ AI Engineering Certification — 90+ lessons from project selection to deployed product. The most comprehensive practical LLM course out there.
→ Agent Engineering Course — Hands on with production agent architectures, memory, routing, and eval frameworks — built from real enterprise engagements.
→ AI for Work — Understand, evaluate, and apply AI for complex work tasks.
Note: Article content contains the views of the contributing authors and not Towards AI.