Created on Cognitive Class Labs

100%

Created on Cognitive Class Labs

✓ Published0🌍 Public

Last edited Jun 3, 2019

Created on Jun 3, 2019

This example demonstrates k-means clustering on two datasets, first illustrating the algorithm on an engineered set of 30 data points in two distinct clusters, then applying it to customer segmentation. The visualization uses Matplotlib’s inline plotting to render the resulting cluster assignments and centroids, computed via scikit-learn's `KMeans` API. The initial dataset is defined manually as x1 and x2 coordinate lists, while the segmentation relies on customer data, both processed within a Jupyter notebook environment using NumPy for computation.

AI-generated description

Similar vizzes

Loading thumbnail…

Created on Cognitive Class Labs

This notebook demonstrates a K-Nearest Neighbors classification workflow on a telecommunications customer dataset, segmented into four service-usage groups. It uses pandas for data loading and preprocessing, and scikit-learn’s `preprocessing` module for feature scaling. The core visualization combines `matplotlib.pyplot` scatter plots to display demographic features (such as region and age) colored by customer category, alongside a manually inserted diagram of the K-NN algorithm. The analysis shows how varying the value of K affects class predictions for unknown data points.

DDAVINDER

71% match

Loading thumbnail…

K means clustering

This example shows the k-means clustering algorithm in action, animating the iterative process of grouping a small set of points from `data.csv` into three clusters. Initially, three randomly placed centroids are drawn, and each iteration assigns points to the nearest centroid using Euclidean distance, then moves the centroids to the cluster mean. The visualization uses D3 v6’s selection and `transition` methods to animate the points and centroids, with the centroid styled distinctly via a black stroke. The iteration count is displayed as text, and the animation stops after ten iterations.

Kkaviya-ds

67% match

Loading thumbnail…

KMeans clustering

This example demonstrates KMeans clustering on a small dataset of six points loaded from a CSV file. It shows how points are iteratively assigned to one of three clusters, with colored hulls drawn around each group and centroids recalculated until a local minimum cost is reached. The visualization uses D3.js v4 with a React framework, rendering SVG circles and polygon hulls with animated transitions. The code employs `d3.csv`, `d3.polygonHull`, `d3.scaleLinear`, and `d3.interval` to animate the clustering process, displaying the iteration count in the final state.

NNaveenaS12

67% match

Loading thumbnail…

Untitled

This interactive example demonstrates the k-means clustering algorithm on a one-dimensional dataset of ten random points. Users click an "Iteration Step" button to advance the algorithm, which reassigns each point to its nearest centroid and recalculates centroid positions. The visualization uses D3 v7 with an SVG rendering, where points are colored by cluster assignment (blue, green, orange) and larger gray-stroked circles represent centroids. The code employs d3.scaleLinear to map data values to x-coordinates, and point assignment uses absolute distance calculations to update cluster memberships.

Ssz2036

64% match

Loading thumbnail…

Gist 599b117350a329c9046f68ae0ce1e21a

This example visualizes a k-means clustering result over a set of data points, showing how the algorithm partitions the space into distinct clusters based on two measured attributes. The chart is generated from a Power BI DAX query that first summarizes the source table `Query1` by summing the X and Y values for each category Z, then feeds those aggregated coordinates into the `KMeansClustering` function. The output assigns a `ClusterId` to each point, which the visualization likely encodes through color or position. The rendering relies on Power BI’s built-in visual engine rather than a custom JavaScript library, as no D3 or Canvas code appears in the provided DAX.

HHugoberry

63% match

Loading thumbnail…

K Means

This visualization demonstrates k-means clustering on EEG data, showing how four centroids iteratively partition points into clusters based on their F3 and P4 channel values. The animation runs for ten iterations, updating cluster assignments and recalculating centroid positions with each step. The code uses d3.csv to load the dataset, d3.schemeCategory10 for cluster colors, d3.mean for computing cluster centers, and D3 transitions to animate point movements and color changes. A setInterval drives the iterative process, while text elements display the current iteration number.

HHariprashanth75

62% match

Loading thumbnail…

Clusters

This interactive scatterplot visualizes galaxy data with K-Means clustering, allowing users to switch between original magnitude coordinates, principal component projections, and t-SNE embeddings. The visualization supports dynamic axis selection from five photometric bands, with points colored by cluster membership across different projection methods. Built with d3.v3, the chart uses SVG circles, d3.scale.linear for axes, and d3.svg.axis to render coordinates, with clickable buttons and dropdowns to update the display. Data comes from finalOutput.csv containing astronomical measurements and cluster assignments.

JJverma

62% match

Loading thumbnail…

Created on Cognitive Class Labs

This example shows the process of segmenting and clustering neighborhoods in New York City. It maps each neighborhood to its latitude and longitude coordinates, then uses the Foursquare API to fetch common venue categories per neighborhood. The code applies k-means clustering to group neighborhoods into clusters and visualizes the results on an interactive Folium map, with each cluster color-coded. The underlying neighborhood dataset is downloaded from a public web source, and the map rendering relies on Folium’s mapping library.

DDAVINDER

62% match