Examples of AlgoKMeansCol

image.processing.algorithms.clustering.kmeans.AlgoKMeansCol
An implementation of the K-means algorithm (J. MacQueen, 1967).

The K-means algorithm steps are (text from Wikipedia) : 1) Choose the number of clusters, k. * 2) Randomly generate k clusters and determine the cluster centers, or directly generate k random points as cluster centers. 3) Assign each point to the nearest cluster center. 4) Recompute the new cluster centers. 5) Repeat the two previous steps until some convergence criterion is met (usually that the assignment hasn't changed). @author Philippe Fournier-Viger

Examples of image.processing.algorithms.clustering.kmeans.AlgoKMeansCol

    String input = fileToPath("current_colour_data.txt");
    String output = ".//output_colour.txt";
    int k = _k;
                
    // Apply the algorithm for colour
    AlgoKMeansCol algoKMeans = new AlgoKMeansCol();
    algoKMeans.runAlgorithm(input, k);
    algoKMeans.printStatistics();
    algoKMeans.saveToFile(output);
                
                //Reenable button
                Interface.clusterButton.setEnabled(true);


  }

View Full Code Here

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.