Implementation of Point Symmetry-based Automatic Clustering
Approach Using Differential Evolution

Using bug fixed KD tree nearest neighbor search from https://github.com/CristianDallos/kmeansclustering. (It is also modified to search for multiple nearest points instead only for one.)

Used those academic works for algorithm implementation:

http://cs.cug.edu.cn/teacherweb/gwy/Publication/ISICA-09.pdf

http://www.isical.ac.in/~sanghami/ieeetkde_cameraready.pdf

http://www.softcomputing.net/smca-paper1.pdf

1. You may download code:
git clone git://git.code.sf.net/p/pointsymmetryclustering/code pointsymmetryclustering-code
2. Build:
mvn clean install assembly:assembly -DskipTests -Dmaven.test.skip=true -DdownloadSources=true -Dcheckstyle.skip=true
3. Run:
java -jar target/point-symmetry-clustering-1.0-fat.jar

Project Activity

See All Activity >

License

Creative Commons Attribution License

Follow Point Symmetry Clustering

Point Symmetry Clustering Web Site

Other Useful Business Software
Forever Free Full-Stack Observability | Grafana Cloud Icon
Forever Free Full-Stack Observability | Grafana Cloud

Our generous forever free tier includes the full platform, including the AI Assistant, for 3 users with 10k metrics, 50GB logs, and 50GB traces.

Built on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
Create free account
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of Point Symmetry Clustering!

Additional Project Details

Intended Audience

Education

Programming Language

Java

Related Categories

Java Genetic Algorithms

Registered

2014-04-05