Package edu.ucla.sspace.clustering.criterion

Examples of edu.ucla.sspace.clustering.criterion.CriterionFunction.score()


        double[] referenceScores = new double[gapMatrices.length];
        for (int j = 0; j < gapMatrices.length; ++j) {
            verbose("Clustering reference data %d \n", j);
            Assignments result = DirectClustering.cluster(
                    gapMatrices[j], k, 1, function);
            referenceScores[j] = Math.log(function.score());
            referenceScore += referenceScores[j];
        }
        referenceScore /= numGaps;

        // Compute the standard deviation for the reference scores.
View Full Code Here


                matrix, k, 1, function);

        // Compute the difference between the two scores.  If the
        // current score is less than the previous score, then the
        // previous assignment is considered best.
        double gap = Math.log(function.score());
        verbose("Completed iteration with referenceScore: %f, gap:%f\n",
                referenceScore, gap);
        gap = referenceScore - gap;

        System.out.printf("k: %d gap: %f std: %f\n", i, gap, referenceStdev);
View Full Code Here

TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.