K-means Clustering and its real use-case in the Security Domain

K-means Algorithm

  1. Specify number of clusters K.
  2. Initialize centroids by first shuffling the dataset and then randomly selecting K data points for the centroids without replacement.
  3. Keep iterating until there is no change to the centroids. i.e assignment of data points to clusters isn’t changing.
  • Compute the sum of the squared distance between data points and all centroids.
  • Assign each data point to the closest cluster (centroid).
  • Compute the centroids for the clusters by taking the average of the all data points that belong to each cluster.

Use-Cases in the Security Domain




nerd with words.

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

TensorFlow Callbacks in Action

The confusion about Confusion Matrix!

Evolution of NLP — Part 4 — Transformers — BERT, XLNet, RoBERTa

Scaling: Why it is important?

Summarizing Clinical Text — A baseline exploration.

Interesting applications of Linear Algebra

Simple and Deep understanding of Transformer - NLP

How to Use ImageDataGenerator in TensorFlow: Reading a Dataset and Data Augmentation

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Aditi Awasthi

Aditi Awasthi

nerd with words.

More from Medium

Evaluation Metrics for Classification- beyond Accuracy

Benchmark Analysis of Algorithms for Customer Churn Analysis In Telecommunication Sector

K-means clustering

Anomaly Detection in Click-stream Analytics