Carousel Studio

Repurpose X Threads into LinkedIn & Instagram Carousels

Canvas & Ratio

Choose your destination platform format


Layout Template

Choose a content structure for your slides


Preset Themes


Typography & Sizing

Title Font Size36px
Body Font Size18px
Header & Footer Size12px

Brand Kit Customization

AGENCY

Configure brand assets for headers & footers

MULTI-PROFILES (AGENCY)
AGENCY
SAVE PRESETS (AGENCY)

Outro Slide CTA

Customize your closing call-to-action slide

#1
#2
#3

Background Pattern

Source Content

Build Your Carousel

Drag and drop any post card below onto a slide, or use the quick buttons to insert content/images instantly!

Drag Post #1
Matt Dancho (Business Science)
@mdancho84

The 10 types of clustering that all data scientists need to know. Let's dive in:

Apply Image
Drag Post #2
Matt Dancho (Business Science)
@mdancho84

1. K-Means Clustering: This is a centroid-based algorithm, where the goal is to minimize the sum of distances between points and their respective cluster centroid.

Apply Image
Drag Post #3
Matt Dancho (Business Science)
@mdancho84

2. Hierarchical Clustering: This method creates a tree of clusters. It is subdivided into Agglomerative (bottom-up approach) and Divisive (top-down approach).

Apply Image
Drag Post #4
Matt Dancho (Business Science)
@mdancho84

3. DBSCAN (Density-Based Spatial Clustering of Applications with Noise): This algorithm defines clusters as areas of high density separated by areas of low density.

Apply Image
Drag Post #5
Matt Dancho (Business Science)
@mdancho84

4. Mean Shift Clustering: It is a centroid-based algorithm, which updates candidates for centroids to be the mean of points within a given region.

Drag Post #6
Matt Dancho (Business Science)
@mdancho84

5. Gaussian Mixture Models (GMM): This method uses a probabilistic model to represent the presence of subpopulations within an overall population without requiring to assign each data point to a cluster.

Apply Image
Drag Post #7
Matt Dancho (Business Science)
@mdancho84

6. Spectral Clustering: It uses the eigenvalues of a similarity matrix to reduce dimensionality before applying a clustering algorithm, typically K-means.

Apply Image
Drag Post #8
Matt Dancho (Business Science)
@mdancho84

7. OPTICS (Ordering Points To Identify the Clustering Structure): Similar to DBSCAN, but creates a reachability plot to determine clustering structure.

Drag Post #9
Matt Dancho (Business Science)
@mdancho84

8. Affinity Propagation: It sends messages between pairs of samples until a set of exemplars and corresponding clusters gradually emerges.

Drag Post #10
Matt Dancho (Business Science)
@mdancho84

9. BIRCH (Balanced Iterative Reducing and Clustering using Hierarchies): Designed for large datasets, it incrementally and dynamically clusters incoming multi-dimensional metric data points.

Drag Post #11
Matt Dancho (Business Science)
@mdancho84

10. CURE (Clustering Using Representatives): It identifies clusters by shrinking each cluster to a certain number of representative points rather than the centroid.

Apply Image
Drag Post #12
Matt Dancho (Business Science)
@mdancho84

EVERY DATA SCIENTIST NEEDS TO LEARN AI IN 2025. 99% of data scientists are overlooking AI. I want to help.

Drag Post #13
Matt Dancho (Business Science)
@mdancho84

On Wednesday, May 21st, I'm sharing one of my best AI Projects: Customer Segmentation Agent with AI Register here (500 seats): <a target="_blank" href="https://learn.business-science.io/ai-register" color="blue">learn.business-science.io/ai-register</a>

Apply Image