Dexa/Kyle Polich

Explaining Clustering Algorithms

Lucas discusses the limitations of decision trees in expressing clustering algorithms and the trade-off between explainability and depth. He explains the algorithmic contributions in controlling tree depth and the penalty approach used to regulate the size of given parameters.

In this clip
From this podcast
Data Skeptic
Explainable K-Means
Related Questions
- What is the challenge around explainability in AI as discussed in the episode Explainable K-Means and the clip Shallow Decision Trees?
- How can AI be made explainable in the context of the episode Explainable K-Means and the clip Shallow Decision Trees?