php-ai / php-ml

src/Phpml/Helper/Optimizer/Optimizer.php

Spacing +2 added lines, -2 removed lines

@@ -1,6 +1,6 @@ 
 <?php
 
-declare(strict_types=1);
+declare(strict_types = 1);
 
 namespace Phpml\Helper\Optimizer;
 
@@ -31,7 +31,7 @@ 
 
         // Inits the weights randomly
         $this->theta = [];
-        for ($i=0; $i < $this->dimensions; $i++) {
+        for ($i = 0; $i < $this->dimensions; $i++) {
             $this->theta[] = rand() / (float) getrandmax();
         }
     }

src/Phpml/Helper/Optimizer/ConjugateGradient.php

Spacing +3 added lines, -3 removed lines

@@ -1,6 +1,6 @@ 
 <?php
 
-declare(strict_types=1);
+declare(strict_types = 1);
 
 namespace Phpml\Helper\Optimizer;
 
@@ -34,7 +34,7 @@ 
 
         $d = mp::muls($this->gradient($this->theta), -1);
 
-        for ($i=0; $i < $this->maxIterations; $i++) {
+        for ($i = 0; $i < $this->maxIterations; $i++) {
             // Obtain α that minimizes f(θ + α.d)
             $alpha = $this->getAlpha(array_sum($d));
 
@@ -161,7 +161,7 @@ 
     {
         $theta = $this->theta;
 
-        for ($i=0; $i < $this->dimensions + 1; $i++) {
+        for ($i = 0; $i < $this->dimensions + 1; $i++) {
             if ($i == 0) {
                 $theta[$i] += $alpha * array_sum($d);
             } else {

src/Phpml/Classification/Linear/LogisticRegression.php

Spacing +10 added lines, -10 removed lines

@@ -1,6 +1,6 @@ 
 <?php
 
-declare(strict_types=1);
+declare(strict_types = 1);
 
 namespace Phpml\Classification\Linear;
 
@@ -13,12 +13,12 @@ 
     /**
      * Batch training: Gradient descent algorithm (default)
      */
-    const BATCH_TRAINING    = 1;
+    const BATCH_TRAINING = 1;
 
     /**
      * Online training: Stochastic gradient descent learning
      */
-    const ONLINE_TRAINING    = 2;
+    const ONLINE_TRAINING = 2;
 
     /**
      * Conjugate Batch: Conjugate Gradient algorithm
@@ -74,14 +74,14 @@ 
         string $penalty = 'L2')
     {
         $trainingTypes = range(self::BATCH_TRAINING, self::CONJUGATE_GRAD_TRAINING);
-        if (! in_array($trainingType, $trainingTypes)) {
-            throw new \Exception("Logistic regression can only be trained with " .
-                "batch (gradient descent), online (stochastic gradient descent) " .
+        if (!in_array($trainingType, $trainingTypes)) {
+            throw new \Exception("Logistic regression can only be trained with ".
+                "batch (gradient descent), online (stochastic gradient descent) ".
                 "or conjugate batch (conjugate gradients) algorithms");
         }
 
-        if (! in_array($cost, ['log', 'sse'])) {
-            throw new \Exception("Logistic regression cost function can be one of the following: \n" .
+        if (!in_array($cost, ['log', 'sse'])) {
+            throw new \Exception("Logistic regression cost function can be one of the following: \n".
                 "'log' for log-likelihood and 'sse' for sum of squared errors");
         }
 
@@ -177,7 +177,7 @@ 
                  * The gradient of the cost function to be used with gradient descent:
                  *		∇J(x) = -(y - h(x)) = (h(x) - y)
                  */
-                $callback = function ($weights, $sample, $y) use ($penalty) {
+                $callback = function($weights, $sample, $y) use ($penalty) {
                     $this->weights = $weights;
                     $hX = $this->output($sample);
 
@@ -208,7 +208,7 @@ 
                  * The gradient of the cost function:
                  *		∇J(x) = -(h(x) - y) . h(x) . (1 - h(x))
                  */
-                $callback = function ($weights, $sample, $y) use ($penalty) {
+                $callback = function($weights, $sample, $y) use ($penalty) {
                     $this->weights = $weights;
                     $hX = $this->output($sample);
 

src/Phpml/Classification/Linear/DecisionStump.php

Spacing +10 added lines, -10 removed lines

@@ -1,6 +1,6 @@ 
 <?php
 
-declare(strict_types=1);
+declare(strict_types = 1);
 
 namespace Phpml\Classification\Linear;
 
@@ -190,8 +190,8 @@ 
             }
 
             // Try other possible points one by one
-            for ($step = $minValue; $step <= $maxValue; $step+= $stepSize) {
-                $threshold = (float)$step;
+            for ($step = $minValue; $step <= $maxValue; $step += $stepSize) {
+                $threshold = (float) $step;
                 list($errorRate, $prob) = $this->calculateErrorRate($targets, $threshold, $operator, $values);
                 if ($errorRate < $split['trainingErrorRate']) {
                     $split = ['value' => $threshold, 'operator' => $operator,
@@ -215,7 +215,7 @@ 
     {
         $values = array_column($samples, $col);
         $valueCounts = array_count_values($values);
-        $distinctVals= array_keys($valueCounts);
+        $distinctVals = array_keys($valueCounts);
 
         $split = null;
 
@@ -274,7 +274,7 @@ 
         $wrong = 0.0;
         $prob = [];
         $leftLabel = $this->binaryLabels[0];
-        $rightLabel= $this->binaryLabels[1];
+        $rightLabel = $this->binaryLabels[1];
 
         foreach ($values as $index => $value) {
             if ($this->evaluate($value, $operator, $threshold)) {
@@ -288,7 +288,7 @@ 
                 $wrong += $this->weights[$index];
             }
 
-            if (! isset($prob[$predicted][$target])) {
+            if (!isset($prob[$predicted][$target])) {
                 $prob[$predicted][$target] = 0;
             }
             $prob[$predicted][$target]++;
@@ -297,7 +297,7 @@ 
         // Calculate probabilities: Proportion of labels in each leaf
         $dist = array_combine($this->binaryLabels, array_fill(0, 2, 0.0));
         foreach ($prob as $leaf => $counts) {
-            $leafTotal = (float)array_sum($prob[$leaf]);
+            $leafTotal = (float) array_sum($prob[$leaf]);
             foreach ($counts as $label => $count) {
                 if (strval($leaf) == strval($label)) {
                     $dist[$leaf] = $count / $leafTotal;
@@ -348,8 +348,8 @@ 
      */
     public function __toString()
     {
-        return "IF $this->column $this->operator $this->value " .
-            "THEN " . $this->binaryLabels[0] . " ".
-            "ELSE " . $this->binaryLabels[1];
+        return "IF $this->column $this->operator $this->value ".
+            "THEN ".$this->binaryLabels[0]." ".
+            "ELSE ".$this->binaryLabels[1];
     }
 }

src/Phpml/Classification/Linear/Perceptron.php

Spacing +4 added lines, -4 removed lines

@@ -1,6 +1,6 @@ 
 <?php
 
-declare(strict_types=1);
+declare(strict_types = 1);
 
 namespace Phpml\Classification\Linear;
 
@@ -167,7 +167,7 @@ 
     protected function runTraining(array $samples, array $targets)
     {
         // The cost function is the sum of squares
-        $callback = function ($weights, $sample, $target) {
+        $callback = function($weights, $sample, $target) {
             $this->weights = $weights;
 
             $prediction = $this->outputClass($sample);
@@ -189,7 +189,7 @@ 
      */
     protected function runGradientDescent(array $samples, array $targets, \Closure $gradientFunc, bool $isBatch = false)
     {
-        $class = $isBatch ? GD::class :  StochasticGD::class;
+        $class = $isBatch ? GD::class : StochasticGD::class;
 
         if (empty($this->optimizer)) {
             $this->optimizer = (new $class($this->featureCount))
@@ -284,6 +284,6 @@ 
 
         $predictedClass = $this->outputClass($sample);
 
-        return $this->labels[ $predictedClass ];
+        return $this->labels[$predictedClass];
     }
 }

src/Phpml/Classification/Linear/Adaline.php

Spacing +5 added lines, -5 removed lines

@@ -1,6 +1,6 @@ 
 <?php
 
-declare(strict_types=1);
+declare(strict_types = 1);
 
 namespace Phpml\Classification\Linear;
 
@@ -12,12 +12,12 @@ 
     /**
      * Batch training is the default Adaline training algorithm
      */
-    const BATCH_TRAINING    = 1;
+    const BATCH_TRAINING = 1;
 
     /**
      * Online training: Stochastic gradient descent learning
      */
-    const ONLINE_TRAINING    = 2;
+    const ONLINE_TRAINING = 2;
 
     /**
      * Training type may be either 'Batch' or 'Online' learning
@@ -41,7 +41,7 @@ 
     public function __construct(float $learningRate = 0.001, int $maxIterations = 1000,
         bool $normalizeInputs = true, int $trainingType = self::BATCH_TRAINING)
     {
-        if (! in_array($trainingType, [self::BATCH_TRAINING, self::ONLINE_TRAINING])) {
+        if (!in_array($trainingType, [self::BATCH_TRAINING, self::ONLINE_TRAINING])) {
             throw new \Exception("Adaline can only be trained with batch and online/stochastic gradient descent algorithm");
         }
 
@@ -60,7 +60,7 @@ 
     protected function runTraining(array $samples, array $targets)
     {
         // The cost function is the sum of squares
-        $callback = function ($weights, $sample, $target) {
+        $callback = function($weights, $sample, $target) {
             $this->weights = $weights;
 
             $output = $this->output($sample);

src/Phpml/IncrementalEstimator.php

Spacing +1 added lines, -1 removed lines

@@ -1,6 +1,6 @@
 <?php
 
-declare(strict_types=1);
+declare(strict_types = 1);
 
 namespace Phpml;
 

src/Phpml/Math/Statistic/Covariance.php

Spacing +4 added lines, -4 removed lines

@@ -1,6 +1,6 @@ 
 <?php
 
-declare(strict_types=1);
+declare(strict_types = 1);
 
 namespace Phpml\Math\Statistic;
 
@@ -133,14 +133,14 @@ 
 
         if ($means === null) {
             $means = [];
-            for ($i=0; $i < $n; $i++) {
+            for ($i = 0; $i < $n; $i++) {
                 $means[] = Mean::arithmetic(array_column($data, $i));
             }
         }
 
         $cov = [];
-        for ($i=0; $i < $n; $i++) {
-            for ($k=0; $k < $n; $k++) {
+        for ($i = 0; $i < $n; $i++) {
+            for ($k = 0; $k < $n; $k++) {
                 if ($i > $k) {
                     $cov[$i][$k] = $cov[$k][$i];
                 } else {

src/Phpml/DimensionReduction/KernelPCA.php

Spacing +10 added lines, -10 removed lines

@@ -1,6 +1,6 @@ 
 <?php
 
-declare(strict_types=1);
+declare(strict_types = 1);
 
 namespace Phpml\DimensionReduction;
 
@@ -48,7 +48,7 @@ 
     public function __construct(int $kernel = self::KERNEL_RBF, $totalVariance = null, $numFeatures = null, $gamma = null)
     {
         $availableKernels = [self::KERNEL_RBF, self::KERNEL_SIGMOID, self::KERNEL_LAPLACIAN, self::KERNEL_LINEAR];
-        if (! in_array($kernel, $availableKernels)) {
+        if (!in_array($kernel, $availableKernels)) {
             throw new \Exception("KernelPCA can be initialized with the following kernels only: Linear, RBF, Sigmoid and Laplacian");
         }
 
@@ -102,8 +102,8 @@ 
         $kernelFunc = $this->getKernel();
 
         $matrix = [];
-        for ($i=0; $i < $numRows; $i++) {
-            for ($k=0; $k < $numRows; $k++) {
+        for ($i = 0; $i < $numRows; $i++) {
+            for ($k = 0; $k < $numRows; $k++) {
                 if ($i <= $k) {
                     $matrix[$i][$k] = $kernelFunc($data[$i], $data[$k]);
                 } else {
@@ -126,7 +126,7 @@ 
      */
     protected function centerMatrix(array $matrix, int $n)
     {
-        $N = array_fill(0, $n, array_fill(0, $n, 1.0/$n));
+        $N = array_fill(0, $n, array_fill(0, $n, 1.0 / $n));
         $N = new Matrix($N, false);
         $K = new Matrix($matrix, false);
 
@@ -153,19 +153,19 @@ 
         switch ($this->kernel) {
             case self::KERNEL_LINEAR:
                 // k(x,y) = xT.y
-                return function ($x, $y) {
+                return function($x, $y) {
                     return Matrix::dot($x, $y)[0];
                 };
             case self::KERNEL_RBF:
                 // k(x,y)=exp(-γ.|x-y|) where |..| is Euclidean distance
                 $dist = new Euclidean();
-                return function ($x, $y) use ($dist) {
+                return function($x, $y) use ($dist) {
                     return exp(-$this->gamma * $dist->sqDistance($x, $y));
                 };
 
             case self::KERNEL_SIGMOID:
                 // k(x,y)=tanh(γ.xT.y+c0) where c0=1
-                return function ($x, $y) {
+                return function($x, $y) {
                     $res = Matrix::dot($x, $y)[0] + 1.0;
                     return tanh($this->gamma * $res);
                 };
@@ -173,7 +173,7 @@ 
             case self::KERNEL_LAPLACIAN:
                 // k(x,y)=exp(-γ.|x-y|) where |..| is Manhattan distance
                 $dist = new Manhattan();
-                return function ($x, $y) use ($dist) {
+                return function($x, $y) use ($dist) {
                     return exp(-$this->gamma * $dist->distance($x, $y));
                 };
         }
@@ -204,7 +204,7 @@ 
     protected function projectSample(array $pairs)
     {
         // Normalize eigenvectors by eig = eigVectors / eigValues
-        $func = function ($eigVal, $eigVect) {
+        $func = function($eigVal, $eigVect) {
             $m = new Matrix($eigVect, false);
             $a = $m->divideByScalar($eigVal)->toArray();