{"id":23632,"date":"2020-06-11T02:15:00","date_gmt":"2020-06-11T09:15:00","guid":{"rendered":"https:\/\/www.springboard.com\/blog\/?p=23632"},"modified":"2023-06-25T23:38:42","modified_gmt":"2023-06-26T06:38:42","slug":"k-means-clustering","status":"publish","type":"post","link":"https:\/\/www.springboard.com\/blog\/data-science\/k-means-clustering\/","title":{"rendered":"K Means Clustering Machine Learning Algorithm: Introduction and Implementation"},"content":{"rendered":"\n

In this blog post, we are going to discuss the ‘K Means clustering Machine Learning algorithm’. Unlike the KNN Algorithm, K Means clustering is an Unsupervised Learning algorithm. Unsupervised learning does not involve the target output which means no training is provided to the system. And the system must learn on its own through determining and adapting to the structural characteristics in the input patterns. Unsupervised learning method works with unlabeled data in which the output is just based on the result of observations. Unsupervised learning generates a moderate accurate output but it is reliable. We can see below the different types of Unsupervised learning algorithms.<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n

Now we will look at the Clustering technique and its use cases.<\/p>\n\n\n\n

Inspired by this analysis and want to learn how to do it \/ wish to replicate this for your project? We can help you there. Just leave your email address in this google form<\/a> and we will share the analysis with you within 48 hours.<\/strong><\/em><\/p>\n\n\n\n

K<\/strong> Means Clustering: Clustering Technique<\/strong><\/h2>\n\n\n\n

Clustering is an unsupervised learning technique. Gestalt’s Law of similarity says that if two things are similar in some ways, they often share other characteristics. Similarly, a cluster is a set of similar data points or a set of points that are more similar to each other than to points in other clusters. In clustering unsupervised learning techniques, we provide unlabeled training datasets to an algorithm and we ask the algorithm to find some structure in the data. Output can be in the form of clustered or density-based or hierarchical.<\/p>\n\n\n\n

Clustering techniques can be used for:<\/p>\n\n\n\n

1) Market Segmentation: Analyzing market and customer requirements to target the sale of selective products in certain demography.<\/p>\n\n\n\n

2) Social Network Analysis: Based on user habits and social interactions we can group users in a certain cluster, assisting effective communication.<\/p>\n\n\n\n

3) Detecting Anomalies or Outliers: Using clustering techniques to identify the outliers student in the classroom as some students outperformed other students or failed to even pass. Another example of anomaly detection would be Fraud detection in credit card transactions in banks.<\/p>\n\n\n\n

In this post, we will discuss only the K Means Clustering Algorithm, its implementation, and use cases.<\/p>\n\n\n

Get To Know Other\tData Science Students<\/h4>
\"Joy<\/a>

Joy Opsvig<\/p>

Data Science Apprentice Engineer at LinkedIn<\/p><\/div>

<\/div>

Read Story<\/a><\/p><\/div><\/div>

\"Diana<\/a>

Diana Xie<\/p>

Machine Learning Engineer at IQVIA<\/p><\/div>

Read Story<\/a><\/p><\/div><\/div>

\"Brandon<\/a>

Brandon Beidel<\/p>

Senior Data Scientist at Red Ventures<\/p><\/div>

Read Story<\/a><\/p><\/div><\/div><\/div><\/div>\n\n\n\n

K Means Clustering Algorithm<\/strong><\/h2>\n\n\n\n

