nlptoolkit-classification 1.0.8 → 1.0.9

package/dist/Model/Ensemble/RandomForestModel.js

@@ -1,44 +1,34 @@
-(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", "./TreeEnsembleModel", "../../InstanceList/InstanceList", "../DecisionTree/DecisionTree", "../DecisionTree/DecisionNode"], factory);
-    }
-})(function (require, exports) {
-    "use strict";
-    Object.defineProperty(exports, "__esModule", { value: true });
-    exports.RandomForestModel = void 0;
-    const TreeEnsembleModel_1 = require("./TreeEnsembleModel");
-    const InstanceList_1 = require("../../InstanceList/InstanceList");
-    const DecisionTree_1 = require("../DecisionTree/DecisionTree");
-    const DecisionNode_1 = require("../DecisionTree/DecisionNode");
-    class RandomForestModel extends TreeEnsembleModel_1.TreeEnsembleModel {
-        /**
-         * Training algorithm for random forest classifier. Basically the algorithm creates K distinct decision trees from
-         * K bootstrap samples of the original training set.
-         *
-         * @param trainSet   Training data given to the algorithm
-         * @param parameters Parameters of the bagging trees algorithm. ensembleSize returns the number of trees in the random forest.
-         */
-        train(trainSet, parameters) {
-            let forestSize = parameters.getEnsembleSize();
-            this.forest = new Array();
-            for (let i = 0; i < forestSize; i++) {
-                let bootstrap = trainSet.bootstrap(i);
-                let tree = new DecisionTree_1.DecisionTree(new DecisionNode_1.DecisionNode(new InstanceList_1.InstanceList(bootstrap.getSample()), undefined, parameters, false));
-                this.forest.push(tree);
-            }
-        }
-        /**
-         * Loads the random forest model from an input file.
-         * @param fileName File name of the random forest model.
-         */
-        loadModel(fileName) {
-            this.constructor2(fileName);
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RandomForestModel = void 0;
+const TreeEnsembleModel_1 = require("./TreeEnsembleModel");
+const InstanceList_1 = require("../../InstanceList/InstanceList");
+const DecisionTree_1 = require("../DecisionTree/DecisionTree");
+const DecisionNode_1 = require("../DecisionTree/DecisionNode");
+class RandomForestModel extends TreeEnsembleModel_1.TreeEnsembleModel {
+    /**
+     * Training algorithm for random forest classifier. Basically the algorithm creates K distinct decision trees from
+     * K bootstrap samples of the original training set.
+     *
+     * @param trainSet   Training data given to the algorithm
+     * @param parameters Parameters of the bagging trees algorithm. ensembleSize returns the number of trees in the random forest.
+     */
+    train(trainSet, parameters) {
+        let forestSize = parameters.getEnsembleSize();
+        this.forest = new Array();
+        for (let i = 0; i < forestSize; i++) {
+            let bootstrap = trainSet.bootstrap(i);
+            let tree = new DecisionTree_1.DecisionTree(new DecisionNode_1.DecisionNode(new InstanceList_1.InstanceList(bootstrap.getSample()), undefined, parameters, false));
+            this.forest.push(tree);
         }
     }
-    exports.RandomForestModel = RandomForestModel;
-});
+    /**
+     * Loads the random forest model from an input file.
+     * @param fileName File name of the random forest model.
+     */
+    loadModel(fileName) {
+        this.constructor2(fileName);
+    }
+}
+exports.RandomForestModel = RandomForestModel;
 //# sourceMappingURL=RandomForestModel.js.map

package/dist/Model/Ensemble/RandomForestModel.js.map

@@ -1 +1 @@
-{"version":3,"file":"RandomForestModel.js","sourceRoot":"","sources":["../../../source/Model/Ensemble/RandomForestModel.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,2DAAsD;IACtD,kEAA6D;IAG7D,+DAA0D;IAC1D,+DAA0D;IAE1D,MAAa,iBAAkB,SAAQ,qCAAiB;QAEpD;;;;;;WAMG;QACH,KAAK,CAAC,QAAsB,EAAE,UAAqB;YAC/C,IAAI,UAAU,GAA4B,UAAW,CAAC,eAAe,EAAE,CAAC;YACxE,IAAI,CAAC,MAAM,GAAG,IAAI,KAAK,EAAgB,CAAC;YACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAC;gBAChC,IAAI,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBACtC,IAAI,IAAI,GAAG,IAAI,2BAAY,CAAC,IAAI,2BAAY,CAAC,IAAI,2BAAY,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC,EAAE,SAAS,EAA0B,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC;gBAC7I,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aAC1B;QACL,CAAC;QAED;;;WAGG;QACH,SAAS,CAAC,QAAgB;YACtB,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAA;QAC/B,CAAC;KAEJ;IA3BD,8CA2BC"}
+{"version":3,"file":"RandomForestModel.js","sourceRoot":"","sources":["../../../source/Model/Ensemble/RandomForestModel.ts"],"names":[],"mappings":";;;AAAA,2DAAsD;AACtD,kEAA6D;AAG7D,+DAA0D;AAC1D,+DAA0D;AAE1D,MAAa,iBAAkB,SAAQ,qCAAiB;IAEpD;;;;;;OAMG;IACH,KAAK,CAAC,QAAsB,EAAE,UAAqB;QAC/C,IAAI,UAAU,GAA4B,UAAW,CAAC,eAAe,EAAE,CAAC;QACxE,IAAI,CAAC,MAAM,GAAG,IAAI,KAAK,EAAgB,CAAC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAC,CAAC;YACjC,IAAI,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YACtC,IAAI,IAAI,GAAG,IAAI,2BAAY,CAAC,IAAI,2BAAY,CAAC,IAAI,2BAAY,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC,EAAE,SAAS,EAA0B,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC;YAC7I,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3B,CAAC;IACL,CAAC;IAED;;;OAGG;IACH,SAAS,CAAC,QAAgB;QACtB,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAA;IAC/B,CAAC;CAEJ;AA3BD,8CA2BC"}

package/dist/Model/Ensemble/TreeEnsembleModel.js

@@ -1,70 +1,61 @@
-(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.TreeEnsembleModel = void 0;
+const Model_1 = require("../Model");
+const DecisionTree_1 = require("../DecisionTree/DecisionTree");
+const DiscreteDistribution_1 = require("nlptoolkit-math/dist/DiscreteDistribution");
+const FileContents_1 = require("nlptoolkit-util/dist/FileContents");
+const DecisionNode_1 = require("../DecisionTree/DecisionNode");
+class TreeEnsembleModel extends Model_1.Model {
+    forest;
+    /**
+     * A constructor which sets the {@link Array} of {@link DecisionTree} with given input.
+     *
+     * @param forest An {@link Array} of {@link DecisionTree}.
+     */
+    constructor1(forest) {
+        this.forest = forest;
     }
-    else if (typeof define === "function" && define.amd) {
-        define(["require", "exports", "../Model", "../DecisionTree/DecisionTree", "nlptoolkit-math/dist/DiscreteDistribution", "nlptoolkit-util/dist/FileContents", "../DecisionTree/DecisionNode"], factory);
-    }
-})(function (require, exports) {
-    "use strict";
-    Object.defineProperty(exports, "__esModule", { value: true });
-    exports.TreeEnsembleModel = void 0;
-    const Model_1 = require("../Model");
-    const DecisionTree_1 = require("../DecisionTree/DecisionTree");
-    const DiscreteDistribution_1 = require("nlptoolkit-math/dist/DiscreteDistribution");
-    const FileContents_1 = require("nlptoolkit-util/dist/FileContents");
-    const DecisionNode_1 = require("../DecisionTree/DecisionNode");
-    class TreeEnsembleModel extends Model_1.Model {
-        /**
-         * A constructor which sets the {@link Array} of {@link DecisionTree} with given input.
-         *
-         * @param forest An {@link Array} of {@link DecisionTree}.
-         */
-        constructor1(forest) {
-            this.forest = forest;
-        }
-        /**
-         * Loads a tree ensemble model such as Random Forest model or Bagging model from an input model file.
-         * @param fileName Model file name.
-         */
-        constructor2(fileName) {
-            let input = new FileContents_1.FileContents(fileName);
-            let numberOfTrees = parseInt(input.readLine());
-            this.forest = new Array();
-            for (let i = 0; i < numberOfTrees; i++) {
-                this.forest.push(new DecisionTree_1.DecisionTree(new DecisionNode_1.DecisionNode(input)));
-            }
-        }
-        /**
-         * The predict method takes an {@link Instance} as an input and loops through the {@link ArrayList} of {@link DecisionTree}s.
-         * Makes prediction for the items of that ArrayList and returns the maximum item of that ArrayList.
-         *
-         * @param instance Instance to make prediction.
-         * @return The maximum prediction of a given Instance.
-         */
-        predict(instance) {
-            let distribution = new DiscreteDistribution_1.DiscreteDistribution();
-            for (let tree of this.forest) {
-                distribution.addItem(tree.predict(instance));
-            }
-            return distribution.getMaxItem();
+    /**
+     * Loads a tree ensemble model such as Random Forest model or Bagging model from an input model file.
+     * @param fileName Model file name.
+     */
+    constructor2(fileName) {
+        let input = new FileContents_1.FileContents(fileName);
+        let numberOfTrees = parseInt(input.readLine());
+        this.forest = new Array();
+        for (let i = 0; i < numberOfTrees; i++) {
+            this.forest.push(new DecisionTree_1.DecisionTree(new DecisionNode_1.DecisionNode(input)));
         }
-        /**
-         * Calculates the posterior probability distribution for the given instance according to ensemble tree model.
-         * @param instance Instance for which posterior probability distribution is calculated.
-         * @return Posterior probability distribution for the given instance.
-         */
-        predictProbability(instance) {
-            let distribution = new DiscreteDistribution_1.DiscreteDistribution();
-            for (let tree of this.forest) {
-                distribution.addItem(tree.predict(instance));
-            }
-            return distribution.getProbabilityDistribution();
+    }
+    /**
+     * The predict method takes an {@link Instance} as an input and loops through the {@link ArrayList} of {@link DecisionTree}s.
+     * Makes prediction for the items of that ArrayList and returns the maximum item of that ArrayList.
+     *
+     * @param instance Instance to make prediction.
+     * @return The maximum prediction of a given Instance.
+     */
+    predict(instance) {
+        let distribution = new DiscreteDistribution_1.DiscreteDistribution();
+        for (let tree of this.forest) {
+            distribution.addItem(tree.predict(instance));
         }
-        saveTxt(fileName) {
+        return distribution.getMaxItem();
+    }
+    /**
+     * Calculates the posterior probability distribution for the given instance according to ensemble tree model.
+     * @param instance Instance for which posterior probability distribution is calculated.
+     * @return Posterior probability distribution for the given instance.
+     */
+    predictProbability(instance) {
+        let distribution = new DiscreteDistribution_1.DiscreteDistribution();
+        for (let tree of this.forest) {
+            distribution.addItem(tree.predict(instance));
         }
+        return distribution.getProbabilityDistribution();
+    }
+    saveTxt(fileName) {
     }
-    exports.TreeEnsembleModel = TreeEnsembleModel;
-});
+}
+exports.TreeEnsembleModel = TreeEnsembleModel;
 //# sourceMappingURL=TreeEnsembleModel.js.map

package/dist/Model/Ensemble/TreeEnsembleModel.js.map

@@ -1 +1 @@
-{"version":3,"file":"TreeEnsembleModel.js","sourceRoot":"","sources":["../../../source/Model/Ensemble/TreeEnsembleModel.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,oCAA+B;IAE/B,+DAA0D;IAC1D,oFAA+E;IAC/E,oEAA+D;IAC/D,+DAA0D;IAE1D,MAAsB,iBAAkB,SAAQ,aAAK;QAIjD;;;;WAIG;QACH,YAAY,CAAC,MAA2B;YACpC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAA;QACxB,CAAC;QAED;;;WAGG;QACH,YAAY,CAAC,QAAgB;YACzB,IAAI,KAAK,GAAG,IAAI,2BAAY,CAAC,QAAQ,CAAC,CAAA;YACtC,IAAI,aAAa,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAA;YAC9C,IAAI,CAAC,MAAM,GAAG,IAAI,KAAK,EAAgB,CAAA;YACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAC;gBACnC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,2BAAY,CAAC,IAAI,2BAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;aAC9D;QACL,CAAC;QAED;;;;;;WAMG;QACH,OAAO,CAAC,QAAkB;YACtB,IAAI,YAAY,GAAG,IAAI,2CAAoB,EAAE,CAAC;YAC9C,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE;gBAC1B,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;aAChD;YACD,OAAO,YAAY,CAAC,UAAU,EAAE,CAAC;QACrC,CAAC;QAED;;;;WAIG;QACH,kBAAkB,CAAC,QAAkB;YACjC,IAAI,YAAY,GAAG,IAAI,2CAAoB,EAAE,CAAC;YAC9C,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE;gBAC1B,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;aAChD;YACD,OAAO,YAAY,CAAC,0BAA0B,EAAE,CAAC;QACrD,CAAC;QAED,OAAO,CAAC,QAAgB;QACxB,CAAC;KAEJ;IAzDD,8CAyDC"}
+{"version":3,"file":"TreeEnsembleModel.js","sourceRoot":"","sources":["../../../source/Model/Ensemble/TreeEnsembleModel.ts"],"names":[],"mappings":";;;AAAA,oCAA+B;AAE/B,+DAA0D;AAC1D,oFAA+E;AAC/E,oEAA+D;AAC/D,+DAA0D;AAE1D,MAAsB,iBAAkB,SAAQ,aAAK;IAEvC,MAAM,CAAqB;IAErC;;;;OAIG;IACH,YAAY,CAAC,MAA2B;QACpC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAA;IACxB,CAAC;IAED;;;OAGG;IACH,YAAY,CAAC,QAAgB;QACzB,IAAI,KAAK,GAAG,IAAI,2BAAY,CAAC,QAAQ,CAAC,CAAA;QACtC,IAAI,aAAa,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAA;QAC9C,IAAI,CAAC,MAAM,GAAG,IAAI,KAAK,EAAgB,CAAA;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAC,CAAC;YACpC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,2BAAY,CAAC,IAAI,2BAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;QAC/D,CAAC;IACL,CAAC;IAED;;;;;;OAMG;IACH,OAAO,CAAC,QAAkB;QACtB,IAAI,YAAY,GAAG,IAAI,2CAAoB,EAAE,CAAC;QAC9C,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC3B,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;QACjD,CAAC;QACD,OAAO,YAAY,CAAC,UAAU,EAAE,CAAC;IACrC,CAAC;IAED;;;;OAIG;IACH,kBAAkB,CAAC,QAAkB;QACjC,IAAI,YAAY,GAAG,IAAI,2CAAoB,EAAE,CAAC;QAC9C,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC3B,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;QACjD,CAAC;QACD,OAAO,YAAY,CAAC,0BAA0B,EAAE,CAAC;IACrD,CAAC;IAED,OAAO,CAAC,QAAgB;IACxB,CAAC;CAEJ;AAzDD,8CAyDC"}

package/dist/Model/Model.js

@@ -1,153 +1,143 @@
-(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", "../Instance/Instance", "nlptoolkit-datastructure/dist/CounterHashMap", "../InstanceList/InstanceList", "nlptoolkit-math/dist/Matrix", "nlptoolkit-math/dist/DiscreteDistribution", "../Attribute/DiscreteAttribute", "../Attribute/DiscreteIndexedAttribute", "../Performance/ConfusionMatrix", "../Performance/DetailedClassificationPerformance"], factory);
-    }
-})(function (require, exports) {
-    "use strict";
-    Object.defineProperty(exports, "__esModule", { value: true });
-    exports.Model = void 0;
-    const Instance_1 = require("../Instance/Instance");
-    const CounterHashMap_1 = require("nlptoolkit-datastructure/dist/CounterHashMap");
-    const InstanceList_1 = require("../InstanceList/InstanceList");
-    const Matrix_1 = require("nlptoolkit-math/dist/Matrix");
-    const DiscreteDistribution_1 = require("nlptoolkit-math/dist/DiscreteDistribution");
-    const DiscreteAttribute_1 = require("../Attribute/DiscreteAttribute");
-    const DiscreteIndexedAttribute_1 = require("../Attribute/DiscreteIndexedAttribute");
-    const ConfusionMatrix_1 = require("../Performance/ConfusionMatrix");
-    const DetailedClassificationPerformance_1 = require("../Performance/DetailedClassificationPerformance");
-    class Model {
-        /**
-         * Given an array of class labels, returns the maximum occurred one.
-         *
-         * @param classLabels An array of class labels.
-         * @return The class label that occurs most in the array of class labels (mod of class label list).
-         */
-        static getMaximum(classLabels) {
-            let frequencies = new CounterHashMap_1.CounterHashMap();
-            for (let label of classLabels) {
-                frequencies.put(label);
-            }
-            return frequencies.max();
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Model = void 0;
+const Instance_1 = require("../Instance/Instance");
+const CounterHashMap_1 = require("nlptoolkit-datastructure/dist/CounterHashMap");
+const InstanceList_1 = require("../InstanceList/InstanceList");
+const Matrix_1 = require("nlptoolkit-math/dist/Matrix");
+const DiscreteDistribution_1 = require("nlptoolkit-math/dist/DiscreteDistribution");
+const DiscreteAttribute_1 = require("../Attribute/DiscreteAttribute");
+const DiscreteIndexedAttribute_1 = require("../Attribute/DiscreteIndexedAttribute");
+const ConfusionMatrix_1 = require("../Performance/ConfusionMatrix");
+const DetailedClassificationPerformance_1 = require("../Performance/DetailedClassificationPerformance");
+class Model {
+    /**
+     * Given an array of class labels, returns the maximum occurred one.
+     *
+     * @param classLabels An array of class labels.
+     * @return The class label that occurs most in the array of class labels (mod of class label list).
+     */
+    static getMaximum(classLabels) {
+        let frequencies = new CounterHashMap_1.CounterHashMap();
+        for (let label of classLabels) {
+            frequencies.put(label);
         }
-        /**
-         * Loads a single instance from a single line.
-         * @param line Line containing the instance.
-         * @param attributeTypes Type of the attributes of the instance. If th attribute is discrete, it is "DISCRETE",
-         *                       otherwise it is "CONTINUOUS".
-         * @return Instance read from the line.
-         */
-        loadInstance(line, attributeTypes) {
-            let items = line.split(",");
-            let instance = new Instance_1.Instance(items[items.length - 1]);
-            for (let i = 0; i < items.length - 1; i++) {
-                switch (attributeTypes[i]) {
-                    case "DISCRETE":
-                        instance.addAttribute(items[i]);
-                        break;
-                    case "CONTINUOUS":
-                        instance.addAttribute(parseFloat(items[i]));
-                        break;
-                }
-            }
-            return instance;
-        }
-        /**
-         * Loads a discrete distribution from an input model file
-         * @param input Input model file.
-         * @return Discrete distribution read from an input model file.
-         */
-        static loadDiscreteDistribution(input) {
-            let distribution = new DiscreteDistribution_1.DiscreteDistribution();
-            let size = parseInt(input.readLine());
-            for (let i = 0; i < size; i++) {
-                let line = input.readLine();
-                let items = line.split(" ");
-                let count = parseInt(items[1]);
-                for (let j = 0; j < count; j++) {
-                    distribution.addItem(items[0]);
-                }
+        return frequencies.max();
+    }
+    /**
+     * Loads a single instance from a single line.
+     * @param line Line containing the instance.
+     * @param attributeTypes Type of the attributes of the instance. If th attribute is discrete, it is "DISCRETE",
+     *                       otherwise it is "CONTINUOUS".
+     * @return Instance read from the line.
+     */
+    loadInstance(line, attributeTypes) {
+        let items = line.split(",");
+        let instance = new Instance_1.Instance(items[items.length - 1]);
+        for (let i = 0; i < items.length - 1; i++) {
+            switch (attributeTypes[i]) {
+                case "DISCRETE":
+                    instance.addAttribute(items[i]);
+                    break;
+                case "CONTINUOUS":
+                    instance.addAttribute(parseFloat(items[i]));
+                    break;
             }
-            return distribution;
         }
-        /**
-         * Loads an instance list from an input model file.
-         * @param input Input model file.
-         * @return Instance list read from an input model file.
-         */
-        loadInstanceList(input) {
-            let types = input.readLine().split(" ");
-            let instanceCount = parseInt(input.readLine());
-            let instanceList = new InstanceList_1.InstanceList();
-            for (let i = 0; i < instanceCount; i++) {
-                instanceList.add(this.loadInstance(input.readLine(), types));
+        return instance;
+    }
+    /**
+     * Loads a discrete distribution from an input model file
+     * @param input Input model file.
+     * @return Discrete distribution read from an input model file.
+     */
+    static loadDiscreteDistribution(input) {
+        let distribution = new DiscreteDistribution_1.DiscreteDistribution();
+        let size = parseInt(input.readLine());
+        for (let i = 0; i < size; i++) {
+            let line = input.readLine();
+            let items = line.split(" ");
+            let count = parseInt(items[1]);
+            for (let j = 0; j < count; j++) {
+                distribution.addItem(items[0]);
             }
-            return instanceList;
         }
-        /**
-         * Loads a matrix from an input model file.
-         * @param input Input model file.
-         * @return Matrix read from the input model file.
-         */
-        loadMatrix(input) {
-            let items = input.readLine().split(" ");
-            let matrix = new Matrix_1.Matrix(parseInt(items[0]), parseInt(items[1]));
-            for (let j = 0; j < matrix.getRow(); j++) {
-                let line = input.readLine();
-                items = line.split(" ");
-                for (let k = 0; k < matrix.getColumn(); k++) {
-                    matrix.setValue(j, k, parseFloat(items[k]));
-                }
-            }
-            return matrix;
+        return distribution;
+    }
+    /**
+     * Loads an instance list from an input model file.
+     * @param input Input model file.
+     * @return Instance list read from an input model file.
+     */
+    loadInstanceList(input) {
+        let types = input.readLine().split(" ");
+        let instanceCount = parseInt(input.readLine());
+        let instanceList = new InstanceList_1.InstanceList();
+        for (let i = 0; i < instanceCount; i++) {
+            instanceList.add(this.loadInstance(input.readLine(), types));
         }
-        /**
-         * Checks given instance's attribute and returns true if it is a discrete indexed attribute, false otherwise.
-         *
-         * @param instance Instance to check.
-         * @return True if instance is a discrete indexed attribute, false otherwise.
-         */
-        discreteCheck(instance) {
-            for (let i = 0; i < instance.attributeSize(); i++) {
-                if (instance.getAttribute(i) instanceof DiscreteAttribute_1.DiscreteAttribute &&
-                    !(instance.getAttribute(i) instanceof DiscreteIndexedAttribute_1.DiscreteIndexedAttribute)) {
-                    return false;
-                }
+        return instanceList;
+    }
+    /**
+     * Loads a matrix from an input model file.
+     * @param input Input model file.
+     * @return Matrix read from the input model file.
+     */
+    loadMatrix(input) {
+        let items = input.readLine().split(" ");
+        let matrix = new Matrix_1.Matrix(parseInt(items[0]), parseInt(items[1]));
+        for (let j = 0; j < matrix.getRow(); j++) {
+            let line = input.readLine();
+            items = line.split(" ");
+            for (let k = 0; k < matrix.getColumn(); k++) {
+                matrix.setValue(j, k, parseFloat(items[k]));
             }
-            return true;
         }
-        /**
-         * TestClassification an instance list with the current model.
-         *
-         * @param testSet Test data (list of instances) to be tested.
-         * @return The accuracy (and error) of the model as an instance of Performance class.
-         */
-        test(testSet) {
-            let classLabels = testSet.getUnionOfPossibleClassLabels();
-            let confusion = new ConfusionMatrix_1.ConfusionMatrix(classLabels);
-            for (let i = 0; i < testSet.size(); i++) {
-                let instance = testSet.get(i);
-                confusion.classify(instance.getClassLabel(), this.predict(instance));
+        return matrix;
+    }
+    /**
+     * Checks given instance's attribute and returns true if it is a discrete indexed attribute, false otherwise.
+     *
+     * @param instance Instance to check.
+     * @return True if instance is a discrete indexed attribute, false otherwise.
+     */
+    discreteCheck(instance) {
+        for (let i = 0; i < instance.attributeSize(); i++) {
+            if (instance.getAttribute(i) instanceof DiscreteAttribute_1.DiscreteAttribute &&
+                !(instance.getAttribute(i) instanceof DiscreteIndexedAttribute_1.DiscreteIndexedAttribute)) {
+                return false;
             }
-            return new DetailedClassificationPerformance_1.DetailedClassificationPerformance(confusion);
         }
-        /**
-         * Runs current classifier with the given train and test data.
-         *
-         * @param parameter Parameter of the classifier to be trained.
-         * @param trainSet  Training data to be used in training the classifier.
-         * @param testSet   Test data to be tested after training the model.
-         * @return The accuracy (and error) of the trained model as an instance of Performance class.
-         * @throws DiscreteFeaturesNotAllowed Exception for discrete features.
-         */
-        singleRun(parameter, trainSet, testSet) {
-            this.train(trainSet, parameter);
-            return this.test(testSet);
+        return true;
+    }
+    /**
+     * TestClassification an instance list with the current model.
+     *
+     * @param testSet Test data (list of instances) to be tested.
+     * @return The accuracy (and error) of the model as an instance of Performance class.
+     */
+    test(testSet) {
+        let classLabels = testSet.getUnionOfPossibleClassLabels();
+        let confusion = new ConfusionMatrix_1.ConfusionMatrix(classLabels);
+        for (let i = 0; i < testSet.size(); i++) {
+            let instance = testSet.get(i);
+            confusion.classify(instance.getClassLabel(), this.predict(instance));
         }
+        return new DetailedClassificationPerformance_1.DetailedClassificationPerformance(confusion);
+    }
+    /**
+     * Runs current classifier with the given train and test data.
+     *
+     * @param parameter Parameter of the classifier to be trained.
+     * @param trainSet  Training data to be used in training the classifier.
+     * @param testSet   Test data to be tested after training the model.
+     * @return The accuracy (and error) of the trained model as an instance of Performance class.
+     * @throws DiscreteFeaturesNotAllowed Exception for discrete features.
+     */
+    singleRun(parameter, trainSet, testSet) {
+        this.train(trainSet, parameter);
+        return this.test(testSet);
     }
-    exports.Model = Model;
-});
+}
+exports.Model = Model;
 //# sourceMappingURL=Model.js.map

package/dist/Model/Model.js.map

@@ -1 +1 @@
-{"version":3,"file":"Model.js","sourceRoot":"","sources":["../../source/Model/Model.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,mDAA8C;IAC9C,iFAA4E;IAE5E,+DAA0D;IAC1D,wDAAmD;IACnD,oFAA+E;IAE/E,sEAAiE;IACjE,oFAA+E;IAE/E,oEAA+D;IAC/D,wGAAmG;IAEnG,MAAsB,KAAK;QAQvB;;;;;WAKG;QACH,MAAM,CAAC,UAAU,CAAC,WAA0B;YACxC,IAAI,WAAW,GAAG,IAAI,+BAAc,EAAU,CAAC;YAC/C,KAAK,IAAI,KAAK,IAAI,WAAW,EAAE;gBAC3B,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;aAC1B;YACD,OAAO,WAAW,CAAC,GAAG,EAAE,CAAC;QAC7B,CAAC;QAED;;;;;;WAMG;QACH,YAAY,CAAC,IAAY,EAAE,cAAwB;YAC/C,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;YAC3B,IAAI,QAAQ,GAAG,IAAI,mBAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAA;YACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAC;gBACtC,QAAQ,cAAc,CAAC,CAAC,CAAC,EAAC;oBACtB,KAAK,UAAU;wBACX,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;wBAC/B,MAAK;oBACT,KAAK,YAAY;wBACb,QAAQ,CAAC,YAAY,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;wBAC3C,MAAK;iBACZ;aACJ;YACD,OAAO,QAAQ,CAAA;QACnB,CAAC;QAED;;;;WAIG;QACH,MAAM,CAAC,wBAAwB,CAAC,KAAmB;YAC/C,IAAI,YAAY,GAAG,IAAI,2CAAoB,EAAE,CAAA;YAC7C,IAAI,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAA;YACrC,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,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;gBAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAC;oBAC3B,YAAY,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;iBACjC;aACJ;YACD,OAAO,YAAY,CAAA;QACvB,CAAC;QAED;;;;WAIG;QACH,gBAAgB,CAAC,KAAmB;YAChC,IAAI,KAAK,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;YACvC,IAAI,aAAa,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAA;YAC9C,IAAI,YAAY,GAAG,IAAI,2BAAY,EAAE,CAAA;YACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAC;gBACnC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,KAAK,CAAC,CAAC,CAAA;aAC/D;YACD,OAAO,YAAY,CAAC;QACxB,CAAC;QAED;;;;WAIG;QACH,UAAU,CAAC,KAAmB;YAC1B,IAAI,KAAK,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;YACvC,IAAI,MAAM,GAAG,IAAI,eAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,EAAC;gBACrC,IAAI,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAA;gBAC3B,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;gBACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,EAAC;oBACxC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;iBAC9C;aACJ;YACD,OAAO,MAAM,CAAA;QACjB,CAAC;QAED;;;;;WAKG;QACH,aAAa,CAAC,QAAkB;YAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE,EAAE;gBAC/C,IAAI,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,YAAY,qCAAiB;oBACrD,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,YAAY,mDAAwB,CAAC,EAAE;oBACjE,OAAO,KAAK,CAAC;iBAChB;aACJ;YACD,OAAO,IAAI,CAAC;QAChB,CAAC;QAED;;;;;WAKG;QACH,IAAI,CAAC,OAAqB;YACtB,IAAI,WAAW,GAAG,OAAO,CAAC,6BAA6B,EAAE,CAAC;YAC1D,IAAI,SAAS,GAAG,IAAI,iCAAe,CAAC,WAAW,CAAC,CAAC;YACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE;gBACrC,IAAI,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC9B,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,aAAa,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;aACxE;YACD,OAAO,IAAI,qEAAiC,CAAC,SAAS,CAAC,CAAC;QAC5D,CAAC;QAED;;;;;;;;WAQG;QACH,SAAS,CAAC,SAAoB,EAAE,QAAsB,EAAE,OAAqB;YACzE,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;YAChC,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC9B,CAAC;KAEJ;IA/ID,sBA+IC"}
+{"version":3,"file":"Model.js","sourceRoot":"","sources":["../../source/Model/Model.ts"],"names":[],"mappings":";;;AAAA,mDAA8C;AAC9C,iFAA4E;AAE5E,+DAA0D;AAC1D,wDAAmD;AACnD,oFAA+E;AAE/E,sEAAiE;AACjE,oFAA+E;AAE/E,oEAA+D;AAC/D,wGAAmG;AAEnG,MAAsB,KAAK;IAQvB;;;;;OAKG;IACH,MAAM,CAAC,UAAU,CAAC,WAA0B;QACxC,IAAI,WAAW,GAAG,IAAI,+BAAc,EAAU,CAAC;QAC/C,KAAK,IAAI,KAAK,IAAI,WAAW,EAAE,CAAC;YAC5B,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,WAAW,CAAC,GAAG,EAAE,CAAC;IAC7B,CAAC;IAED;;;;;;OAMG;IACH,YAAY,CAAC,IAAY,EAAE,cAAwB;QAC/C,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;QAC3B,IAAI,QAAQ,GAAG,IAAI,mBAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAA;QACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAC,CAAC;YACvC,QAAQ,cAAc,CAAC,CAAC,CAAC,EAAC,CAAC;gBACvB,KAAK,UAAU;oBACX,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;oBAC/B,MAAK;gBACT,KAAK,YAAY;oBACb,QAAQ,CAAC,YAAY,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;oBAC3C,MAAK;YACb,CAAC;QACL,CAAC;QACD,OAAO,QAAQ,CAAA;IACnB,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,wBAAwB,CAAC,KAAmB;QAC/C,IAAI,YAAY,GAAG,IAAI,2CAAoB,EAAE,CAAA;QAC7C,IAAI,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAA;QACrC,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,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;YAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAC,CAAC;gBAC5B,YAAY,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;YAClC,CAAC;QACL,CAAC;QACD,OAAO,YAAY,CAAA;IACvB,CAAC;IAED;;;;OAIG;IACH,gBAAgB,CAAC,KAAmB;QAChC,IAAI,KAAK,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;QACvC,IAAI,aAAa,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAA;QAC9C,IAAI,YAAY,GAAG,IAAI,2BAAY,EAAE,CAAA;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAC,CAAC;YACpC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,KAAK,CAAC,CAAC,CAAA;QAChE,CAAC;QACD,OAAO,YAAY,CAAC;IACxB,CAAC;IAED;;;;OAIG;IACH,UAAU,CAAC,KAAmB;QAC1B,IAAI,KAAK,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;QACvC,IAAI,MAAM,GAAG,IAAI,eAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,EAAC,CAAC;YACtC,IAAI,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAA;YAC3B,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,EAAC,CAAC;gBACzC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAC/C,CAAC;QACL,CAAC;QACD,OAAO,MAAM,CAAA;IACjB,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,QAAkB;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,IAAI,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,YAAY,qCAAiB;gBACrD,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,YAAY,mDAAwB,CAAC,EAAE,CAAC;gBAClE,OAAO,KAAK,CAAC;YACjB,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACH,IAAI,CAAC,OAAqB;QACtB,IAAI,WAAW,GAAG,OAAO,CAAC,6BAA6B,EAAE,CAAC;QAC1D,IAAI,SAAS,GAAG,IAAI,iCAAe,CAAC,WAAW,CAAC,CAAC;QACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,IAAI,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC9B,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,aAAa,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;QACzE,CAAC;QACD,OAAO,IAAI,qEAAiC,CAAC,SAAS,CAAC,CAAC;IAC5D,CAAC;IAED;;;;;;;;OAQG;IACH,SAAS,CAAC,SAAoB,EAAE,QAAsB,EAAE,OAAqB;QACzE,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAChC,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC9B,CAAC;CAEJ;AA/ID,sBA+IC"}