php-kmeans
php-kmeans copied to clipboard
bdelespierre
PHP K-Means
`AlgorithmTest::clusterize` fails randomly because it uses randomized data. ``` PHPUnit 9.5.19 #StandWithUkraine Runtime: PHP 8.1.1 with Xdebug 3.1.2 Configuration: /home/benjamin/Workspace/bdelespierre/php-kmeans/phpunit.xml.dist ..................................F Time: 00:00.167, Memory: 10.00 MB There was 1 failure:...
## Proposed change ``` php $data = [ [80,55],[86,59],[19,85],[41,47],[57,58], [76,22],[94,60],[13,93],[90,48],[52,54], [62,46],[88,44],[85,24],[63,14],[51,40], [75,31],[86,62],[81,95],[47,22],[43,95], [71,19],[17,65],[69,21],[59,60],[59,12], [15,22],[49,93],[56,35],[18,20],[39,59], [50,15],[81,36],[67,62],[32,15],[75,65], [10,47],[75,18],[13,45],[30,62],[95,79], [64,11],[92,14],[94,49],[39,13],[60,68], [62,10],[74,44],[37,42],[97,60],[47,73], ]; // should auto-detect the arity of the euclidean space $results =...
v3 implementation is vastly different from v2. More elegant, robust, forward-compatible, and better tested. Also comes with new features like the ability to clusterize GPS Coordinates. An overhaul of the...
I believe it would be nice to be able to resume algorithm execution after its completion. It could be useful as new points are being added so previous iterations don't...
Multithreading the algo would significantly improve the performances. We may use the pthread library when available or proc_open (if none are available well :man_shrugging: ) And it would be so...
In order to find the best value for K (the number of clusters), it would be nice to get the variance of the distance of clustered points to their cluster's...
Since resuming the algorithm is possible (see #28), why not give the user the ability to pause it as well? Here's an implementation target: ```php $algo = new Kmeans\Algorithm(new Kmeans\RandomInitialization());...
Hello, thank you for sharing this package. I'm hoping to use it to help group users into diverse groups based on socioeconomic factors like race, gender, age, etc. Our dataset...
I am doing clustering of about 50K locations. Each cluster should have about 20 or less locations. Unfortunately it takes about 1 hour to finish the algorithm. My initial guess...
