nlptoolkit-classification 1.0.6 → 1.0.8

package/dist/InstanceList/Partition.d.ts

@@ -3,6 +3,51 @@ import { Instance } from "../Instance/Instance";
 import { Random } from "nlptoolkit-util/dist/Random";
 export declare class Partition {
     private multiList;
+    /**
+     * Divides the instances in the instance list into partitions so that all instances of a class are grouped in a
+     * single partition.
+     * @param instanceList Instance list for which partition will be created.
+     */
+    constructor1(instanceList: InstanceList): void;
+    /**
+     * Creates a partition depending on the distinct values of a discrete attribute. If the discrete attribute has 4
+     * distinct values, the resulting partition will have 4 groups, where each group contain instance whose
+     * values of that discrete attribute are the same.
+     *
+     * @param instanceList Instance list for which partition will be created.
+     * @param attributeIndex Index of the discrete attribute.
+     */
+    constructor2(instanceList: InstanceList, attributeIndex: number): void;
+    /**
+     * Creates a stratified partition of the current instance list. In a stratified partition, the percentage of each
+     * class is preserved. For example, let's say there are three classes in the instance list, and let the percentages of
+     * these classes be %20, %30, and %50; then the percentages of these classes in the stratified partitions are the
+     * same, that is, %20, %30, and %50.
+     *
+     * @param instanceList Instance list for which partition will be created.
+     * @param ratio Ratio of the stratified partition. Ratio is between 0 and 1. If the ratio is 0.2, then 20 percent
+     *              of the instances are put in the first group, 80 percent of the instances are put in the second group.
+     * @param random random is used as a random number.
+     * @param stratified If true, stratified partition is obtained.
+     */
+    constructor3(instanceList: InstanceList, ratio: number, random: Random, stratified: boolean): void;
+    /**
+     * Creates a partition depending on the distinct values of a discrete indexed attribute.
+     *
+     * @param instanceList Instance list for which partition will be created.
+     * @param attributeIndex Index of the discrete indexed attribute.
+     * @param attributeValue Value of the attribute.
+     */
+    constructor4(instanceList: InstanceList, attributeIndex: number, attributeValue: number): void;
+    /**
+     * Creates a two group partition depending on the values of a continuous attribute. If the value of the attribute is
+     * less than splitValue, the instance is forwarded to the first group, else it is forwarded to the second group.
+     *
+     * @param instanceList Instance list for which partition will be created.
+     * @param attributeIndex Index of the continuous attribute
+     * @param splitValue     Threshold to divide instances
+     */
+    constructor5(instanceList: InstanceList, attributeIndex: number, splitValue: number): void;
     constructor(instanceList?: InstanceList, attributeIndex?: number, stratifiedOrValue?: any, random?: Random);
     /**
      * Adds given instance list to the list of instance lists.

package/dist/InstanceList/Partition.js

@@ -17,93 +17,148 @@
             this.multiList = new Array();
             if (instanceList != undefined) {
                 if (attributeIndex == undefined) {
-                    let classLabels = instanceList.getDistinctClassLabels();
-                    for (let classLabel of classLabels) {
-                        this.add(new InstanceListOfSameClass_1.InstanceListOfSameClass(classLabel));
-                    }
-                    for (let instance of instanceList.getInstances()) {
-                        this.get(classLabels.indexOf(instance.getClassLabel())).add(instance);
-                    }
+                    this.constructor1(instanceList);
                 }
                 else {
                     if (stratifiedOrValue == undefined) {
-                        let valueList = instanceList.getAttributeValueList(attributeIndex);
-                        for (let value of valueList) {
-                            this.add(new InstanceList_1.InstanceList());
-                        }
-                        for (let instance of instanceList.getInstances()) {
-                            this.get(valueList.indexOf(instance.getAttribute(attributeIndex).getValue())).add(instance);
-                        }
+                        this.constructor2(instanceList, attributeIndex);
                     }
                     else {
                         if (typeof stratifiedOrValue == "boolean") {
-                            this.add(new InstanceList_1.InstanceList());
-                            this.add(new InstanceList_1.InstanceList());
-                            if (stratifiedOrValue) {
-                                let distribution = instanceList.classDistribution();
-                                let counts = new Array(distribution.size).fill(0);
-                                let randomArray = new Array();
-                                for (let i = 0; i < instanceList.size(); i++) {
-                                    randomArray.push(i);
-                                }
-                                if (random != undefined) {
-                                    random.shuffle(randomArray);
-                                }
-                                for (let i = 0; i < instanceList.size(); i++) {
-                                    let instance = instanceList.get(randomArray[i]);
-                                    let classIndex = distribution.getIndex(instance.getClassLabel());
-                                    let ratio = attributeIndex;
-                                    if (counts[classIndex] < instanceList.size() * ratio * distribution.getProbability(instance.getClassLabel())) {
-                                        this.get(0).add(instance);
-                                    }
-                                    else {
-                                        this.get(1).add(instance);
-                                    }
-                                    counts[classIndex]++;
-                                }
-                            }
-                            else {
-                                instanceList.shuffle(random);
-                                for (let i = 0; i < instanceList.size(); i++) {
-                                    let instance = instanceList.get(i);
-                                    let ratio = attributeIndex;
-                                    if (i < instanceList.size() * ratio) {
-                                        this.get(0).add(instance);
-                                    }
-                                    else {
-                                        this.get(1).add(instance);
-                                    }
-                                }
-                            }
+                            this.constructor3(instanceList, attributeIndex, random, stratifiedOrValue);
                         }
                         else {
-                            this.add(new InstanceList_1.InstanceList());
-                            this.add(new InstanceList_1.InstanceList());
                             if (Number.isInteger(stratifiedOrValue)) {
-                                for (let instance of instanceList.getInstances()) {
-                                    if (instance.getAttribute(attributeIndex).getIndex() == stratifiedOrValue) {
-                                        this.get(0).add(instance);
-                                    }
-                                    else {
-                                        this.get(1).add(instance);
-                                    }
-                                }
+                                this.constructor4(instanceList, attributeIndex, stratifiedOrValue);
                             }
                             else {
-                                for (let instance of instanceList.getInstances()) {
-                                    if (instance.getAttribute(attributeIndex).getValue() <= stratifiedOrValue) {
-                                        this.get(0).add(instance);
-                                    }
-                                    else {
-                                        this.get(1).add(instance);
-                                    }
-                                }
+                                this.constructor5(instanceList, attributeIndex, stratifiedOrValue);
                             }
                         }
                     }
                 }
             }
         }
+        /**
+         * Divides the instances in the instance list into partitions so that all instances of a class are grouped in a
+         * single partition.
+         * @param instanceList Instance list for which partition will be created.
+         */
+        constructor1(instanceList) {
+            let classLabels = instanceList.getDistinctClassLabels();
+            for (let classLabel of classLabels) {
+                this.add(new InstanceListOfSameClass_1.InstanceListOfSameClass(classLabel));
+            }
+            for (let instance of instanceList.getInstances()) {
+                this.get(classLabels.indexOf(instance.getClassLabel())).add(instance);
+            }
+        }
+        /**
+         * Creates a partition depending on the distinct values of a discrete attribute. If the discrete attribute has 4
+         * distinct values, the resulting partition will have 4 groups, where each group contain instance whose
+         * values of that discrete attribute are the same.
+         *
+         * @param instanceList Instance list for which partition will be created.
+         * @param attributeIndex Index of the discrete attribute.
+         */
+        constructor2(instanceList, attributeIndex) {
+            let valueList = instanceList.getAttributeValueList(attributeIndex);
+            for (let value of valueList) {
+                this.add(new InstanceList_1.InstanceList());
+            }
+            for (let instance of instanceList.getInstances()) {
+                this.get(valueList.indexOf(instance.getAttribute(attributeIndex).getValue())).add(instance);
+            }
+        }
+        /**
+         * Creates a stratified partition of the current instance list. In a stratified partition, the percentage of each
+         * class is preserved. For example, let's say there are three classes in the instance list, and let the percentages of
+         * these classes be %20, %30, and %50; then the percentages of these classes in the stratified partitions are the
+         * same, that is, %20, %30, and %50.
+         *
+         * @param instanceList Instance list for which partition will be created.
+         * @param ratio Ratio of the stratified partition. Ratio is between 0 and 1. If the ratio is 0.2, then 20 percent
+         *              of the instances are put in the first group, 80 percent of the instances are put in the second group.
+         * @param random random is used as a random number.
+         * @param stratified If true, stratified partition is obtained.
+         */
+        constructor3(instanceList, ratio, random, stratified) {
+            this.add(new InstanceList_1.InstanceList());
+            this.add(new InstanceList_1.InstanceList());
+            if (stratified) {
+                let distribution = instanceList.classDistribution();
+                let counts = new Array(distribution.size).fill(0);
+                let randomArray = new Array();
+                for (let i = 0; i < instanceList.size(); i++) {
+                    randomArray.push(i);
+                }
+                if (random != undefined) {
+                    random.shuffle(randomArray);
+                }
+                for (let i = 0; i < instanceList.size(); i++) {
+                    let instance = instanceList.get(randomArray[i]);
+                    let classIndex = distribution.getIndex(instance.getClassLabel());
+                    if (counts[classIndex] < instanceList.size() * ratio * distribution.getProbability(instance.getClassLabel())) {
+                        this.get(0).add(instance);
+                    }
+                    else {
+                        this.get(1).add(instance);
+                    }
+                    counts[classIndex]++;
+                }
+            }
+            else {
+                instanceList.shuffle(random);
+                for (let i = 0; i < instanceList.size(); i++) {
+                    let instance = instanceList.get(i);
+                    if (i < instanceList.size() * ratio) {
+                        this.get(0).add(instance);
+                    }
+                    else {
+                        this.get(1).add(instance);
+                    }
+                }
+            }
+        }
+        /**
+         * Creates a partition depending on the distinct values of a discrete indexed attribute.
+         *
+         * @param instanceList Instance list for which partition will be created.
+         * @param attributeIndex Index of the discrete indexed attribute.
+         * @param attributeValue Value of the attribute.
+         */
+        constructor4(instanceList, attributeIndex, attributeValue) {
+            this.add(new InstanceList_1.InstanceList());
+            this.add(new InstanceList_1.InstanceList());
+            for (let instance of instanceList.getInstances()) {
+                if (instance.getAttribute(attributeIndex).getIndex() == attributeValue) {
+                    this.get(0).add(instance);
+                }
+                else {
+                    this.get(1).add(instance);
+                }
+            }
+        }
+        /**
+         * Creates a two group partition depending on the values of a continuous attribute. If the value of the attribute is
+         * less than splitValue, the instance is forwarded to the first group, else it is forwarded to the second group.
+         *
+         * @param instanceList Instance list for which partition will be created.
+         * @param attributeIndex Index of the continuous attribute
+         * @param splitValue     Threshold to divide instances
+         */
+        constructor5(instanceList, attributeIndex, splitValue) {
+            this.add(new InstanceList_1.InstanceList());
+            this.add(new InstanceList_1.InstanceList());
+            for (let instance of instanceList.getInstances()) {
+                if (instance.getAttribute(attributeIndex).getValue() <= splitValue) {
+                    this.get(0).add(instance);
+                }
+                else {
+                    this.get(1).add(instance);
+                }
+            }
+        }
         /**
          * Adds given instance list to the list of instance lists.
          *

package/dist/InstanceList/Partition.js.map

@@ -1 +1 @@
-{"version":3,"file":"Partition.js","sourceRoot":"","sources":["../../source/InstanceList/Partition.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,iDAA4C;IAC5C,uEAAkE;IAOlE,MAAa,SAAS;QAIlB,YAAY,YAA2B,EAAE,cAAuB,EAAE,iBAAuB,EAAE,MAAe;YAFlG,cAAS,GAAwB,IAAI,KAAK,EAAgB,CAAA;YAG9D,IAAI,YAAY,IAAI,SAAS,EAAC;gBAC1B,IAAI,cAAc,IAAI,SAAS,EAAC;oBAC5B,IAAI,WAAW,GAAG,YAAY,CAAC,sBAAsB,EAAE,CAAC;oBACxD,KAAK,IAAI,UAAU,IAAI,WAAW,EAAC;wBAC/B,IAAI,CAAC,GAAG,CAAC,IAAI,iDAAuB,CAAC,UAAU,CAAC,CAAC,CAAC;qBACrD;oBACD,KAAK,IAAI,QAAQ,IAAI,YAAY,CAAC,YAAY,EAAE,EAAE;wBAC9C,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qBACzE;iBACJ;qBAAM;oBACH,IAAI,iBAAiB,IAAI,SAAS,EAAC;wBAC/B,IAAI,SAAS,GAAG,YAAY,CAAC,qBAAqB,CAAC,cAAc,CAAC,CAAC;wBACnE,KAAK,IAAI,KAAK,IAAI,SAAS,EAAE;4BACzB,IAAI,CAAC,GAAG,CAAC,IAAI,2BAAY,EAAE,CAAC,CAAC;yBAChC;wBACD,KAAK,IAAI,QAAQ,IAAI,YAAY,CAAC,YAAY,EAAE,EAAE;4BAC9C,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,CAAsB,QAAQ,CAAC,YAAY,CAAC,cAAc,CAAE,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;yBACrH;qBACJ;yBAAM;wBACH,IAAI,OAAO,iBAAiB,IAAI,SAAS,EAAC;4BACtC,IAAI,CAAC,GAAG,CAAC,IAAI,2BAAY,EAAE,CAAC,CAAC;4BAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,2BAAY,EAAE,CAAC,CAAC;4BAC7B,IAAI,iBAAiB,EAAC;gCAClB,IAAI,YAAY,GAAG,YAAY,CAAC,iBAAiB,EAAE,CAAC;gCACpD,IAAI,MAAM,GAAG,IAAI,KAAK,CAAS,YAAY,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;gCACzD,IAAI,WAAW,GAAG,IAAI,KAAK,EAAU,CAAA;gCACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAC;oCACzC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;iCACvB;gCACD,IAAI,MAAM,IAAI,SAAS,EAAC;oCACpB,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,CAAA;iCAC9B;gCACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE;oCAC1C,IAAI,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;oCAChD,IAAI,UAAU,GAAG,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC;oCACjE,IAAI,KAAK,GAAG,cAAc,CAAA;oCAC1B,IAAI,MAAM,CAAC,UAAU,CAAC,GAAG,YAAY,CAAC,IAAI,EAAE,GAAG,KAAK,GAAG,YAAY,CAAC,cAAc,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,EAAE;wCAC1G,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qCAC7B;yCAAM;wCACH,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qCAC7B;oCACD,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC;iCACxB;6BACJ;iCAAM;gCACH,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;gCAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE;oCAC1C,IAAI,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oCACnC,IAAI,KAAK,GAAG,cAAc,CAAA;oCAC1B,IAAI,CAAC,GAAG,YAAY,CAAC,IAAI,EAAE,GAAG,KAAK,EAAE;wCACjC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qCAC7B;yCAAM;wCACH,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qCAC7B;iCACJ;6BACJ;yBACJ;6BAAM;4BACH,IAAI,CAAC,GAAG,CAAC,IAAI,2BAAY,EAAE,CAAC,CAAC;4BAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,2BAAY,EAAE,CAAC,CAAC;4BAC7B,IAAI,MAAM,CAAC,SAAS,CAAC,iBAAiB,CAAC,EAAC;gCACpC,KAAK,IAAI,QAAQ,IAAI,YAAY,CAAC,YAAY,EAAE,EAAE;oCAC9C,IAAgC,QAAQ,CAAC,YAAY,CAAC,cAAc,CAAE,CAAC,QAAQ,EAAE,IAAI,iBAAiB,EAAE;wCACpG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qCAC7B;yCAAM;wCACH,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qCAC7B;iCACJ;6BACJ;iCAAM;gCACH,KAAK,IAAI,QAAQ,IAAI,YAAY,CAAC,YAAY,EAAE,EAAE;oCAC9C,IAA2B,QAAQ,CAAC,YAAY,CAAC,cAAc,CAAE,CAAC,QAAQ,EAAE,IAAI,iBAAiB,EAAE;wCAC/F,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qCAC7B;yCAAM;wCACH,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qCAC7B;iCACJ;6BACJ;yBACJ;qBACJ;iBACJ;aACJ;QACL,CAAC;QAED;;;;WAIG;QACH,GAAG,CAAC,IAAkB;YAClB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC7B,CAAC;QAED;;;;WAIG;QACH,IAAI;YACA,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAA;QAChC,CAAC;QAED;;;;;WAKG;QACH,GAAG,CAAC,KAAa;YACb,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;QAChC,CAAC;QAED;;;;WAIG;QACH,QAAQ;YACJ,IAAI,MAAM,GAAG,IAAI,KAAK,CAAkB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;YAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC5C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC;aACjD;YACD,OAAO,MAAM,CAAC;QAClB,CAAC;KAEJ;IA/HD,8BA+HC"}
+{"version":3,"file":"Partition.js","sourceRoot":"","sources":["../../source/InstanceList/Partition.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,iDAA4C;IAC5C,uEAAkE;IAOlE,MAAa,SAAS;QA4HlB,YAAY,YAA2B,EAAE,cAAuB,EAAE,iBAAuB,EAAE,MAAe;YA1HlG,cAAS,GAAwB,IAAI,KAAK,EAAgB,CAAA;YA2H9D,IAAI,YAAY,IAAI,SAAS,EAAC;gBAC1B,IAAI,cAAc,IAAI,SAAS,EAAC;oBAC5B,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC;iBACnC;qBAAM;oBACH,IAAI,iBAAiB,IAAI,SAAS,EAAC;wBAC/B,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,cAAc,CAAC,CAAA;qBAClD;yBAAM;wBACH,IAAI,OAAO,iBAAiB,IAAI,SAAS,EAAC;4BACtC,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,cAAc,EAAE,MAAM,EAAE,iBAAiB,CAAC,CAAA;yBAC7E;6BAAM;4BACH,IAAI,MAAM,CAAC,SAAS,CAAC,iBAAiB,CAAC,EAAC;gCACpC,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,cAAc,EAAE,iBAAiB,CAAC,CAAC;6BACtE;iCAAM;gCACH,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,cAAc,EAAE,iBAAiB,CAAC,CAAC;6BACtE;yBACJ;qBACJ;iBACJ;aACJ;QACL,CAAC;QA5ID;;;;WAIG;QACH,YAAY,CAAC,YAA0B;YACnC,IAAI,WAAW,GAAG,YAAY,CAAC,sBAAsB,EAAE,CAAC;YACxD,KAAK,IAAI,UAAU,IAAI,WAAW,EAAC;gBAC/B,IAAI,CAAC,GAAG,CAAC,IAAI,iDAAuB,CAAC,UAAU,CAAC,CAAC,CAAC;aACrD;YACD,KAAK,IAAI,QAAQ,IAAI,YAAY,CAAC,YAAY,EAAE,EAAE;gBAC9C,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;aACzE;QACL,CAAC;QAED;;;;;;;WAOG;QACH,YAAY,CAAC,YAA0B,EAAE,cAAsB;YAC3D,IAAI,SAAS,GAAG,YAAY,CAAC,qBAAqB,CAAC,cAAc,CAAC,CAAC;YACnE,KAAK,IAAI,KAAK,IAAI,SAAS,EAAE;gBACzB,IAAI,CAAC,GAAG,CAAC,IAAI,2BAAY,EAAE,CAAC,CAAC;aAChC;YACD,KAAK,IAAI,QAAQ,IAAI,YAAY,CAAC,YAAY,EAAE,EAAE;gBAC9C,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,CAAsB,QAAQ,CAAC,YAAY,CAAC,cAAc,CAAE,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;aACrH;QACL,CAAC;QAED;;;;;;;;;;;WAWG;QACH,YAAY,CAAC,YAA0B,EAAE,KAAa,EAAE,MAAc,EAAE,UAAmB;YACvF,IAAI,CAAC,GAAG,CAAC,IAAI,2BAAY,EAAE,CAAC,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,2BAAY,EAAE,CAAC,CAAC;YAC7B,IAAI,UAAU,EAAC;gBACX,IAAI,YAAY,GAAG,YAAY,CAAC,iBAAiB,EAAE,CAAC;gBACpD,IAAI,MAAM,GAAG,IAAI,KAAK,CAAS,YAAY,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;gBACzD,IAAI,WAAW,GAAG,IAAI,KAAK,EAAU,CAAA;gBACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAC;oBACzC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;iBACvB;gBACD,IAAI,MAAM,IAAI,SAAS,EAAC;oBACpB,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,CAAA;iBAC9B;gBACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE;oBAC1C,IAAI,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;oBAChD,IAAI,UAAU,GAAG,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAC;oBACjE,IAAI,MAAM,CAAC,UAAU,CAAC,GAAG,YAAY,CAAC,IAAI,EAAE,GAAG,KAAK,GAAG,YAAY,CAAC,cAAc,CAAC,QAAQ,CAAC,aAAa,EAAE,CAAC,EAAE;wBAC1G,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qBAC7B;yBAAM;wBACH,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qBAC7B;oBACD,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC;iBACxB;aACJ;iBAAM;gBACH,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;gBAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE;oBAC1C,IAAI,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACnC,IAAI,CAAC,GAAG,YAAY,CAAC,IAAI,EAAE,GAAG,KAAK,EAAE;wBACjC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qBAC7B;yBAAM;wBACH,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;qBAC7B;iBACJ;aACJ;QACL,CAAC;QAED;;;;;;WAMG;QACH,YAAY,CAAC,YAA0B,EAAE,cAAsB,EAAE,cAAsB;YACnF,IAAI,CAAC,GAAG,CAAC,IAAI,2BAAY,EAAE,CAAC,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,2BAAY,EAAE,CAAC,CAAC;YAC7B,KAAK,IAAI,QAAQ,IAAI,YAAY,CAAC,YAAY,EAAE,EAAE;gBAC9C,IAAgC,QAAQ,CAAC,YAAY,CAAC,cAAc,CAAE,CAAC,QAAQ,EAAE,IAAI,cAAc,EAAE;oBACjG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;iBAC7B;qBAAM;oBACH,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;iBAC7B;aACJ;QACL,CAAC;QAED;;;;;;;WAOG;QACH,YAAY,CAAC,YAA0B,EAAE,cAAsB,EAAE,UAAkB;YAC/E,IAAI,CAAC,GAAG,CAAC,IAAI,2BAAY,EAAE,CAAC,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,2BAAY,EAAE,CAAC,CAAC;YAC7B,KAAK,IAAI,QAAQ,IAAI,YAAY,CAAC,YAAY,EAAE,EAAE;gBAC9C,IAA2B,QAAQ,CAAC,YAAY,CAAC,cAAc,CAAE,CAAC,QAAQ,EAAE,IAAI,UAAU,EAAE;oBACxF,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;iBAC7B;qBAAM;oBACH,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;iBAC7B;aACJ;QACL,CAAC;QAwBD;;;;WAIG;QACH,GAAG,CAAC,IAAkB;YAClB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC7B,CAAC;QAED;;;;WAIG;QACH,IAAI;YACA,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAA;QAChC,CAAC;QAED;;;;;WAKG;QACH,GAAG,CAAC,KAAa;YACb,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;QAChC,CAAC;QAED;;;;WAIG;QACH,QAAQ;YACJ,IAAI,MAAM,GAAG,IAAI,KAAK,CAAkB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;YAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC5C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC;aACjD;YACD,OAAO,MAAM,CAAC;QAClB,CAAC;KAEJ;IA3LD,8BA2LC"}

package/dist/Model/DecisionTree/DecisionCondition.d.ts

@@ -12,7 +12,15 @@ export declare class DecisionCondition {
      * @param comparison     Comparison character.
      */
     constructor(attributeIndex: number, value: Attribute, comparison?: string);
+    /**
+     * Accessor for the attribute index.
+     * @return Attribute index.
+     */
     getAttributeIndex(): number;
+    /**
+     * Accessor for the value.
+     * @return Value.
+     */
     getValue(): Attribute;
     /**
      * The satisfy method takes an {@link Instance} as an input.

package/dist/Model/DecisionTree/DecisionCondition.js

@@ -28,9 +28,17 @@
             this.comparison = comparison;
             this.value = value;
         }
+        /**
+         * Accessor for the attribute index.
+         * @return Attribute index.
+         */
         getAttributeIndex() {
             return this.attributeIndex;
         }
+        /**
+         * Accessor for the value.
+         * @return Value.
+         */
         getValue() {
             return this.value;
         }

package/dist/Model/DecisionTree/DecisionCondition.js.map

@@ -1 +1 @@
-{"version":3,"file":"DecisionCondition.js","sourceRoot":"","sources":["../../../source/Model/DecisionTree/DecisionCondition.ts"],"names":[],"mappings":";;;;;;;;;;;;IAEA,uFAAkF;IAClF,yEAAoE;IACpE,6EAAwE;IAExE,MAAa,iBAAiB;QAM1B;;;;;;WAMG;QACH,YAAY,cAAsB,EAAE,KAAgB,EAAE,UAAmB;YAXjE,mBAAc,GAAW,CAAC,CAAC,CAAA;YAC3B,eAAU,GAAW,SAAS,CAAA;YAWlC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;YACrC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;YAC7B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACvB,CAAC;QAED,iBAAiB;YACb,OAAO,IAAI,CAAC,cAAc,CAAA;QAC9B,CAAC;QAED,QAAQ;YACJ,OAAO,IAAI,CAAC,KAAK,CAAA;QACrB,CAAC;QAED;;;;;;;;;;;;;;;WAeG;QACH,OAAO,CAAC,QAAkB;YACtB,IAAI,IAAI,CAAC,KAAK,YAAY,mDAAwB,EAAE;gBAChD,IAAgC,IAAI,CAAC,KAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,EAAE;oBAC1D,OAAmC,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,cAAc,CAAE,CAAC,QAAQ,EAAE,IAAgC,IAAI,CAAC,KAAM,CAAC,QAAQ,EAAE,CAAC;iBACnJ;qBAAM;oBACH,OAAO,IAAI,CAAC;iBACf;aACJ;iBAAM;gBACH,IAAI,IAAI,CAAC,KAAK,YAAY,qCAAiB,EAAE;oBACzC,OAAO,CAAsB,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,cAAc,CAAE,CAAC,QAAQ,EAAE,IAAyB,IAAI,CAAC,KAAM,CAAC,QAAQ,EAAE,CAAC,CAAC;iBACvI;qBAAM;oBACH,IAAI,IAAI,CAAC,KAAK,YAAY,yCAAmB,EAAE;wBAC3C,IAAI,IAAI,CAAC,UAAU,IAAI,GAAG,EAAE;4BACxB,OAA8B,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,cAAc,CAAE,CAAC,QAAQ,EAAE,IAA2B,IAAI,CAAC,KAAM,CAAC,QAAQ,EAAE,CAAC;yBACzI;6BAAM;4BACH,IAAI,IAAI,CAAC,UAAU,IAAI,GAAG,EAAE;gCACxB,OAA8B,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,cAAc,CAAE,CAAC,QAAQ,EAAE,GAA0B,IAAI,CAAC,KAAM,CAAC,QAAQ,EAAE,CAAC;6BACxI;yBACJ;qBACJ;iBACJ;aACJ;YACD,OAAO,KAAK,CAAC;QACjB,CAAC;KACJ;IAnED,8CAmEC"}
+{"version":3,"file":"DecisionCondition.js","sourceRoot":"","sources":["../../../source/Model/DecisionTree/DecisionCondition.ts"],"names":[],"mappings":";;;;;;;;;;;;IAEA,uFAAkF;IAClF,yEAAoE;IACpE,6EAAwE;IAExE,MAAa,iBAAiB;QAM1B;;;;;;WAMG;QACH,YAAY,cAAsB,EAAE,KAAgB,EAAE,UAAmB;YAXjE,mBAAc,GAAW,CAAC,CAAC,CAAA;YAC3B,eAAU,GAAW,SAAS,CAAA;YAWlC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;YACrC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;YAC7B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACvB,CAAC;QAED;;;WAGG;QACH,iBAAiB;YACb,OAAO,IAAI,CAAC,cAAc,CAAA;QAC9B,CAAC;QAED;;;WAGG;QACH,QAAQ;YACJ,OAAO,IAAI,CAAC,KAAK,CAAA;QACrB,CAAC;QAED;;;;;;;;;;;;;;;WAeG;QACH,OAAO,CAAC,QAAkB;YACtB,IAAI,IAAI,CAAC,KAAK,YAAY,mDAAwB,EAAE;gBAChD,IAAgC,IAAI,CAAC,KAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,EAAE;oBAC1D,OAAmC,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,cAAc,CAAE,CAAC,QAAQ,EAAE,IAAgC,IAAI,CAAC,KAAM,CAAC,QAAQ,EAAE,CAAC;iBACnJ;qBAAM;oBACH,OAAO,IAAI,CAAC;iBACf;aACJ;iBAAM;gBACH,IAAI,IAAI,CAAC,KAAK,YAAY,qCAAiB,EAAE;oBACzC,OAAO,CAAsB,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,cAAc,CAAE,CAAC,QAAQ,EAAE,IAAyB,IAAI,CAAC,KAAM,CAAC,QAAQ,EAAE,CAAC,CAAC;iBACvI;qBAAM;oBACH,IAAI,IAAI,CAAC,KAAK,YAAY,yCAAmB,EAAE;wBAC3C,IAAI,IAAI,CAAC,UAAU,IAAI,GAAG,EAAE;4BACxB,OAA8B,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,cAAc,CAAE,CAAC,QAAQ,EAAE,IAA2B,IAAI,CAAC,KAAM,CAAC,QAAQ,EAAE,CAAC;yBACzI;6BAAM;4BACH,IAAI,IAAI,CAAC,UAAU,IAAI,GAAG,EAAE;gCACxB,OAA8B,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,cAAc,CAAE,CAAC,QAAQ,EAAE,GAA0B,IAAI,CAAC,KAAM,CAAC,QAAQ,EAAE,CAAC;6BACxI;yBACJ;qBACJ;iBACJ;aACJ;YACD,OAAO,KAAK,CAAC;QACjB,CAAC;KACJ;IA3ED,8CA2EC"}

package/dist/Model/DecisionTree/DecisionNode.d.ts

@@ -6,11 +6,38 @@ import { FileContents } from "nlptoolkit-util/dist/FileContents";
 export declare class DecisionNode {
     children: Array<DecisionNode>;
     private EPSILON;
-    private data;
     private classLabel;
     leaf: boolean;
     private condition;
+    private classLabelsDistribution;
+    /**
+     * The DecisionNode method takes {@link InstanceList} data as input and then it sets the class label parameter by finding
+     * the most occurred class label of given data, it then gets distinct class labels as class labels ArrayList. Later, it adds ordered
+     * indices to the indexList and shuffles them randomly. Then, it gets the class distribution of given data and finds the best entropy value
+     * of these class distribution.
+     * <p>
+     * If an attribute of given data is {@link DiscreteIndexedAttribute}, it creates a Distribution according to discrete indexed attribute class distribution
+     * and finds the entropy. If it is better than the last best entropy it reassigns the best entropy, best attribute and best split value according to
+     * the newly founded best entropy's index. At the end, it also add new distribution to the class distribution .
+     * <p>
+     * If an attribute of given data is {@link DiscreteAttribute}, it directly finds the entropy. If it is better than the last best entropy it
+     * reassigns the best entropy, best attribute and best split value according to the newly founded best entropy's index.
+     * <p>
+     * If an attribute of given data is {@link ContinuousAttribute}, it creates two distributions; left and right according to class distribution
+     * and discrete distribution respectively, and finds the entropy. If it is better than the last best entropy it reassigns the best entropy,
+     * best attribute and best split value according to the newly founded best entropy's index. At the end, it also add new distribution to
+     * the right distribution and removes from left distribution .
+     *
+     * @param data      {@link InstanceList} input.
+     * @param condition {@link DecisionCondition} to check.
+     * @param parameter RandomForestParameter like seed, ensembleSize, attributeSubsetSize.
+     * @param isStump   Refers to decision trees with only 1 splitting rule.
+     */
     constructor1(data: InstanceList, condition?: DecisionCondition | number, parameter?: RandomForestParameter, isStump?: boolean): void;
+    /**
+     * Reads the decision node model (as one line) from model file.
+     * @param contents Model file
+     */
     constructor2(contents: FileContents): void;
     /**
      * The DecisionNode method takes {@link InstanceList} data as input, and then it sets the class label parameter by finding
@@ -40,6 +67,7 @@ export declare class DecisionNode {
      * The entropyForDiscreteAttribute method takes an attributeIndex and creates an ArrayList of DiscreteDistribution.
      * Then loops through the distributions and calculates the total entropy.
      *
+     * @param data Instance list.
      * @param attributeIndex Index of the attribute.
      * @return Total entropy for the discrete attribute.
      */
@@ -48,6 +76,7 @@ export declare class DecisionNode {
      * The createChildrenForDiscreteIndexed method creates an ArrayList of DecisionNodes as children and a partition with respect to
      * indexed attribute.
      *
+     * @param data Instance list.
      * @param attributeIndex Index of the attribute.
      * @param attributeValue Value of the attribute.
      * @param parameter      RandomForestParameter like seed, ensembleSize, attributeSubsetSize.
@@ -58,6 +87,7 @@ export declare class DecisionNode {
      * The createChildrenForDiscrete method creates an ArrayList of values, a partition with respect to attributes and an ArrayList
      * of DecisionNodes as children.
      *
+     * @param data Instance list.
      * @param attributeIndex Index of the attribute.
      * @param parameter      RandomForestParameter like seed, ensembleSize, attributeSubsetSize.
      * @param isStump        Refers to decision trees with only 1 splitting rule.
@@ -67,6 +97,7 @@ export declare class DecisionNode {
      * The createChildrenForContinuous method creates an ArrayList of DecisionNodes as children and a partition with respect to
      * continuous attribute and the given split value.
      *
+     * @param data Instance list.
      * @param attributeIndex Index of the attribute.
      * @param parameter      RandomForestParameter like seed, ensembleSize, attributeSubsetSize.
      * @param isStump        Refers to decision trees with only 1 splitting rule.
@@ -81,5 +112,12 @@ export declare class DecisionNode {
      * @return The prediction for given instance.
      */
     predict(instance: Instance): string;
+    /**
+     * Recursive method that returns the posterior probability distribution of a given instance. If the node is a leaf
+     * node, it returns the class label distribution, otherwise it checks in which direction (child node) this instance
+     * is forwarded.
+     * @param instance Instance for which the posterior probability distribution is calculated.
+     * @return Posterior probability distribution for this instance.
+     */
     predictProbabilityDistribution(instance: Instance): Map<string, number>;
 }

package/dist/Model/DecisionTree/DecisionNode.js

@@ -48,7 +48,6 @@
         constructor(data, condition, parameter, isStump) {
             this.children = undefined;
             this.EPSILON = 0.0000000001;
-            this.data = undefined;
             this.classLabel = undefined;
             this.leaf = false;
             this.condition = undefined;
@@ -61,14 +60,41 @@
                 }
             }
         }
+        /**
+         * The DecisionNode method takes {@link InstanceList} data as input and then it sets the class label parameter by finding
+         * the most occurred class label of given data, it then gets distinct class labels as class labels ArrayList. Later, it adds ordered
+         * indices to the indexList and shuffles them randomly. Then, it gets the class distribution of given data and finds the best entropy value
+         * of these class distribution.
+         * <p>
+         * If an attribute of given data is {@link DiscreteIndexedAttribute}, it creates a Distribution according to discrete indexed attribute class distribution
+         * and finds the entropy. If it is better than the last best entropy it reassigns the best entropy, best attribute and best split value according to
+         * the newly founded best entropy's index. At the end, it also add new distribution to the class distribution .
+         * <p>
+         * If an attribute of given data is {@link DiscreteAttribute}, it directly finds the entropy. If it is better than the last best entropy it
+         * reassigns the best entropy, best attribute and best split value according to the newly founded best entropy's index.
+         * <p>
+         * If an attribute of given data is {@link ContinuousAttribute}, it creates two distributions; left and right according to class distribution
+         * and discrete distribution respectively, and finds the entropy. If it is better than the last best entropy it reassigns the best entropy,
+         * best attribute and best split value according to the newly founded best entropy's index. At the end, it also add new distribution to
+         * the right distribution and removes from left distribution .
+         *
+         * @param data      {@link InstanceList} input.
+         * @param condition {@link DecisionCondition} to check.
+         * @param parameter RandomForestParameter like seed, ensembleSize, attributeSubsetSize.
+         * @param isStump   Refers to decision trees with only 1 splitting rule.
+         */
         constructor1(data, condition, parameter, isStump) {
             let bestAttribute = -1;
             let bestSplitValue = 0;
             if (condition instanceof DecisionCondition_1.DecisionCondition) {
                 this.condition = condition;
             }
-            this.data = data;
-            this.classLabel = Model_1.Model.getMaximum(data.getClassLabels());
+            this.classLabelsDistribution = new DiscreteDistribution_1.DiscreteDistribution();
+            let labels = data.getClassLabels();
+            for (let label of labels) {
+                this.classLabelsDistribution.addItem(label);
+            }
+            this.classLabel = Model_1.Model.getMaximum(labels);
             this.leaf = true;
             let classLabels = data.getDistinctClassLabels();
             if (classLabels.length == 1) {
@@ -111,7 +137,7 @@
                 }
                 else {
                     if (data.get(0).getAttribute(index) instanceof DiscreteAttribute_1.DiscreteAttribute) {
-                        let entropy = this.entropyForDiscreteAttribute(index);
+                        let entropy = this.entropyForDiscreteAttribute(data, index);
                         if (entropy + this.EPSILON < bestEntropy) {
                             bestEntropy = entropy;
                             bestAttribute = index;
@@ -150,20 +176,24 @@
             if (bestAttribute != -1) {
                 this.leaf = false;
                 if (data.get(0).getAttribute(bestAttribute) instanceof DiscreteIndexedAttribute_1.DiscreteIndexedAttribute) {
-                    this.createChildrenForDiscreteIndexed(bestAttribute, bestSplitValue, parameter, isStump);
+                    this.createChildrenForDiscreteIndexed(data, bestAttribute, bestSplitValue, parameter, isStump);
                 }
                 else {
                     if (data.get(0).getAttribute(bestAttribute) instanceof DiscreteAttribute_1.DiscreteAttribute) {
-                        this.createChildrenForDiscrete(bestAttribute, parameter, isStump);
+                        this.createChildrenForDiscrete(data, bestAttribute, parameter, isStump);
                     }
                     else {
                         if (data.get(0).getAttribute(bestAttribute) instanceof ContinuousAttribute_1.ContinuousAttribute) {
-                            this.createChildrenForContinuous(bestAttribute, bestSplitValue, parameter, isStump);
+                            this.createChildrenForContinuous(data, bestAttribute, bestSplitValue, parameter, isStump);
                         }
                     }
                 }
             }
         }
+        /**
+         * Reads the decision node model (as one line) from model file.
+         * @param contents Model file
+         */
         constructor2(contents) {
             let items = contents.readLine().split(" ");
             if (items[0] != "-1") {
@@ -193,20 +223,22 @@
             else {
                 this.leaf = true;
                 this.classLabel = contents.readLine();
+                this.classLabelsDistribution = Model_1.Model.loadDiscreteDistribution(contents);
             }
         }
         /**
          * The entropyForDiscreteAttribute method takes an attributeIndex and creates an ArrayList of DiscreteDistribution.
          * Then loops through the distributions and calculates the total entropy.
          *
+         * @param data Instance list.
          * @param attributeIndex Index of the attribute.
          * @return Total entropy for the discrete attribute.
          */
-        entropyForDiscreteAttribute(attributeIndex) {
+        entropyForDiscreteAttribute(data, attributeIndex) {
             let sum = 0.0;
-            let distributions = this.data.attributeClassDistribution(attributeIndex);
+            let distributions = data.attributeClassDistribution(attributeIndex);
             for (let distribution of distributions) {
-                sum += (distribution.getSum() / this.data.size()) * distribution.entropy();
+                sum += (distribution.getSum() / data.size()) * distribution.entropy();
             }
             return sum;
         }
@@ -214,28 +246,30 @@
          * The createChildrenForDiscreteIndexed method creates an ArrayList of DecisionNodes as children and a partition with respect to
          * indexed attribute.
          *
+         * @param data Instance list.
          * @param attributeIndex Index of the attribute.
          * @param attributeValue Value of the attribute.
          * @param parameter      RandomForestParameter like seed, ensembleSize, attributeSubsetSize.
          * @param isStump        Refers to decision trees with only 1 splitting rule.
          */
-        createChildrenForDiscreteIndexed(attributeIndex, attributeValue, parameter, isStump) {
-            let childrenData = new Partition_1.Partition(this.data, attributeIndex, attributeValue);
+        createChildrenForDiscreteIndexed(data, attributeIndex, attributeValue, parameter, isStump) {
+            let childrenData = new Partition_1.Partition(data, attributeIndex, attributeValue);
             this.children = new Array();
-            this.children.push(new DecisionNode(childrenData.get(0), new DecisionCondition_1.DecisionCondition(attributeIndex, new DiscreteIndexedAttribute_1.DiscreteIndexedAttribute("", attributeValue, this.data.get(0).getAttribute(attributeIndex).getMaxIndex())), parameter, isStump));
-            this.children.push(new DecisionNode(childrenData.get(1), new DecisionCondition_1.DecisionCondition(attributeIndex, new DiscreteIndexedAttribute_1.DiscreteIndexedAttribute("", -1, this.data.get(0).getAttribute(attributeIndex).getMaxIndex())), parameter, isStump));
+            this.children.push(new DecisionNode(childrenData.get(0), new DecisionCondition_1.DecisionCondition(attributeIndex, new DiscreteIndexedAttribute_1.DiscreteIndexedAttribute("", attributeValue, data.get(0).getAttribute(attributeIndex).getMaxIndex())), parameter, isStump));
+            this.children.push(new DecisionNode(childrenData.get(1), new DecisionCondition_1.DecisionCondition(attributeIndex, new DiscreteIndexedAttribute_1.DiscreteIndexedAttribute("", -1, data.get(0).getAttribute(attributeIndex).getMaxIndex())), parameter, isStump));
         }
         /**
          * The createChildrenForDiscrete method creates an ArrayList of values, a partition with respect to attributes and an ArrayList
          * of DecisionNodes as children.
          *
+         * @param data Instance list.
          * @param attributeIndex Index of the attribute.
          * @param parameter      RandomForestParameter like seed, ensembleSize, attributeSubsetSize.
          * @param isStump        Refers to decision trees with only 1 splitting rule.
          */
-        createChildrenForDiscrete(attributeIndex, parameter, isStump) {
-            let valueList = this.data.getAttributeValueList(attributeIndex);
-            let childrenData = new Partition_1.Partition(this.data, attributeIndex);
+        createChildrenForDiscrete(data, attributeIndex, parameter, isStump) {
+            let valueList = data.getAttributeValueList(attributeIndex);
+            let childrenData = new Partition_1.Partition(data, attributeIndex);
             this.children = new Array();
             for (let i = 0; i < valueList.length; i++) {
                 this.children.push(new DecisionNode(childrenData.get(i), new DecisionCondition_1.DecisionCondition(attributeIndex, new DiscreteAttribute_1.DiscreteAttribute(valueList[i])), parameter, isStump));
@@ -245,13 +279,14 @@
          * The createChildrenForContinuous method creates an ArrayList of DecisionNodes as children and a partition with respect to
          * continuous attribute and the given split value.
          *
+         * @param data Instance list.
          * @param attributeIndex Index of the attribute.
          * @param parameter      RandomForestParameter like seed, ensembleSize, attributeSubsetSize.
          * @param isStump        Refers to decision trees with only 1 splitting rule.
          * @param splitValue     Split value is used for partitioning.
          */
-        createChildrenForContinuous(attributeIndex, splitValue, parameter, isStump) {
-            let childrenData = new Partition_1.Partition(this.data, attributeIndex, splitValue + 0.0000001);
+        createChildrenForContinuous(data, attributeIndex, splitValue, parameter, isStump) {
+            let childrenData = new Partition_1.Partition(data, attributeIndex, splitValue + 0.0000001);
             this.children = new Array();
             this.children.push(new DecisionNode(childrenData.get(0), new DecisionCondition_1.DecisionCondition(attributeIndex, new ContinuousAttribute_1.ContinuousAttribute(splitValue), "<"), parameter, isStump));
             this.children.push(new DecisionNode(childrenData.get(1), new DecisionCondition_1.DecisionCondition(attributeIndex, new ContinuousAttribute_1.ContinuousAttribute(splitValue), ">"), parameter, isStump));
@@ -266,7 +301,7 @@
         predict(instance) {
             if (instance instanceof CompositeInstance_1.CompositeInstance) {
                 let possibleClassLabels = instance.getPossibleClassLabels();
-                let distribution = this.data.classDistribution();
+                let distribution = this.classLabelsDistribution;
                 let predictedClass = distribution.getMaxItem(possibleClassLabels);
                 if (this.leaf) {
                     return predictedClass;
@@ -300,9 +335,16 @@
                 }
             }
         }
+        /**
+         * Recursive method that returns the posterior probability distribution of a given instance. If the node is a leaf
+         * node, it returns the class label distribution, otherwise it checks in which direction (child node) this instance
+         * is forwarded.
+         * @param instance Instance for which the posterior probability distribution is calculated.
+         * @return Posterior probability distribution for this instance.
+         */
         predictProbabilityDistribution(instance) {
             if (this.leaf) {
-                return this.data.classDistribution().getProbabilityDistribution();
+                return this.classLabelsDistribution.getProbabilityDistribution();
             }
             else {
                 for (let node of this.children) {
@@ -310,7 +352,7 @@
                         return node.predictProbabilityDistribution(instance);
                     }
                 }
-                return this.data.classDistribution().getProbabilityDistribution();
+                return this.classLabelsDistribution.getProbabilityDistribution();
             }
         }
     }