Network Security Based on K-Means Clustering Algorithm

Unsupervised Learning


Types of Clustering

  • Hierarchical clustering
  • Partitioning clustering
  • Agglomerative clustering
  • Divisive clustering
  • K-Means clustering
  • Fuzzy C-Means clustering

K-means Clustering

Where does the k-means clustering algorithm is used?

What are the basic steps for K-means clustering?

  • Step 1: Choose the number of clusters k.
  • Step 2: Select k random points from the data as centroids.
  • Step 3: Assign all the points to the closest cluster centroid.
  • Step 4: Re-compute the centroids of newly formed clusters.
  • Step 5: Repeat steps 3 and 4.

Applications of K-Means Clustering

  • Academic performance
  • Diagnostic systems
  • Search engines
  • Wireless sensor networks

How Does K-Means Clustering Work?

Limitations of K-means Clustering

  1. The output is highly influenced by original input, for example, the number of clusters.
  2. An array of data substantially hits the concluding outcomes.
  3. In some cases, clusters show complex spatial views, then executing clustering is not a good choice.
  4. Also, rescaling is sometimes conscious, it can’t be done by normalization or standardization of data points, the output gets changed entirely.

K-Means Use-Cases in the Security Domain

  1. Identifying crime localities-



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
Aditya Raj

I'm passionate learner diving into the concepts of computing 💻