Difference between revisions of "K-Modes"

From
Jump to: navigation, search
m
m
Line 19: Line 19:
 
* [[AI Solver]] ... [[Algorithms]] ... [[Algorithm Administration|Administration]] ... [[Model Search]] ... [[Discriminative vs. Generative]] ... [[Optimizer]] ... [[Train, Validate, and Test]]
 
* [[AI Solver]] ... [[Algorithms]] ... [[Algorithm Administration|Administration]] ... [[Model Search]] ... [[Discriminative vs. Generative]] ... [[Optimizer]] ... [[Train, Validate, and Test]]
 
** [[...cluster]]
 
** [[...cluster]]
* [[Embedding]][[Agents#AI-Powered Search|Search]] ... [[Clustering]] ... [[Recommendation]] ... [[Anomaly Detection]] ... [[Classification]] ... [[Dimensional Reduction]] ... [[...find outliers]]
+
* [[Embedding]] ... [[Fine-tuning]] ... [[Agents#AI-Powered Search|Search]] ... [[Clustering]] ... [[Recommendation]] ... [[Anomaly Detection]] ... [[Classification]] ... [[Dimensional Reduction]]. [[...find outliers]]
 
* [[K-Means]]
 
* [[K-Means]]
 
* [https://pdfs.semanticscholar.org/1069/2c9b80be922903526682f8fae5ad6ffb68f6.pdf K-modes Clustering Algorithm for Categorical Data | N. Sharma and N. Gaud]
 
* [https://pdfs.semanticscholar.org/1069/2c9b80be922903526682f8fae5ad6ffb68f6.pdf K-modes Clustering Algorithm for Categorical Data | N. Sharma and N. Gaud]

Revision as of 19:13, 16 August 2023

"K+Modes" YouTube search... "k-modes"+clustering ...Google search

an extension of k-means. Instead of distances it uses dissimilarities (that is, quantification of the total mismatches between two objects: the smaller this number, the more similar the two objects). And instead of means, it uses modes. A mode is a vector of elements that minimizes the dissimilarities between the vector itself and each object of the data. We will have as many modes as the number of clusters we required, since they act as centroids. Into the world of clustering algorithms: k-means, k-modes and k-prototypes | Alessia Saggio


JqGsg.png


Text