xuyxu / Clustering
Clustering / Subspace Clustering Algorithms on MATLAB
Stars: ✭ 134
Programming Languages
matlab
3953 projects
Labels
Projects that are alternatives of or similar to Clustering
Janus Cloud
a cluster solution for Janus WebRTC server, by API proxy approach
Stars: ✭ 108 (-19.4%)
Mutual labels: clustering
Ml Dl Scripts
The repository provides usefull python scripts for ML and data analysis
Stars: ✭ 119 (-11.19%)
Mutual labels: clustering
Awesome Community Detection
A curated list of community detection research papers with implementations.
Stars: ✭ 1,874 (+1298.51%)
Mutual labels: clustering
Gmvae
Implementation of Gaussian Mixture Variational Autoencoder (GMVAE) for Unsupervised Clustering
Stars: ✭ 111 (-17.16%)
Mutual labels: clustering
Ml Email Clustering
Email clustering with machine learning
Stars: ✭ 116 (-13.43%)
Mutual labels: clustering
Flutter map marker cluster
Provides beautiful animated marker clustering functionality for flutter_map. Inspired by Leaflet.markercluster
Stars: ✭ 101 (-24.63%)
Mutual labels: clustering
Pt Dec
PyTorch implementation of DEC (Deep Embedding Clustering)
Stars: ✭ 132 (-1.49%)
Mutual labels: clustering
Msmbuilder
🏗 Statistical models for biomolecular dynamics 🏗
Stars: ✭ 118 (-11.94%)
Mutual labels: clustering
Dat8
General Assembly's 2015 Data Science course in Washington, DC
Stars: ✭ 1,516 (+1031.34%)
Mutual labels: clustering
Adaptive clustering
Lightweight and Accurate Point Cloud Clustering
Stars: ✭ 125 (-6.72%)
Mutual labels: clustering
K means
A Python implementation of k-means clustering algorithm
Stars: ✭ 108 (-19.4%)
Mutual labels: clustering
Libcluster
An extensible C++ library of Hierarchical Bayesian clustering algorithms, such as Bayesian Gaussian mixture models, variational Dirichlet processes, Gaussian latent Dirichlet allocation and more.
Stars: ✭ 129 (-3.73%)
Mutual labels: clustering
Imagecluster
Cluster images based on image content using a pre-trained deep neural network, optional time distance scaling and hierarchical clustering.
Stars: ✭ 122 (-8.96%)
Mutual labels: clustering
Awesome Single Cell
Community-curated list of software packages and data resources for single-cell, including RNA-seq, ATAC-seq, etc.
Stars: ✭ 1,937 (+1345.52%)
Mutual labels: clustering
Hawk
A web-based GUI for managing and monitoring the Pacemaker High-Availability cluster resource manager
Stars: ✭ 130 (-2.99%)
Mutual labels: clustering
Community
A Python implementation of Girvan-Newman algorithm
Stars: ✭ 125 (-6.72%)
Mutual labels: clustering
Clustering/Subspace Clustering Algorithms on MATLAB
This repo is no longer in active development. However, any problem on implementations of existing algorithms is welcomed. [Oct, 2020]
1. Clustering Algorithms
- K-means
-
K-means++
- Generally speaking, this algorithm is similar to K-means;
- Unlike classic K-means randomly choosing initial centroids, a better initialization procedure is integrated into K-means++, where observations far from existing centroids have higher probabilities of being chosen as the next centroid.
- The initializeation procedure can be achieved using Fitness Proportionate Selection.
-
ISODATA (Iterative Self-Organizing Data Analysis)
- To be brief, ISODATA introduces two additional operations: Splitting and Merging;
- When the number of observations within one class is less than one pre-defined threshold, ISODATA merges two classes with minimum between-class distance;
- When the within-class variance of one class exceeds one pre-defined threshold, ISODATA splits this class into two different sub-classes.
-
Mean Shift
- For each point x, find neighbors, calculate mean vector m, update x = m, until x == m;
- Non-parametric model, no need to specify the number of classes;
- No structure priori.
-
DBSCAN (Density-Based Spatial Clustering of Application with Noise)
- Starting with pre-selected core objects, DBSCAN extends each cluster based on the connectivity between data points;
- DBSCAN takes noisy data into consideration, hence robust to outliers;
- Choosing good parameters can be hard without prior knowledge;
- Gaussian Mixture Model (GMM)
- LVQ (Learning Vector Quantization)
2. Subspace Clustering Algorithms
-
Subspace K-means
- This algorithm directly extends K-means to Subspace Clustering through multiplying each dimension dj by one weight mj (s.t. sum(mj)=1, j=1,2,...,p);
- It can be efficiently sovled in an Expectation-Maximization (EM) fashion. In each E-step, it updates weights, centroids using Lagrange Multiplier;
- This rough algorithm suffers from the problem on its favor of using just a few dimensions when clustering sparse data;
-
Entropy-Weighting Subspace K-means
- Generally speaking, this algorithm is similar to Subspace K-means;
- In addition, it introduces one regularization item related to weight entropy into the objective function, in order to mitigate the aforementioned problem in Subspace K-means.
- Apart from its succinctness and efficiency, it works well on a broad range of real-world datasets.
Note that the project description data, including the texts, logos, images, and/or trademarks,
for each open source project belongs to its rightful owner.
If you wish to add or remove any projects, please contact us at [email protected].