K Means Clustering Algorithm is the most popular algorithm. K-Means is an iterative algorithm. Let\u2019s imagine we have a set of unlabeled data and we want to group the dataset into three clusters. K-Means the algorithm will assign each data point to one of the K groups based on the feature and similarities. Here are the steps by which we can achieve this using K-Means clustering:<\/p>\n\n\n\n

    \n
  1. We will define the value of K which means we are going to create a K number of clusters. As in our example, we would like to create 3 cluster groups from the data set. so, the value of K will be 3.<\/li>\n\n\n\n
  2. Initialize two randomly selected points from the cluster. This is called a centroid.<\/li>\n\n\n\n
  3. Traverse dataset till the last data point and assign then to cluster\/group.<\/li>\n<\/ol>\n\n\n\n

    Implementation of K Means Clustering Algorithm<\/strong><\/h3>\n\n\n\n

    For our implementation, we are using Juypter Notebook and executing our algorithm in python v3.0.We have also created one sample dataset on which we will implement the K-Means algorithm. Below are the columns and few rows from our dataset:<\/p>\n\n\n\n

    CustomerId<\/strong><\/td>CreditScore<\/strong><\/td>Purchase In Lacs<\/strong><\/td>State<\/strong><\/td><\/tr>
    91001<\/td>68<\/td>5<\/td>Active<\/td><\/tr>
    91002<\/td>84<\/td>8<\/td>Active<\/td><\/tr>
    91003<\/td>59<\/td>21<\/td>Active<\/td><\/tr>
    91004<\/td>85<\/td>4<\/td>Active<\/td><\/tr>
    91005<\/td>91<\/td>3<\/td>Active<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n
      \n
    1. Let us start by loading the necessary libraries. We are using NumPy for scientific computing with python. It\u2019s a widely opensource library used for applying data science<\/a>. Also, we are loading Mathplotlib for multiplatform data visualization. To implement K-Means clustering, we are going to load sklearn.cluster(https:\/\/scikit-learn.org\/stable\/modules\/clustering.html<\/a>) module.<\/li>\n<\/ol>\n\n\n\n
      \"\"<\/figure>\n\n\n\n

      Related Read:<\/strong> Data Scientist Job Description<\/a><\/em><\/p>\n\n\n\n

      2) Now we will load our dataset which has these columns – CustomerId, CreditScore, Purchase Amount, State.<\/p>\n\n\n\n

      \"\"<\/figure>\n\n\n\n

      3) Next, we will select only two columns from the dataset on which we want to perform the K-Means algorithm. We are using iloc function from pandas to select the required columns and assign that to the X vector.<\/p>\n\n\n\n

      \"\"<\/figure>\n\n\n\n

      4) Let us specify how many cluster groups we would like to create. In this example, we are going to work with 3 clusters.<\/p>\n\n\n\n

      \"\"<\/figure>\n\n\n\n

      5) Now create Y cluster for predicting the X vector. Here we are going to use fit. predict method and this is how it will look. Now Y_kmeans contain predicted value by K-mean:<\/p>\n\n\n\n

      \"\"<\/figure>\n\n\n\n

      6) Let us visualize the cluster using the plt.scatter method. Here we are going to create 3 scatters one for each cluster and label them as Cluster 1, Cluster 2 and Cluster 3.<\/p>\n\n\n\n

      \"K<\/figure>\n\n\n\n

      7) We have added labels for X and Y vectors as CreditScore and Purchase amount. The output plot graph will look like this. <\/p>\n\n\n\n

      \"K<\/figure>\n\n\n\n

      The outputs of performing K Means clustering algorithm on a dataset are:<\/p>\n\n\n\n

      1) K centroids: Centroids for each of the k clusters identified from the dataset.<\/p>\n\n\n\n

      2) Complete dataset labeled to ensure each data point is assigned to one of the clusters.<\/p>\n\n\n\n

      Inspired by this analysis and want to learn how to do it \/ wish to replicate this for your project? We can help you there. Just leave your email address in this google form<\/a> and we will share the analysis with you within 48 hours.<\/strong><\/em><\/p>\n\n\n\n

      Use Cases of K-Means Algorithm<\/h3>\n\n\n\n

      1) Document Clustering: Classification of documents based on topics or content of the document. <\/p>\n\n\n\n

      2) IT Alert based Clustering: By clustering of operational alerts, we can identify the categories of alerts could be network related, Database related or application related alerts or mean-time to repair the alert or system failure predictions.<\/p>\n\n\n\n

      3) Fraud detection: Identifying the fraud from the historical dataset and cluster them into one group.<\/p>\n\n\n\n

      4) Market Segment: Clustering of customer database and grouping them to different market segments.<\/p>\n\n\n\n

      K Means clustering is one of the widely used clustering algorithms and very popular amongst data experts. Other algorithms in the clustering technique are the Density-based Clustering and Hierarchical model. We will discuss these algorithms in the coming posts.<\/p>\n\n\n\n

      Since you\u2019re here\u2026
      <\/strong>Curious about a career in data science? Experiment with our       free data science learning path<\/a>, or join our Data Science Bootcamp<\/a>, where you\u2019ll get your tuition back if you don’t land a job after graduating. We\u2019re confident because our courses work \u2013 check out our student success stories<\/a> to get inspired.<\/p>\n\n\n\n


      <\/p>\n","protected":false},"excerpt":{"rendered":"

      In this blog post, we are going to discuss the ‘K Means clustering Machine Learning algorithm’. Unlike the KNN Algorithm, K Means clustering is an Unsupervised Learning algorithm. Unsupervised learning does not involve the target output which means no training is provided to the system. And the system must learn on its own through determining […]<\/p>\n","protected":false},"author":100,"featured_media":46234,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"_eb_attr":"","_eb_data_table":"","footnotes":""},"categories":[67],"tags":[],"marketing_tags":[],"class_list":{"0":"post-23632","1":"post","2":"type-post","3":"status-publish","4":"format-standard","5":"has-post-thumbnail","7":"category-data-science"},"acf":[],"_links":{"self":[{"href":"https:\/\/www.springboard.com\/blog\/wp-json\/wp\/v2\/posts\/23632"}],"collection":[{"href":"https:\/\/www.springboard.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.springboard.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.springboard.com\/blog\/wp-json\/wp\/v2\/users\/100"}],"replies":[{"embeddable":true,"href":"https:\/\/www.springboard.com\/blog\/wp-json\/wp\/v2\/comments?post=23632"}],"version-history":[{"count":3,"href":"https:\/\/www.springboard.com\/blog\/wp-json\/wp\/v2\/posts\/23632\/revisions"}],"predecessor-version":[{"id":46233,"href":"https:\/\/www.springboard.com\/blog\/wp-json\/wp\/v2\/posts\/23632\/revisions\/46233"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.springboard.com\/blog\/wp-json\/wp\/v2\/media\/46234"}],"wp:attachment":[{"href":"https:\/\/www.springboard.com\/blog\/wp-json\/wp\/v2\/media?parent=23632"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.springboard.com\/blog\/wp-json\/wp\/v2\/categories?post=23632"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.springboard.com\/blog\/wp-json\/wp\/v2\/tags?post=23632"},{"taxonomy":"marketing_tags","embeddable":true,"href":"https:\/\/www.springboard.com\/blog\/wp-json\/wp\/v2\/marketing_tags?post=23632"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}