Difference between revisions of "...cluster"

From
Jump to: navigation, search
m
 
(3 intermediate revisions by the same user not shown)
Line 19: Line 19:
 
___________________________________________________
 
___________________________________________________
  
* [[Capabilities]]
 
 
* [[Clustering]]
 
* [[Clustering]]
* [http://www.clusteranalysis4marketing.com Quick Cluster Analysis for Excel]
+
* [https://www.clusteranalysis4marketing.com Quick Cluster Analysis for Excel]
* [http://www.kdnuggets.com/2019/10/right-clustering-algorithm.html Choosing the Right Clustering Algorithm for your Dataset | josh Thompson - KDnuggets]
+
** [[Excel]] ... [[LangChain#Documents|Documents]] ... [[Database|Database; Vector & Relational]] ... [[Graph]] ... [[LlamaIndex]]
* [http://www.kdnuggets.com/2018/06/5-clustering-algorithms-data-scientists-need-know.html The 5 Clustering Algorithms Data Scientists Need to Know | George Seif - KDnuggets]
+
* [https://www.kdnuggets.com/2019/10/right-clustering-algorithm.html Choosing the Right Clustering Algorithm for your Dataset | josh Thompson - KDnuggets]
* [http://medium.com/@srnghn/machine-learning-trying-to-discover-structure-in-your-data-2fbbc4f819ae Machine Learning: Trying to discover structure in your data | Stacey Ronaghan - Medium]
+
* [https://www.kdnuggets.com/2018/06/5-clustering-algorithms-data-scientists-need-know.html The 5 Clustering Algorithms Data Scientists Need to Know | George Seif - KDnuggets]
 +
* [https://medium.com/@srnghn/machine-learning-trying-to-discover-structure-in-your-data-2fbbc4f819ae Machine Learning: Trying to discover structure in your data | Stacey Ronaghan - Medium]
 
   
 
   
  
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. [http://towardsdatascience.com/the-5-clustering-algorithms-data-scientists-need-to-know-a36d136ef68 The 5 Clustering Algorithms Data Scientists Need to Know]
+
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. [https://towardsdatascience.com/the-5-clustering-algorithms-data-scientists-need-to-know-a36d136ef68 The 5 Clustering Algorithms Data Scientists Need to Know]
  
  
 
=== [[K-Means]] Clustering ===
 
=== [[K-Means]] Clustering ===
http://cdn-images-1.medium.com/max/800/1*KrcZK0xYgTa4qFrVr0fO2w.gif
+
https://cdn-images-1.medium.com/max/800/1*KrcZK0xYgTa4qFrVr0fO2w.gif
  
  
 
=== [[Mean-Shift Clustering]] ===
 
=== [[Mean-Shift Clustering]] ===
http://cdn-images-1.medium.com/max/800/1*vyz94J_76dsVToaa4VG1Zg.gif
+
https://cdn-images-1.medium.com/max/800/1*vyz94J_76dsVToaa4VG1Zg.gif
  
  
 
=== [[Density-Based Spatial Clustering of Applications with Noise (DBSCAN)]] ===
 
=== [[Density-Based Spatial Clustering of Applications with Noise (DBSCAN)]] ===
http://cdn-images-1.medium.com/max/800/1*tc8UF-h0nQqUfLC8-0uInQ.gif
+
https://cdn-images-1.medium.com/max/800/1*tc8UF-h0nQqUfLC8-0uInQ.gif
  
  
 
=== [[Expectation–Maximization (EM) Clustering using Gaussian Mixture Models (GMM)]] ===
 
=== [[Expectation–Maximization (EM) Clustering using Gaussian Mixture Models (GMM)]] ===
http://cdn-images-1.medium.com/max/800/1*OyXgise21a23D5JCss8Tlg.gif
+
https://cdn-images-1.medium.com/max/800/1*OyXgise21a23D5JCss8Tlg.gif
  
  
 
=== [[Hierarchical Clustering; Agglomerative (HAC) & Divisive (HDC)]] ===
 
=== [[Hierarchical Clustering; Agglomerative (HAC) & Divisive (HDC)]] ===
http://cdn-images-1.medium.com/max/800/1*ET8kCcPpr893vNZFs8j4xg.gif
+
https://cdn-images-1.medium.com/max/800/1*ET8kCcPpr893vNZFs8j4xg.gif
  
  
 
<youtube>Yn3VV9emiCs</youtube>
 
<youtube>Yn3VV9emiCs</youtube>

Latest revision as of 07:38, 17 August 2023

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


K-Means Clustering

1*KrcZK0xYgTa4qFrVr0fO2w.gif


Mean-Shift Clustering

1*vyz94J_76dsVToaa4VG1Zg.gif


Density-Based Spatial Clustering of Applications with Noise (DBSCAN)

1*tc8UF-h0nQqUfLC8-0uInQ.gif


Expectation–Maximization (EM) Clustering using Gaussian Mixture Models (GMM)

1*OyXgise21a23D5JCss8Tlg.gif


Hierarchical Clustering; Agglomerative (HAC) & Divisive (HDC)

1*ET8kCcPpr893vNZFs8j4xg.gif