org.neo4j.gds.kmeans.KmeansUniformSampler Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of algo Show documentation

Neo4j Graph Data Science :: Algorithms

There is a newer version: 2.15.0

/*
 * Copyright (c) "Neo4j"
 * Neo4j Sweden AB [http://neo4j.com]
 *
 * This file is part of Neo4j.
 *
 * Neo4j is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see .
 */
package org.neo4j.gds.kmeans;

import org.neo4j.gds.core.utils.progress.tasks.ProgressTracker;

import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.SplittableRandom;

public class KmeansUniformSampler extends KmeansSampler {

    private final ProgressTracker progressTracker;

    @Override
    public void performInitialSampling() {
        var initialCentroids = sampleClusters();
        clusterManager.initializeCentroids(initialCentroids);
    }

    public KmeansUniformSampler(
        SplittableRandom random,
        ClusterManager clusterManager,
        long nodeCount,
        int k,
        ProgressTracker progressTracker
    ) {
        super(random, clusterManager, nodeCount, k);
        this.progressTracker = progressTracker;
    }

    private List sampleClusters(
    ) {
        HashSet sampled = new HashSet<>();
        while (sampled.size() < k) {
            long nodeId = random.nextLong(nodeCount);
            if (!sampled.contains(nodeId)) {
                sampled.add(nodeId);
                progressTracker.logProgress(1);
            }
        }
        return new ArrayList<>(sampled);
    }
}