Skip to content

A kmeans implementation using kdtree data structure in Python

Notifications You must be signed in to change notification settings

vz-chameleon/kdtree

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

11 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

KMeans with a KDtree

An efficient Kmeans clustering implementation using KDtree data structure in Python

About this project

This project is a Python implementation of the Filtering Algorithm using KDTrees described in the publication "An efficient k-Means clustering algorithm : analysis and implementation", by T. Kanungo, D. Mount, N. Netanyahu, C. Piatko, R. Silverman and A. Wu, in IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 24, July 2002 (https://www.cs.umd.edu/~mount/Projects/KMeans/pami02.pdf)

Dependencies

The project is written in Python 2 and uses the following libraries :

  • Matplotlib
  • Networkx
  • Numpy

Run

To see what this program can do please run the 'test_kdtree.py' script or the 'astro_clustering.py'

python2 test_kdtree.py

License

This software is licensed under the GPL v3.0 License

About

A kmeans implementation using kdtree data structure in Python

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages