ML Breath

[C3.ai] Model Building End-To-End

[Uber] L1 & L2 Regularization

[Google] Regression Model Metrics

[Amazon] Euclidean and Manhattan Distances

[Capital One] Feature Selection

[Amazon] Underfitting and Overfitting

[Google] Model Evaluation

[Uber] Explain AUC

[Amazon] The Curse of Dimensionality

[Capital One] Handling Missing Values

[Amazon] Hyperparameter Tuning

[Salesforce] Outliers in Modeling

[PayPal] Imbalanced Labels

[Google] Multicollinearity

[Amazon] Cross-Validation

[Amazon] Variance-Bias Trade-Off

[Amazon] Model Ensembling

[Amazon] Handling Categorical Variables

[Meta] Feature Engineering

[Microsoft] Text Features

ML Algorithm

[Microsoft] Finding Optimal K in K-Means

[Amazon] GBTs Hyperparameters

[Amazon] GBTs Pseudocode

[Apple] KNN Pseudocode

[Microsoft] K-Means

[Microsoft] Principal Component Analysis

[Salesforce] K-Means on Scaled and Unscaled Data

[Intuit] Variance & Bias in Trees

[Amazon] Bagging vs Boosting

[PayPal] Random Forest vs Logistic Regression

[Meta] Decision Tree Pseudocode

[Intuit] Logistic Regression Pseudocode

[Google] How do you evaluate regression modeling?

[Meta] How Is the random forest model trained?

Deep Learning

[PayPal] Activation Functions

[Microsoft] Gradient Descent

[Microsoft] Backpropagation

[Google] RNN vs CNN

[Amazon] Neural Network Overfitting

[Intuit] Encoder-Decoder

[Google] Tuning Dense Neural Networks

[Google] Normalization

[Google] Optimizers

ML Production

[Intuit] Kubernetes in Model Deployment

[Capital One] Model Failure in Production

[Intuit] Model Deployment on AWS

[Google] Online vs Offline Model Performance

[PayPal] Prediction Point

[Capital One] Model Deployment Challenges

[Intuit] Model Orchestration

Machine Learning

Last Updated:&nbsp;April 2024

<h2 class="wp-block-heading">Problem</h2>

How do you find the optimal K in K-Means clustering?

<hr>

<h2 class="wp-block-heading">Solution</h2>

The two common methods in K-Means are the Elbow and Silhouette Methods.

1. The Elbow Method –&nbsp;You plot the explained variance (or within-cluster sum of squares) as a function of the number of clusters (K). The goal is to find the point where adding more clusters no longer leads to a significant improvement in data representation. This point is “the elbow.” Here’s the procedure:

Last Updated : &nbsp;April 2024 Problem How do you find the optimal K in K-Means clustering? Solution The two common methods in K-Means are the Elbow and…

DataInterview

[Microsoft] Finding Optimal K in K-Means

Problem#

Solution#

Unlock the full lesson

Problem

Solution