Full access to Enterprise features. No credit card required.
What if You Could Automate 90% of Your Repetitive Tasks in Under 30 Days? At ServoDesk, we help businesses like yours automate operations with AI, allowing you to cut service times in half and increase productivity by 25% - without hiring more staff.
Try ServoDesk for free
EasySend is a no-code platform that transforms customer journeys
Defy form limits. Create digital experiences.
Evolve forms into smart, AI-powered digital workflows that streamline your data intake and elevate customer experiences.
Point Symmetry Clustering Approach Using Differential Evolution
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. ...
A novel and effictive GA algorithm to solve optimization problem
Classical genetic algorithm suffers heavy pressure of fitness evaluation for time-consuming optimization problems. To address this problem, we present an efficient genetic algorithm by the combination with clustering methods. The high efficiency of the proposed method results from the fitness estimation and the schema discovery of partial individuals in current population and.