Clustering Algorithms with Python(machinelearningmastery.com)
machinelearningmastery.com
Clustering Algorithms with Python
https://machinelearningmastery.com/clustering-algorithms-with-python/
2 comments
As this tutorial introduces the spectral clustering method that uses a similarity matrix between objects, I believe graph clustering methods are also worth mentioning. When I was investigating this topic, I released an implementation of a very efficient randomized clustering algorithm for graphs called Chinese Whispers: https://github.com/nlpub/chinese-whispers-python. Since it does not use matrices internally, it allows handling very large NetworkX graphs.
Here is another Python graph clustering library, also based on networkX.
This one works well for similarity style graphs - dense, weighted and directed graphs, such as what you would get from deriving distances for instances of other data:
https://github.com/IngoMarquart/python-threshold-clustering
This one works well for similarity style graphs - dense, weighted and directed graphs, such as what you would get from deriving distances for instances of other data:
https://github.com/IngoMarquart/python-threshold-clustering
Helpful plug: if you don't have an environment handy to try these out, here's an invite link https://iko.ai/invite/zBTnAv2ZI9sQ4yuBvBxGoCT5EuqwOjf6fkZkaA...
Head to "Notebook" and play. They're real-time collaborative notebooks (right click on a notebook, then generate shareable link).
You may have problems if other free users maxed out the quota, but if you have a GKE cluster, you can hook it up and use it on the platform for scheduled notebooks.