nlptoolkit-classification 1.0.8 → 1.0.9

package/dist/Model/NonParametric/KnnModel.js

@@ -1,118 +1,111 @@
-(function (factory) {
-    if (typeof module === "object" && typeof module.exports === "object") {
-        var v = factory(require, exports);
-        if (v !== undefined) module.exports = v;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.KnnModel = void 0;
+const Model_1 = require("../Model");
+const InstanceList_1 = require("../../InstanceList/InstanceList");
+const CompositeInstance_1 = require("../../Instance/CompositeInstance");
+const KnnInstance_1 = require("./KnnInstance");
+const EuclidianDistance_1 = require("../../DistanceMetric/EuclidianDistance");
+const FileContents_1 = require("nlptoolkit-util/dist/FileContents");
+class KnnModel extends Model_1.Model {
+    data;
+    k;
+    distanceMetric;
+    /**
+     * Constructor that sets the data {@link InstanceList}, k value and the {@link DistanceMetric}.
+     *
+     * @param data           {@link InstanceList} input.
+     * @param k              K value.
+     * @param distanceMetric {@link DistanceMetric} input.
+     */
+    constructor1(data, k, distanceMetric) {
+        this.data = data;
+        this.k = k;
+        this.distanceMetric = distanceMetric;
     }
-    else if (typeof define === "function" && define.amd) {
-        define(["require", "exports", "../Model", "../../InstanceList/InstanceList", "../../Instance/CompositeInstance", "./KnnInstance", "../../DistanceMetric/EuclidianDistance", "nlptoolkit-util/dist/FileContents"], factory);
+    /**
+     * Loads a K-nearest neighbor model from an input model file.
+     * @param fileName Model file name.
+     */
+    constructor2(fileName) {
+        this.distanceMetric = new EuclidianDistance_1.EuclidianDistance();
+        let input = new FileContents_1.FileContents(fileName);
+        this.k = parseInt(input.readLine());
+        this.data = this.loadInstanceList(input);
     }
-})(function (require, exports) {
-    "use strict";
-    Object.defineProperty(exports, "__esModule", { value: true });
-    exports.KnnModel = void 0;
-    const Model_1 = require("../Model");
-    const InstanceList_1 = require("../../InstanceList/InstanceList");
-    const CompositeInstance_1 = require("../../Instance/CompositeInstance");
-    const KnnInstance_1 = require("./KnnInstance");
-    const EuclidianDistance_1 = require("../../DistanceMetric/EuclidianDistance");
-    const FileContents_1 = require("nlptoolkit-util/dist/FileContents");
-    class KnnModel extends Model_1.Model {
-        /**
-         * Constructor that sets the data {@link InstanceList}, k value and the {@link DistanceMetric}.
-         *
-         * @param data           {@link InstanceList} input.
-         * @param k              K value.
-         * @param distanceMetric {@link DistanceMetric} input.
-         */
-        constructor1(data, k, distanceMetric) {
-            this.data = data;
-            this.k = k;
-            this.distanceMetric = distanceMetric;
+    /**
+     * The predict method takes an {@link Instance} as an input and finds the nearest neighbors of given instance. Then
+     * it returns the first possible class label as the predicted class.
+     *
+     * @param instance {@link Instance} to make prediction.
+     * @return The first possible class label as the predicted class.
+     */
+    predict(instance) {
+        let nearestNeighbors = this.nearestNeighbors(instance);
+        let predictedClass;
+        if (instance instanceof CompositeInstance_1.CompositeInstance && nearestNeighbors.size() == 0) {
+            predictedClass = instance.getPossibleClassLabels()[0];
         }
-        /**
-         * Loads a K-nearest neighbor model from an input model file.
-         * @param fileName Model file name.
-         */
-        constructor2(fileName) {
-            this.distanceMetric = new EuclidianDistance_1.EuclidianDistance();
-            let input = new FileContents_1.FileContents(fileName);
-            this.k = parseInt(input.readLine());
-            this.data = this.loadInstanceList(input);
+        else {
+            predictedClass = Model_1.Model.getMaximum(nearestNeighbors.getClassLabels());
         }
-        /**
-         * The predict method takes an {@link Instance} as an input and finds the nearest neighbors of given instance. Then
-         * it returns the first possible class label as the predicted class.
-         *
-         * @param instance {@link Instance} to make prediction.
-         * @return The first possible class label as the predicted class.
-         */
-        predict(instance) {
-            let nearestNeighbors = this.nearestNeighbors(instance);
-            let predictedClass;
-            if (instance instanceof CompositeInstance_1.CompositeInstance && nearestNeighbors.size() == 0) {
-                predictedClass = instance.getPossibleClassLabels()[0];
-            }
-            else {
-                predictedClass = Model_1.Model.getMaximum(nearestNeighbors.getClassLabels());
-            }
-            return predictedClass;
-        }
-        /**
-         * Calculates the posterior probability distribution for the given instance according to K-means model.
-         * @param instance Instance for which posterior probability distribution is calculated.
-         * @return Posterior probability distribution for the given instance.
-         */
-        predictProbability(instance) {
-            let nearestNeighbors = this.nearestNeighbors(instance);
-            return nearestNeighbors.classDistribution().getProbabilityDistribution();
+        return predictedClass;
+    }
+    /**
+     * Calculates the posterior probability distribution for the given instance according to K-means model.
+     * @param instance Instance for which posterior probability distribution is calculated.
+     * @return Posterior probability distribution for the given instance.
+     */
+    predictProbability(instance) {
+        let nearestNeighbors = this.nearestNeighbors(instance);
+        return nearestNeighbors.classDistribution().getProbabilityDistribution();
+    }
+    /**
+     * The nearestNeighbors method takes an {@link Instance} as an input. First it gets the possible class labels, then loops
+     * through the data {@link InstanceList} and creates new {@link Array} of {@link KnnInstance}s and adds the corresponding data with
+     * the distance between data and given instance. After sorting this newly created ArrayList, it loops k times and
+     * returns the first k instances as an {@link InstanceList}.
+     *
+     * @param instance {@link Instance} to find nearest neighbors/
+     * @return The first k instances which are nearest to the given instance as an {@link InstanceList}.
+     */
+    nearestNeighbors(instance) {
+        let result = new InstanceList_1.InstanceList();
+        let instances = new Array();
+        let possibleClassLabels = undefined;
+        if (instance instanceof CompositeInstance_1.CompositeInstance) {
+            possibleClassLabels = instance.getPossibleClassLabels();
         }
-        /**
-         * The nearestNeighbors method takes an {@link Instance} as an input. First it gets the possible class labels, then loops
-         * through the data {@link InstanceList} and creates new {@link Array} of {@link KnnInstance}s and adds the corresponding data with
-         * the distance between data and given instance. After sorting this newly created ArrayList, it loops k times and
-         * returns the first k instances as an {@link InstanceList}.
-         *
-         * @param instance {@link Instance} to find nearest neighbors/
-         * @return The first k instances which are nearest to the given instance as an {@link InstanceList}.
-         */
-        nearestNeighbors(instance) {
-            let result = new InstanceList_1.InstanceList();
-            let instances = new Array();
-            let possibleClassLabels = undefined;
-            if (instance instanceof CompositeInstance_1.CompositeInstance) {
-                possibleClassLabels = instance.getPossibleClassLabels();
-            }
-            for (let i = 0; i < this.data.size(); i++) {
-                if (!(instance instanceof CompositeInstance_1.CompositeInstance) || possibleClassLabels.includes(this.data.get(i).getClassLabel())) {
-                    instances.push(new KnnInstance_1.KnnInstance(this.data.get(i), this.distanceMetric.distance(this.data.get(i), instance)));
-                }
+        for (let i = 0; i < this.data.size(); i++) {
+            if (!(instance instanceof CompositeInstance_1.CompositeInstance) || possibleClassLabels.includes(this.data.get(i).getClassLabel())) {
+                instances.push(new KnnInstance_1.KnnInstance(this.data.get(i), this.distanceMetric.distance(this.data.get(i), instance)));
             }
-            instances.sort((a, b) => a.getDistance() < b.getDistance() ? -1 : a.getDistance() > b.getDistance() ? 1 : 0);
-            for (let i = 0; i < Math.min(this.k, instances.length); i++) {
-                result.add(instances[i].getInstance());
-            }
-            return result;
-        }
-        saveTxt(fileName) {
-        }
-        /**
-         * Training algorithm for K-nearest neighbor classifier.
-         *
-         * @param trainSet   Training data given to the algorithm.
-         * @param parameters K: k parameter of the K-nearest neighbor algorithm
-         *                   distanceMetric: distance metric used to calculate the distance between two instances.
-         */
-        train(trainSet, parameters) {
-            this.constructor1(trainSet, parameters.getK(), parameters.getDistanceMetric());
         }
-        /**
-         * Loads the K-nearest neighbor model from an input file.
-         * @param fileName File name of the K-nearest neighbor model.
-         */
-        loadModel(fileName) {
-            this.constructor2(fileName);
+        instances.sort((a, b) => a.getDistance() < b.getDistance() ? -1 : a.getDistance() > b.getDistance() ? 1 : 0);
+        for (let i = 0; i < Math.min(this.k, instances.length); i++) {
+            result.add(instances[i].getInstance());
         }
+        return result;
+    }
+    saveTxt(fileName) {
+    }
+    /**
+     * Training algorithm for K-nearest neighbor classifier.
+     *
+     * @param trainSet   Training data given to the algorithm.
+     * @param parameters K: k parameter of the K-nearest neighbor algorithm
+     *                   distanceMetric: distance metric used to calculate the distance between two instances.
+     */
+    train(trainSet, parameters) {
+        this.constructor1(trainSet, parameters.getK(), parameters.getDistanceMetric());
+    }
+    /**
+     * Loads the K-nearest neighbor model from an input file.
+     * @param fileName File name of the K-nearest neighbor model.
+     */
+    loadModel(fileName) {
+        this.constructor2(fileName);
     }
-    exports.KnnModel = KnnModel;
-});
+}
+exports.KnnModel = KnnModel;
 //# sourceMappingURL=KnnModel.js.map

package/dist/Model/NonParametric/KnnModel.js.map

@@ -1 +1 @@
-{"version":3,"file":"KnnModel.js","sourceRoot":"","sources":["../../../source/Model/NonParametric/KnnModel.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,oCAA+B;IAC/B,kEAA6D;IAG7D,wEAAmE;IACnE,+CAA0C;IAC1C,8EAAyE;IACzE,oEAA+D;IAI/D,MAAa,QAAS,SAAQ,aAAK;QAM/B;;;;;;WAMG;QACH,YAAY,CAAC,IAAkB,EAAE,CAAS,EAAE,cAA8B;YACtE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;YAChB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;YACV,IAAI,CAAC,cAAc,GAAG,cAAc,CAAA;QACxC,CAAC;QAED;;;WAGG;QACH,YAAY,CAAC,QAAgB;YACzB,IAAI,CAAC,cAAc,GAAG,IAAI,qCAAiB,EAAE,CAAA;YAC7C,IAAI,KAAK,GAAG,IAAI,2BAAY,CAAC,QAAQ,CAAC,CAAA;YACtC,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAA;YACnC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAA;QAC5C,CAAC;QAED;;;;;;WAMG;QACH,OAAO,CAAC,QAAkB;YACtB,IAAI,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;YACvD,IAAI,cAAc,CAAA;YAClB,IAAI,QAAQ,YAAY,qCAAiB,IAAI,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE;gBACvE,cAAc,GAAwB,QAAS,CAAC,sBAAsB,EAAE,CAAC,CAAC,CAAC,CAAC;aAC/E;iBAAM;gBACH,cAAc,GAAG,aAAK,CAAC,UAAU,CAAC,gBAAgB,CAAC,cAAc,EAAE,CAAC,CAAC;aACxE;YACD,OAAO,cAAc,CAAC;QAC1B,CAAC;QAED;;;;WAIG;QACH,kBAAkB,CAAC,QAAkB;YACjC,IAAI,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;YACvD,OAAO,gBAAgB,CAAC,iBAAiB,EAAE,CAAC,0BAA0B,EAAE,CAAC;QAC7E,CAAC;QAED;;;;;;;;WAQG;QACH,gBAAgB,CAAC,QAAkB;YAC/B,IAAI,MAAM,GAAG,IAAI,2BAAY,EAAE,CAAC;YAChC,IAAI,SAAS,GAAG,IAAI,KAAK,EAAe,CAAC;YACzC,IAAI,mBAAmB,GAAG,SAAS,CAAC;YACpC,IAAI,QAAQ,YAAY,qCAAiB,EAAE;gBACvC,mBAAmB,GAAwB,QAAS,CAAC,sBAAsB,EAAE,CAAC;aACjF;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE;gBACvC,IAAI,CAAC,CAAC,QAAQ,YAAY,qCAAiB,CAAC,IAAI,mBAAmB,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,EAAE;oBAC5G,SAAS,CAAC,IAAI,CAAC,IAAI,yBAAW,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;iBAC/G;aACJ;YACD,SAAS,CAAC,IAAI,CAAC,CAAC,CAAc,EAAE,CAAc,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA,CAAC,CAAC,CAAC,CAAC,CAAC;YACtI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE;gBACzD,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;aAC1C;YACD,OAAO,MAAM,CAAC;QAClB,CAAC;QAED,OAAO,CAAC,QAAgB;QACxB,CAAC;QAED;;;;;;WAMG;QACH,KAAK,CAAC,QAAsB,EAAE,UAAqB;YAC/C,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAkB,UAAW,CAAC,IAAI,EAAE,EAAkB,UAAW,CAAC,iBAAiB,EAAE,CAAC,CAAC;QACrH,CAAC;QAED;;;WAGG;QACH,SAAS,CAAC,QAAgB;YACtB,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAA;QAC/B,CAAC;KAEJ;IA5GD,4BA4GC"}
+{"version":3,"file":"KnnModel.js","sourceRoot":"","sources":["../../../source/Model/NonParametric/KnnModel.ts"],"names":[],"mappings":";;;AAAA,oCAA+B;AAC/B,kEAA6D;AAG7D,wEAAmE;AACnE,+CAA0C;AAC1C,8EAAyE;AACzE,oEAA+D;AAI/D,MAAa,QAAS,SAAQ,aAAK;IAEvB,IAAI,CAAc;IAClB,CAAC,CAAQ;IACT,cAAc,CAAgB;IAEtC;;;;;;OAMG;IACH,YAAY,CAAC,IAAkB,EAAE,CAAS,EAAE,cAA8B;QACtE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;QACV,IAAI,CAAC,cAAc,GAAG,cAAc,CAAA;IACxC,CAAC;IAED;;;OAGG;IACH,YAAY,CAAC,QAAgB;QACzB,IAAI,CAAC,cAAc,GAAG,IAAI,qCAAiB,EAAE,CAAA;QAC7C,IAAI,KAAK,GAAG,IAAI,2BAAY,CAAC,QAAQ,CAAC,CAAA;QACtC,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAA;QACnC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAA;IAC5C,CAAC;IAED;;;;;;OAMG;IACH,OAAO,CAAC,QAAkB;QACtB,IAAI,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,cAAc,CAAA;QAClB,IAAI,QAAQ,YAAY,qCAAiB,IAAI,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;YACxE,cAAc,GAAwB,QAAS,CAAC,sBAAsB,EAAE,CAAC,CAAC,CAAC,CAAC;QAChF,CAAC;aAAM,CAAC;YACJ,cAAc,GAAG,aAAK,CAAC,UAAU,CAAC,gBAAgB,CAAC,cAAc,EAAE,CAAC,CAAC;QACzE,CAAC;QACD,OAAO,cAAc,CAAC;IAC1B,CAAC;IAED;;;;OAIG;IACH,kBAAkB,CAAC,QAAkB;QACjC,IAAI,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QACvD,OAAO,gBAAgB,CAAC,iBAAiB,EAAE,CAAC,0BAA0B,EAAE,CAAC;IAC7E,CAAC;IAED;;;;;;;;OAQG;IACH,gBAAgB,CAAC,QAAkB;QAC/B,IAAI,MAAM,GAAG,IAAI,2BAAY,EAAE,CAAC;QAChC,IAAI,SAAS,GAAG,IAAI,KAAK,EAAe,CAAC;QACzC,IAAI,mBAAmB,GAAG,SAAS,CAAC;QACpC,IAAI,QAAQ,YAAY,qCAAiB,EAAE,CAAC;YACxC,mBAAmB,GAAwB,QAAS,CAAC,sBAAsB,EAAE,CAAC;QAClF,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,IAAI,CAAC,CAAC,QAAQ,YAAY,qCAAiB,CAAC,IAAI,mBAAmB,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,EAAE,CAAC;gBAC7G,SAAS,CAAC,IAAI,CAAC,IAAI,yBAAW,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;YAChH,CAAC;QACL,CAAC;QACD,SAAS,CAAC,IAAI,CAAC,CAAC,CAAc,EAAE,CAAc,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA,CAAC,CAAC,CAAC,CAAC,CAAC;QACtI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1D,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;QAC3C,CAAC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED,OAAO,CAAC,QAAgB;IACxB,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,QAAsB,EAAE,UAAqB;QAC/C,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAkB,UAAW,CAAC,IAAI,EAAE,EAAkB,UAAW,CAAC,iBAAiB,EAAE,CAAC,CAAC;IACrH,CAAC;IAED;;;OAGG;IACH,SAAS,CAAC,QAAgB;QACtB,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAA;IAC/B,CAAC;CAEJ;AA5GD,4BA4GC"}

package/dist/Model/Parametric/GaussianModel.js

@@ -1,104 +1,95 @@
-(function (factory) {
-    if (typeof module === "object" && typeof module.exports === "object") {
-        var v = factory(require, exports);
-        if (v !== undefined) module.exports = v;
-    }
-    else if (typeof define === "function" && define.amd) {
-        define(["require", "exports", "nlptoolkit-math/dist/DiscreteDistribution", "../ValidatedModel", "../../Instance/CompositeInstance", "nlptoolkit-math/dist/Vector"], factory);
-    }
-})(function (require, exports) {
-    "use strict";
-    Object.defineProperty(exports, "__esModule", { value: true });
-    exports.GaussianModel = void 0;
-    const DiscreteDistribution_1 = require("nlptoolkit-math/dist/DiscreteDistribution");
-    const ValidatedModel_1 = require("../ValidatedModel");
-    const CompositeInstance_1 = require("../../Instance/CompositeInstance");
-    const Vector_1 = require("nlptoolkit-math/dist/Vector");
-    class GaussianModel extends ValidatedModel_1.ValidatedModel {
-        /**
-         * The predict method takes an Instance as an input. First it gets the size of prior distribution and loops this size times.
-         * Then it gets the possible class labels and and calculates metric value. At the end, it returns the class which has the
-         * maximum value of metric.
-         *
-         * @param instance {@link Instance} to predict.
-         * @return The class which has the maximum value of metric.
-         */
-        predict(instance) {
-            let maxMetric = Number.NEGATIVE_INFINITY;
-            let predictedClass, size;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GaussianModel = void 0;
+const DiscreteDistribution_1 = require("nlptoolkit-math/dist/DiscreteDistribution");
+const ValidatedModel_1 = require("../ValidatedModel");
+const CompositeInstance_1 = require("../../Instance/CompositeInstance");
+const Vector_1 = require("nlptoolkit-math/dist/Vector");
+class GaussianModel extends ValidatedModel_1.ValidatedModel {
+    priorDistribution;
+    /**
+     * The predict method takes an Instance as an input. First it gets the size of prior distribution and loops this size times.
+     * Then it gets the possible class labels and and calculates metric value. At the end, it returns the class which has the
+     * maximum value of metric.
+     *
+     * @param instance {@link Instance} to predict.
+     * @return The class which has the maximum value of metric.
+     */
+    predict(instance) {
+        let maxMetric = Number.NEGATIVE_INFINITY;
+        let predictedClass, size;
+        if (instance instanceof CompositeInstance_1.CompositeInstance) {
+            predictedClass = instance.getPossibleClassLabels()[0];
+            size = instance.getPossibleClassLabels().length;
+        }
+        else {
+            predictedClass = this.priorDistribution.getMaxItem();
+            size = this.priorDistribution.size;
+        }
+        for (let i = 0; i < size; i++) {
+            let Ci;
             if (instance instanceof CompositeInstance_1.CompositeInstance) {
-                predictedClass = instance.getPossibleClassLabels()[0];
-                size = instance.getPossibleClassLabels().length;
+                Ci = instance.getPossibleClassLabels()[i];
             }
             else {
-                predictedClass = this.priorDistribution.getMaxItem();
-                size = this.priorDistribution.size;
+                Ci = this.priorDistribution.getItem(i);
             }
-            for (let i = 0; i < size; i++) {
-                let Ci;
-                if (instance instanceof CompositeInstance_1.CompositeInstance) {
-                    Ci = instance.getPossibleClassLabels()[i];
-                }
-                else {
-                    Ci = this.priorDistribution.getItem(i);
-                }
-                if (this.priorDistribution.containsItem(Ci)) {
-                    let metric = this.calculateMetric(instance, Ci);
-                    if (metric > maxMetric) {
-                        maxMetric = metric;
-                        predictedClass = Ci;
-                    }
+            if (this.priorDistribution.containsItem(Ci)) {
+                let metric = this.calculateMetric(instance, Ci);
+                if (metric > maxMetric) {
+                    maxMetric = metric;
+                    predictedClass = Ci;
                 }
             }
-            return predictedClass;
         }
-        /**
-         * Loads the prior probability distribution from an input model file.
-         * @param input Input model file.
-         * @return Prior probability distribution.
-         * @throws IOException If the input file can not be read, the method throws IOException.
-         */
-        loadPriorDistribution(input) {
-            let size = parseInt(input.readLine());
-            this.priorDistribution = new DiscreteDistribution_1.DiscreteDistribution();
-            for (let i = 0; i < size; i++) {
-                let line = input.readLine();
-                let items = line.split(" ");
-                for (let j = 0; j < parseInt(items[1]); j++) {
-                    this.priorDistribution.addItem(items[0]);
-                }
+        return predictedClass;
+    }
+    /**
+     * Loads the prior probability distribution from an input model file.
+     * @param input Input model file.
+     * @return Prior probability distribution.
+     * @throws IOException If the input file can not be read, the method throws IOException.
+     */
+    loadPriorDistribution(input) {
+        let size = parseInt(input.readLine());
+        this.priorDistribution = new DiscreteDistribution_1.DiscreteDistribution();
+        for (let i = 0; i < size; i++) {
+            let line = input.readLine();
+            let items = line.split(" ");
+            for (let j = 0; j < parseInt(items[1]); j++) {
+                this.priorDistribution.addItem(items[0]);
             }
-            return size;
         }
-        /**
-         * Loads hash map of vectors from input model file.
-         * @param input Input model file.
-         * @param size Number of vectors to be read from input model file.
-         * @return Hash map of vectors.
-         * @throws IOException If the input file can not be read, the method throws IOException.
-         */
-        loadVectors(input, size) {
-            let map = new Map();
-            for (let i = 0; i < size; i++) {
-                let line = input.readLine();
-                let items = line.split(" ");
-                let vector = new Vector_1.Vector(parseInt(items[1]), 0);
-                for (let j = 2; j < items.length; j++) {
-                    vector.setValue(j - 2, parseFloat(items[j]));
-                }
-                map.set(items[0], vector);
+        return size;
+    }
+    /**
+     * Loads hash map of vectors from input model file.
+     * @param input Input model file.
+     * @param size Number of vectors to be read from input model file.
+     * @return Hash map of vectors.
+     * @throws IOException If the input file can not be read, the method throws IOException.
+     */
+    loadVectors(input, size) {
+        let map = new Map();
+        for (let i = 0; i < size; i++) {
+            let line = input.readLine();
+            let items = line.split(" ");
+            let vector = new Vector_1.Vector(parseInt(items[1]), 0);
+            for (let j = 2; j < items.length; j++) {
+                vector.setValue(j - 2, parseFloat(items[j]));
             }
-            return map;
-        }
-        /**
-         * Calculates the posterior probability distribution for the given instance according to Gaussian model.
-         * @param instance Instance for which posterior probability distribution is calculated.
-         * @return Posterior probability distribution for the given instance.
-         */
-        predictProbability(instance) {
-            return undefined;
+            map.set(items[0], vector);
         }
+        return map;
+    }
+    /**
+     * Calculates the posterior probability distribution for the given instance according to Gaussian model.
+     * @param instance Instance for which posterior probability distribution is calculated.
+     * @return Posterior probability distribution for the given instance.
+     */
+    predictProbability(instance) {
+        return undefined;
     }
-    exports.GaussianModel = GaussianModel;
-});
+}
+exports.GaussianModel = GaussianModel;
 //# sourceMappingURL=GaussianModel.js.map

package/dist/Model/Parametric/GaussianModel.js.map

@@ -1 +1 @@
-{"version":3,"file":"GaussianModel.js","sourceRoot":"","sources":["../../../source/Model/Parametric/GaussianModel.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,oFAA+E;IAE/E,sDAAiD;IACjD,wEAAmE;IAEnE,wDAAmD;IAEnD,MAAsB,aAAc,SAAQ,+BAAc;QAatD;;;;;;;WAOG;QACH,OAAO,CAAC,QAAkB;YACtB,IAAI,SAAS,GAAG,MAAM,CAAC,iBAAiB,CAAC;YACzC,IAAI,cAAc,EAAE,IAAI,CAAA;YACxB,IAAI,QAAQ,YAAY,qCAAiB,EAAE;gBACvC,cAAc,GAAwB,QAAS,CAAC,sBAAsB,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC5E,IAAI,GAAwB,QAAS,CAAC,sBAAsB,EAAE,CAAC,MAAM,CAAC;aACzE;iBAAM;gBACH,cAAc,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,EAAE,CAAC;gBACrD,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC;aACtC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;gBAC3B,IAAI,EAAE,CAAA;gBACN,IAAI,QAAQ,YAAY,qCAAiB,EAAE;oBACvC,EAAE,GAAwB,QAAS,CAAC,sBAAsB,EAAE,CAAC,CAAC,CAAC,CAAC;iBACnE;qBAAM;oBACH,EAAE,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;iBAC1C;gBACD,IAAI,IAAI,CAAC,iBAAiB,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE;oBACzC,IAAI,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;oBAChD,IAAI,MAAM,GAAG,SAAS,EAAE;wBACpB,SAAS,GAAG,MAAM,CAAC;wBACnB,cAAc,GAAG,EAAE,CAAC;qBACvB;iBACJ;aACJ;YACD,OAAO,cAAc,CAAC;QAC1B,CAAC;QAED;;;;;WAKG;QACH,qBAAqB,CAAC,KAAmB;YACrC,IAAI,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAA;YACrC,IAAI,CAAC,iBAAiB,GAAG,IAAI,2CAAoB,EAAE,CAAA;YACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAC;gBAC1B,IAAI,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAA;gBAC3B,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAC;oBACxC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;iBAC3C;aACJ;YACD,OAAO,IAAI,CAAA;QACf,CAAC;QAED;;;;;;WAMG;QACH,WAAW,CAAC,KAAmB,EAAE,IAAY;YACzC,IAAI,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAA;YACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAC;gBAC1B,IAAI,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAA;gBAC3B,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;gBAC3B,IAAI,MAAM,GAAG,IAAI,eAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;gBAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAC;oBAClC,MAAM,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;iBAC/C;gBACD,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAA;aAC5B;YACD,OAAO,GAAG,CAAA;QACd,CAAC;QAED;;;;WAIG;QACH,kBAAkB,CAAC,QAAkB;YACjC,OAAO,SAAS,CAAC;QACrB,CAAC;KACJ;IAjGD,sCAiGC"}
+{"version":3,"file":"GaussianModel.js","sourceRoot":"","sources":["../../../source/Model/Parametric/GaussianModel.ts"],"names":[],"mappings":";;;AAAA,oFAA+E;AAE/E,sDAAiD;AACjD,wEAAmE;AAEnE,wDAAmD;AAEnD,MAAsB,aAAc,SAAQ,+BAAc;IAE5C,iBAAiB,CAAsB;IAWjD;;;;;;;OAOG;IACH,OAAO,CAAC,QAAkB;QACtB,IAAI,SAAS,GAAG,MAAM,CAAC,iBAAiB,CAAC;QACzC,IAAI,cAAc,EAAE,IAAI,CAAA;QACxB,IAAI,QAAQ,YAAY,qCAAiB,EAAE,CAAC;YACxC,cAAc,GAAwB,QAAS,CAAC,sBAAsB,EAAE,CAAC,CAAC,CAAC,CAAC;YAC5E,IAAI,GAAwB,QAAS,CAAC,sBAAsB,EAAE,CAAC,MAAM,CAAC;QAC1E,CAAC;aAAM,CAAC;YACJ,cAAc,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,EAAE,CAAC;YACrD,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC;QACvC,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,EAAE,CAAA;YACN,IAAI,QAAQ,YAAY,qCAAiB,EAAE,CAAC;gBACxC,EAAE,GAAwB,QAAS,CAAC,sBAAsB,EAAE,CAAC,CAAC,CAAC,CAAC;YACpE,CAAC;iBAAM,CAAC;gBACJ,EAAE,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC3C,CAAC;YACD,IAAI,IAAI,CAAC,iBAAiB,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC1C,IAAI,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;gBAChD,IAAI,MAAM,GAAG,SAAS,EAAE,CAAC;oBACrB,SAAS,GAAG,MAAM,CAAC;oBACnB,cAAc,GAAG,EAAE,CAAC;gBACxB,CAAC;YACL,CAAC;QACL,CAAC;QACD,OAAO,cAAc,CAAC;IAC1B,CAAC;IAED;;;;;OAKG;IACH,qBAAqB,CAAC,KAAmB;QACrC,IAAI,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAA;QACrC,IAAI,CAAC,iBAAiB,GAAG,IAAI,2CAAoB,EAAE,CAAA;QACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAC,CAAC;YAC3B,IAAI,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAA;YAC3B,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAC,CAAC;gBACzC,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;YAC5C,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAA;IACf,CAAC;IAED;;;;;;OAMG;IACH,WAAW,CAAC,KAAmB,EAAE,IAAY;QACzC,IAAI,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAA;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAC,CAAC;YAC3B,IAAI,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAA;YAC3B,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;YAC3B,IAAI,MAAM,GAAG,IAAI,eAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAC,CAAC;gBACnC,MAAM,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAChD,CAAC;YACD,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAA;QAC7B,CAAC;QACD,OAAO,GAAG,CAAA;IACd,CAAC;IAED;;;;OAIG;IACH,kBAAkB,CAAC,QAAkB;QACjC,OAAO,SAAS,CAAC;IACrB,CAAC;CACJ;AAjGD,sCAiGC"}

package/dist/Model/Parametric/KMeansModel.js

@@ -1,73 +1,65 @@
-(function (factory) {
-    if (typeof module === "object" && typeof module.exports === "object") {
-        var v = factory(require, exports);
-        if (v !== undefined) module.exports = v;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.KMeansModel = void 0;
+const GaussianModel_1 = require("./GaussianModel");
+const InstanceList_1 = require("../../InstanceList/InstanceList");
+const FileContents_1 = require("nlptoolkit-util/dist/FileContents");
+const EuclidianDistance_1 = require("../../DistanceMetric/EuclidianDistance");
+const Partition_1 = require("../../InstanceList/Partition");
+class KMeansModel extends GaussianModel_1.GaussianModel {
+    classMeans;
+    distanceMetric;
+    /**
+     * Loads a K-means model from an input model file.
+     * @param fileName Model file name.
+     */
+    constructor2(fileName) {
+        this.distanceMetric = new EuclidianDistance_1.EuclidianDistance();
+        let input = new FileContents_1.FileContents(fileName);
+        this.loadPriorDistribution(input);
+        this.classMeans = this.loadInstanceList(input);
     }
-    else if (typeof define === "function" && define.amd) {
-        define(["require", "exports", "./GaussianModel", "../../InstanceList/InstanceList", "nlptoolkit-util/dist/FileContents", "../../DistanceMetric/EuclidianDistance", "../../InstanceList/Partition"], factory);
-    }
-})(function (require, exports) {
-    "use strict";
-    Object.defineProperty(exports, "__esModule", { value: true });
-    exports.KMeansModel = void 0;
-    const GaussianModel_1 = require("./GaussianModel");
-    const InstanceList_1 = require("../../InstanceList/InstanceList");
-    const FileContents_1 = require("nlptoolkit-util/dist/FileContents");
-    const EuclidianDistance_1 = require("../../DistanceMetric/EuclidianDistance");
-    const Partition_1 = require("../../InstanceList/Partition");
-    class KMeansModel extends GaussianModel_1.GaussianModel {
-        /**
-         * Loads a K-means model from an input model file.
-         * @param fileName Model file name.
-         */
-        constructor2(fileName) {
-            this.distanceMetric = new EuclidianDistance_1.EuclidianDistance();
-            let input = new FileContents_1.FileContents(fileName);
-            this.loadPriorDistribution(input);
-            this.classMeans = this.loadInstanceList(input);
-        }
-        /**
-         * The calculateMetric method takes an {@link Instance} and a String as inputs. It loops through the class means, if
-         * the corresponding class label is same as the given String it returns the negated distance between given instance and the
-         * current item of class means. Otherwise it returns the smallest negative number.
-         *
-         * @param instance {@link Instance} input.
-         * @param Ci       String input.
-         * @return The negated distance between given instance and the current item of class means.
-         */
-        calculateMetric(instance, Ci) {
-            for (let i = 0; i < this.classMeans.size(); i++) {
-                if (this.classMeans.get(i).getClassLabel() == Ci) {
-                    return -this.distanceMetric.distance(instance, this.classMeans.get(i));
-                }
-            }
-            return Number.NEGATIVE_INFINITY;
-        }
-        saveTxt(fileName) {
-        }
-        /**
-         * Training algorithm for K-Means classifier. K-Means finds the mean of each class for training.
-         *
-         * @param trainSet   Training data given to the algorithm.
-         * @param parameters distanceMetric: distance metric used to calculate the distance between two instances.
-         */
-        train(trainSet, parameters) {
-            this.priorDistribution = trainSet.classDistribution();
-            this.classMeans = new InstanceList_1.InstanceList();
-            let classLists = new Partition_1.Partition(trainSet);
-            for (let i = 0; i < classLists.size(); i++) {
-                this.classMeans.add(classLists.get(i).average());
+    /**
+     * The calculateMetric method takes an {@link Instance} and a String as inputs. It loops through the class means, if
+     * the corresponding class label is same as the given String it returns the negated distance between given instance and the
+     * current item of class means. Otherwise it returns the smallest negative number.
+     *
+     * @param instance {@link Instance} input.
+     * @param Ci       String input.
+     * @return The negated distance between given instance and the current item of class means.
+     */
+    calculateMetric(instance, Ci) {
+        for (let i = 0; i < this.classMeans.size(); i++) {
+            if (this.classMeans.get(i).getClassLabel() == Ci) {
+                return -this.distanceMetric.distance(instance, this.classMeans.get(i));
             }
-            this.distanceMetric = parameters.getDistanceMetric();
         }
-        /**
-         * Loads the K-means model from an input file.
-         * @param fileName File name of the K-means model.
-         */
-        loadModel(fileName) {
-            this.constructor2(fileName);
+        return Number.NEGATIVE_INFINITY;
+    }
+    saveTxt(fileName) {
+    }
+    /**
+     * Training algorithm for K-Means classifier. K-Means finds the mean of each class for training.
+     *
+     * @param trainSet   Training data given to the algorithm.
+     * @param parameters distanceMetric: distance metric used to calculate the distance between two instances.
+     */
+    train(trainSet, parameters) {
+        this.priorDistribution = trainSet.classDistribution();
+        this.classMeans = new InstanceList_1.InstanceList();
+        let classLists = new Partition_1.Partition(trainSet);
+        for (let i = 0; i < classLists.size(); i++) {
+            this.classMeans.add(classLists.get(i).average());
         }
+        this.distanceMetric = parameters.getDistanceMetric();
+    }
+    /**
+     * Loads the K-means model from an input file.
+     * @param fileName File name of the K-means model.
+     */
+    loadModel(fileName) {
+        this.constructor2(fileName);
     }
-    exports.KMeansModel = KMeansModel;
-});
+}
+exports.KMeansModel = KMeansModel;
 //# sourceMappingURL=KMeansModel.js.map

package/dist/Model/Parametric/KMeansModel.js.map

@@ -1 +1 @@
-{"version":3,"file":"KMeansModel.js","sourceRoot":"","sources":["../../../source/Model/Parametric/KMeansModel.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,mDAA8C;IAC9C,kEAA6D;IAG7D,oEAA+D;IAC/D,8EAAyE;IAEzE,4DAAuD;IAGvD,MAAa,WAAY,SAAQ,6BAAa;QAK1C;;;WAGG;QACH,YAAY,CAAC,QAAgB;YACzB,IAAI,CAAC,cAAc,GAAG,IAAI,qCAAiB,EAAE,CAAA;YAC7C,IAAI,KAAK,GAAG,IAAI,2BAAY,CAAC,QAAQ,CAAC,CAAA;YACtC,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAA;YACjC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAA;QAClD,CAAC;QAED;;;;;;;;WAQG;QACH,eAAe,CAAC,QAAkB,EAAE,EAAU;YAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE;gBAC7C,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,IAAI,EAAE,EAAE;oBAC9C,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC1E;aACJ;YACD,OAAO,MAAM,CAAC,iBAAiB,CAAC;QACpC,CAAC;QAED,OAAO,CAAC,QAAgB;QACxB,CAAC;QAED;;;;;WAKG;QACH,KAAK,CAAC,QAAsB,EAAE,UAAqB;YAC/C,IAAI,CAAC,iBAAiB,GAAG,QAAQ,CAAC,iBAAiB,EAAE,CAAC;YACtD,IAAI,CAAC,UAAU,GAAG,IAAI,2BAAY,EAAE,CAAC;YACrC,IAAI,UAAU,GAAG,IAAI,qBAAS,CAAC,QAAQ,CAAC,CAAC;YACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE;gBACxC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;aACpD;YACD,IAAI,CAAC,cAAc,GAAsB,UAAW,CAAC,iBAAiB,EAAE,CAAA;QAC5E,CAAC;QAED;;;WAGG;QACH,SAAS,CAAC,QAAgB;YACtB,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAA;QAC/B,CAAC;KAEJ;IA7DD,kCA6DC"}
+{"version":3,"file":"KMeansModel.js","sourceRoot":"","sources":["../../../source/Model/Parametric/KMeansModel.ts"],"names":[],"mappings":";;;AAAA,mDAA8C;AAC9C,kEAA6D;AAG7D,oEAA+D;AAC/D,8EAAyE;AAEzE,4DAAuD;AAGvD,MAAa,WAAY,SAAQ,6BAAa;IAElC,UAAU,CAAc;IACxB,cAAc,CAAgB;IAEtC;;;OAGG;IACH,YAAY,CAAC,QAAgB;QACzB,IAAI,CAAC,cAAc,GAAG,IAAI,qCAAiB,EAAE,CAAA;QAC7C,IAAI,KAAK,GAAG,IAAI,2BAAY,CAAC,QAAQ,CAAC,CAAA;QACtC,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAA;QACjC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAA;IAClD,CAAC;IAED;;;;;;;;OAQG;IACH,eAAe,CAAC,QAAkB,EAAE,EAAU;QAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,IAAI,EAAE,EAAE,CAAC;gBAC/C,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3E,CAAC;QACL,CAAC;QACD,OAAO,MAAM,CAAC,iBAAiB,CAAC;IACpC,CAAC;IAED,OAAO,CAAC,QAAgB;IACxB,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,QAAsB,EAAE,UAAqB;QAC/C,IAAI,CAAC,iBAAiB,GAAG,QAAQ,CAAC,iBAAiB,EAAE,CAAC;QACtD,IAAI,CAAC,UAAU,GAAG,IAAI,2BAAY,EAAE,CAAC;QACrC,IAAI,UAAU,GAAG,IAAI,qBAAS,CAAC,QAAQ,CAAC,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;QACrD,CAAC;QACD,IAAI,CAAC,cAAc,GAAsB,UAAW,CAAC,iBAAiB,EAAE,CAAA;IAC5E,CAAC;IAED;;;OAGG;IACH,SAAS,CAAC,QAAgB;QACtB,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAA;IAC/B,CAAC;CAEJ;AA7DD,kCA6DC"}