Difference between revisions of "K-Modes"
m |
m |
||
| Line 17: | Line 17: | ||
[https://www.google.com/search?q="k-modes"+clustering ...Google search] | [https://www.google.com/search?q="k-modes"+clustering ...Google search] | ||
| − | * [[AI Solver]] | + | * [[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]]: [[Agents#AI-Powered Search|Search]] ... [[Clustering]] ... [[Recommendation]] ... [[Anomaly Detection]] ... [[Classification]] ... [[Dimensional Reduction]] ... [[...find outliers]] | ||
Revision as of 20:34, 12 July 2023
"K+Modes" YouTube search... "k-modes"+clustering ...Google search
- AI Solver ... Algorithms ... Administration ... Model Search ... Discriminative vs. Generative ... Optimizer ... Train, Validate, and Test
- Embedding: Search ... Clustering ... Recommendation ... Anomaly Detection ... Classification ... Dimensional Reduction ... ...find outliers
- K-Means
- K-modes Clustering Algorithm for Categorical Data | N. Sharma and N. Gaud
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
Text
