k-Met is a phonetic clustering algorithm for grouping words by their approximate pronunciation. It uses fuzzy matching techniques and the double metaphone indexing algorithm.
-
Updated
Feb 16, 2012 - Python
k-Met is a phonetic clustering algorithm for grouping words by their approximate pronunciation. It uses fuzzy matching techniques and the double metaphone indexing algorithm.
SemesterProject repository
A D-Stream clustering algorithm implementation in Python
Python implementation of the Nearest Subclass Classifier (NSC), based on Maximum Variance Clusters (MVC).
GPS for Fun! How to Cluster Location Data to Find Popular Destinations
Implementation of K-Harmonic Mean for application in Pyspark
A KModes clustering algorithm optimized for binary data
Machine Learning training algorithms and implementations
chainer implementation of Deep Embedded Clustering
This repository has the implementation of clustering algorithms i.e. K-means and Expectation Maximization algorithm using Gaussian Mixture Model
Implementation of the KBCHT clustering algorithm.
algorithm about clustering structure plane
Implementation and comparison of clustering algorithms with outlier removal/repairing approaches
All codes, both created and optimized for best results from the SuperDataScience Course
The project is mainly to demonstrate the performance in terms of convergence for Random Initialisation and K++ for K-Means Algorithm.
Add a description, image, and links to the clustering-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the clustering-algorithm topic, visit your repo's landing page and select "manage topics."