Difference between revisions of "...cluster"

From
Jump to: navigation, search
m
Line 12: Line 12:
 
**** ...clusters aren't necessarily circular, and points are allowed to be in overlapping clusters, then try [[Expectation–Maximization (EM) Clustering using Gaussian Mixture Models (GMM)]]
 
**** ...clusters aren't necessarily circular, and points are allowed to be in overlapping clusters, then try [[Expectation–Maximization (EM) Clustering using Gaussian Mixture Models (GMM)]]
 
**** ...the distance metric shouldn't be key, then try [[Hierarchical Clustering;  Agglomerative (HAC) & Divisive (HDC)]]
 
**** ...the distance metric shouldn't be key, then try [[Hierarchical Clustering;  Agglomerative (HAC) & Divisive (HDC)]]
**** ...finding categorical values, then [[K-modes Clustering]]
+
**** ...finding categorical values, then [[K-Modes Clustering]]
  
  

Revision as of 08:59, 8 January 2019

AI Solver


___________________________________________________


Given a set of data points, we can use a clustering algorithm to classify each data point into a specific group. In theory, data points that are in the same group should have similar properties and/or features, while data points in different groups should have highly dissimilar properties and/or features. Clustering is a method of unsupervised learning and is a common technique for statistical data analysis used in many fields. We can use clustering analysis to gain some valuable insights from our data by seeing what groups the data points fall into when we apply a clustering algorithm. The 5 Clustering Algorithms Data Scientists Need to Know