File Manager - BorneoXploit

Editing: Neighborhood.php

<?php

namespace Rubix\ML\Graph\Nodes;

use Rubix\ML\Datasets\Labeled;
use Traversable;

/**
 * Neighborhood
 *
 * Neighborhoods are hypercubes that contain samples that are close to each other in distance but
 * not *necessarily* the closest.
 *
 * @internal
 *
 * @category    Machine Learning
 * @package     Rubix/ML
 * @author      Andrew DalPino
 */
class Neighborhood implements Hypercube, BinaryNode
{
    /**
     * The dataset stored in the node.
     *
     * @var Labeled
     */
    protected Labeled $dataset;

/**
     * The multivariate minimum of the bounding box.
     *
     * @var list<int|float>
     */
    protected array $min;

/**
     * The multivariate maximum of the bounding box.
     *
     * @var list<int|float>
     */
    protected array $max;

/**
     * Terminate a branch with a dataset.
     *
     * @param Labeled $dataset
     * @return self
     */
    public static function terminate(Labeled $dataset) : self
    {
        $min = $max = [];

foreach ($dataset->features() as $values) {
            $min[] = min($values);
            $max[] = max($values);
        }

return new self($dataset, $min, $max);
    }

/**
     * @param Labeled $dataset
     * @param list<int|float> $min
     * @param list<int|float> $max
     */
    public function __construct(Labeled $dataset, array $min, array $max)
    {
        $this->dataset = $dataset;
        $this->min = $min;
        $this->max = $max;
    }

/**
     * Return the dataset stored in the node.
     *
     * @return Labeled
     */
    public function dataset() : Labeled
    {
        return $this->dataset;
    }

/**
     * Return the bounding box surrounding this node.
     *
     * @return \Generator<list<int|float>>
     */
    public function sides() : Traversable
    {
        yield $this->min;
        yield $this->max;
    }

/**
     * Does the hypercube reduce to a single point?
     *
     * @return bool
     */
    public function isPoint() : bool
    {
        return $this->min == $this->max;
    }

/**
     * Return the height of the node in the tree.
     *
     * @return int
     */
    public function height() : int
    {
        return 1;
    }
}

Cancel