nlptoolkit-classification 1.0.0

package/dist/FeatureSelection/FeatureSubSet.js

@@ -0,0 +1,89 @@
+(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"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.FeatureSubSet = void 0;
+    class FeatureSubSet {
+        /**
+         * A constructor that takes number of features as input and initializes indexList with these numbers.
+         *
+         * @param numberOfFeaturesOrList Indicates the indices of indexList.
+         */
+        constructor(numberOfFeaturesOrList) {
+            this.indexList = new Array();
+            if (numberOfFeaturesOrList != undefined) {
+                if (typeof numberOfFeaturesOrList == "number") {
+                    for (let i = 0; i < numberOfFeaturesOrList; i++) {
+                        this.indexList.push(i);
+                    }
+                }
+                else {
+                    this.indexList = numberOfFeaturesOrList;
+                }
+            }
+        }
+        /**
+         * The clone method creates a new ArrayList with the elements of indexList and returns it as a new FeatureSubSet.
+         *
+         * @return A new ArrayList with the elements of indexList and returns it as a new FeatureSubSet.
+         */
+        clone() {
+            let result = new FeatureSubSet(this.indexList.length);
+            for (let i = 0; i < this.indexList.length; i++) {
+                result.add(this.indexList[i]);
+            }
+            return result;
+        }
+        /**
+         * The size method returns the size of the indexList.
+         *
+         * @return The size of the indexList.
+         */
+        size() {
+            return this.indexList.length;
+        }
+        /**
+         * The get method returns the item of indexList at given index.
+         *
+         * @param index Index of the indexList to be accessed.
+         * @return The item of indexList at given index.
+         */
+        get(index) {
+            return this.indexList[index];
+        }
+        /**
+         * The contains method returns True, if indexList contains given input number and False otherwise.
+         *
+         * @param featureNo Feature number that will be checked.
+         * @return True, if indexList contains given input number.
+         */
+        contains(featureNo) {
+            return this.indexList.includes(featureNo);
+        }
+        /**
+         * The add method adds given Integer to the indexList.
+         *
+         * @param featureNo Integer that will be added to indexList.
+         */
+        add(featureNo) {
+            this.indexList.push(featureNo);
+        }
+        /**
+         * The remove method removes the item of indexList at the given index.
+         *
+         * @param index Index of the item that will be removed.
+         */
+        remove(index) {
+            this.indexList.splice(index, 1);
+        }
+    }
+    exports.FeatureSubSet = FeatureSubSet;
+});
+//# sourceMappingURL=FeatureSubSet.js.map

package/dist/FeatureSelection/FeatureSubSet.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"FeatureSubSet.js","sourceRoot":"","sources":["../../source/FeatureSelection/FeatureSubSet.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,MAAa,aAAa;QAItB;;;;WAIG;QACH,YAAY,sBAA4B;YAPvB,cAAS,GAAkB,IAAI,KAAK,EAAU,CAAA;YAQ3D,IAAI,sBAAsB,IAAI,SAAS,EAAC;gBACpC,IAAI,OAAO,sBAAsB,IAAI,QAAQ,EAAC;oBAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,sBAAsB,EAAE,CAAC,EAAE,EAAE;wBAC7C,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;qBAC1B;iBACJ;qBAAM;oBACH,IAAI,CAAC,SAAS,GAAG,sBAAsB,CAAA;iBAC1C;aACJ;QACL,CAAC;QAED;;;;WAIG;QACH,KAAK;YACD,IAAI,MAAM,GAAG,IAAI,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;YACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAC;gBAC3C,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;aAChC;YACD,OAAO,MAAM,CAAA;QACjB,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;;;;;WAKG;QACH,QAAQ,CAAC,SAAiB;YACtB,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAA;QAC7C,CAAC;QAED;;;;WAIG;QACH,GAAG,CAAC,SAAiB;YACjB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QAClC,CAAC;QAED;;;;WAIG;QACH,MAAM,CAAC,KAAa;YAChB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;QACnC,CAAC;KAEJ;IAjFD,sCAiFC"}

package/dist/FeatureSelection/FloatingSelection.d.ts

@@ -0,0 +1,16 @@
+import { SubSetSelection } from "./SubSetSelection";
+import { FeatureSubSet } from "./FeatureSubSet";
+export declare class FloatingSelection extends SubSetSelection {
+    /**
+     * Constructor that creates a new {@link FeatureSubSet}.
+     */
+    constructor();
+    /**
+     * The operator method calls forward and backward methods.
+     *
+     * @param current          {@link FeatureSubSet} input.
+     * @param numberOfFeatures Indicates the indices of indexList.
+     * @return ArrayList of FeatureSubSet.
+     */
+    protected operator(current: FeatureSubSet, numberOfFeatures: number): Array<FeatureSubSet>;
+}

package/dist/FeatureSelection/FloatingSelection.js

@@ -0,0 +1,38 @@
+(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", "./SubSetSelection", "./FeatureSubSet"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.FloatingSelection = void 0;
+    const SubSetSelection_1 = require("./SubSetSelection");
+    const FeatureSubSet_1 = require("./FeatureSubSet");
+    class FloatingSelection extends SubSetSelection_1.SubSetSelection {
+        /**
+         * Constructor that creates a new {@link FeatureSubSet}.
+         */
+        constructor() {
+            super(new FeatureSubSet_1.FeatureSubSet());
+        }
+        /**
+         * The operator method calls forward and backward methods.
+         *
+         * @param current          {@link FeatureSubSet} input.
+         * @param numberOfFeatures Indicates the indices of indexList.
+         * @return ArrayList of FeatureSubSet.
+         */
+        operator(current, numberOfFeatures) {
+            let result = new Array();
+            this.forward(result, current, numberOfFeatures);
+            this.backward(result, current);
+            return result;
+        }
+    }
+    exports.FloatingSelection = FloatingSelection;
+});
+//# sourceMappingURL=FloatingSelection.js.map

package/dist/FeatureSelection/FloatingSelection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"FloatingSelection.js","sourceRoot":"","sources":["../../source/FeatureSelection/FloatingSelection.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,uDAAkD;IAClD,mDAA8C;IAE9C,MAAa,iBAAkB,SAAQ,iCAAe;QAElD;;WAEG;QACH;YACI,KAAK,CAAC,IAAI,6BAAa,EAAE,CAAC,CAAC;QAC/B,CAAC;QAED;;;;;;WAMG;QACO,QAAQ,CAAC,OAAsB,EAAE,gBAAwB;YAC/D,IAAI,MAAM,GAAG,IAAI,KAAK,EAAiB,CAAC;YACxC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,gBAAgB,CAAC,CAAC;YAChD,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;YAC/B,OAAO,MAAM,CAAC;QAClB,CAAC;KAEJ;IAvBD,8CAuBC"}

package/dist/FeatureSelection/ForwardSelection.d.ts

@@ -0,0 +1,17 @@
+import { SubSetSelection } from "./SubSetSelection";
+import { FeatureSubSet } from "./FeatureSubSet";
+export declare class ForwardSelection extends SubSetSelection {
+    /**
+     * Constructor that creates a new {@link FeatureSubSet}.
+     */
+    constructor();
+    /**
+     * The operator method calls forward method which starts with having no feature in the model. In each iteration,
+     * it keeps adding the features that are not currently listed.
+     *
+     * @param current          FeatureSubset that will be added to new ArrayList.
+     * @param numberOfFeatures Indicates the indices of indexList.
+     * @return ArrayList of FeatureSubSets created from forward.
+     */
+    protected operator(current: FeatureSubSet, numberOfFeatures: number): Array<FeatureSubSet>;
+}

package/dist/FeatureSelection/ForwardSelection.js

@@ -0,0 +1,38 @@
+(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", "./SubSetSelection", "./FeatureSubSet"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.ForwardSelection = void 0;
+    const SubSetSelection_1 = require("./SubSetSelection");
+    const FeatureSubSet_1 = require("./FeatureSubSet");
+    class ForwardSelection extends SubSetSelection_1.SubSetSelection {
+        /**
+         * Constructor that creates a new {@link FeatureSubSet}.
+         */
+        constructor() {
+            super(new FeatureSubSet_1.FeatureSubSet());
+        }
+        /**
+         * The operator method calls forward method which starts with having no feature in the model. In each iteration,
+         * it keeps adding the features that are not currently listed.
+         *
+         * @param current          FeatureSubset that will be added to new ArrayList.
+         * @param numberOfFeatures Indicates the indices of indexList.
+         * @return ArrayList of FeatureSubSets created from forward.
+         */
+        operator(current, numberOfFeatures) {
+            let result = new Array();
+            this.forward(result, current, numberOfFeatures);
+            return result;
+        }
+    }
+    exports.ForwardSelection = ForwardSelection;
+});
+//# sourceMappingURL=ForwardSelection.js.map

package/dist/FeatureSelection/ForwardSelection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ForwardSelection.js","sourceRoot":"","sources":["../../source/FeatureSelection/ForwardSelection.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,uDAAkD;IAClD,mDAA8C;IAE9C,MAAa,gBAAiB,SAAQ,iCAAe;QAEjD;;WAEG;QACH;YACI,KAAK,CAAC,IAAI,6BAAa,EAAE,CAAC,CAAC;QAC/B,CAAC;QAED;;;;;;;WAOG;QACO,QAAQ,CAAC,OAAsB,EAAE,gBAAwB;YAC/D,IAAI,MAAM,GAAG,IAAI,KAAK,EAAiB,CAAC;YACxC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,gBAAgB,CAAC,CAAC;YAChD,OAAO,MAAM,CAAC;QAClB,CAAC;KAEJ;IAvBD,4CAuBC"}

package/dist/FeatureSelection/SubSetSelection.d.ts

@@ -0,0 +1,37 @@
+import { FeatureSubSet } from "./FeatureSubSet";
+import { MultipleRun } from "../Experiment/MultipleRun";
+import { Experiment } from "../Experiment/Experiment";
+export declare abstract class SubSetSelection {
+    protected initialSubSet: FeatureSubSet;
+    protected abstract operator(current: FeatureSubSet, numberOfFeatures: number): Array<FeatureSubSet>;
+    /**
+     * A constructor that sets the initial subset with given input.
+     *
+     * @param initialSubSet {@link FeatureSubSet} input.
+     */
+    protected constructor(initialSubSet: FeatureSubSet);
+    /**
+     * The forward method starts with having no feature in the model. In each iteration, it keeps adding the features that are not currently listed.
+     *
+     * @param currentSubSetList ArrayList to add the FeatureSubsets.
+     * @param current           FeatureSubset that will be added to currentSubSetList.
+     * @param numberOfFeatures  The number of features to add the subset.
+     */
+    protected forward(currentSubSetList: Array<FeatureSubSet>, current: FeatureSubSet, numberOfFeatures: number): void;
+    /**
+     * The backward method starts with all the features and removes the least significant feature at each iteration.
+     *
+     * @param currentSubSetList ArrayList to add the FeatureSubsets.
+     * @param current           FeatureSubset that will be added to currentSubSetList
+     */
+    protected backward(currentSubSetList: Array<FeatureSubSet>, current: FeatureSubSet): void;
+    /**
+     * The execute method takes an {@link Experiment} and a {@link MultipleRun} as inputs. By selecting a candidateList from given
+     * Experiment it tries to find a FeatureSubSet that gives best performance.
+     *
+     * @param multipleRun {@link MultipleRun} type input.
+     * @param experiment  {@link Experiment} type input.
+     * @return FeatureSubSet that gives best performance.
+     */
+    execute(multipleRun: MultipleRun, experiment: Experiment): FeatureSubSet;
+}

package/dist/FeatureSelection/SubSetSelection.js

@@ -0,0 +1,90 @@
+(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"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.SubSetSelection = void 0;
+    class SubSetSelection {
+        /**
+         * A constructor that sets the initial subset with given input.
+         *
+         * @param initialSubSet {@link FeatureSubSet} input.
+         */
+        constructor(initialSubSet) {
+            this.initialSubSet = initialSubSet;
+        }
+        /**
+         * The forward method starts with having no feature in the model. In each iteration, it keeps adding the features that are not currently listed.
+         *
+         * @param currentSubSetList ArrayList to add the FeatureSubsets.
+         * @param current           FeatureSubset that will be added to currentSubSetList.
+         * @param numberOfFeatures  The number of features to add the subset.
+         */
+        forward(currentSubSetList, current, numberOfFeatures) {
+            for (let i = 0; i < numberOfFeatures; i++) {
+                if (!current.contains(i)) {
+                    let candidate = current.clone();
+                    candidate.add(i);
+                    currentSubSetList.push(candidate);
+                }
+            }
+        }
+        /**
+         * The backward method starts with all the features and removes the least significant feature at each iteration.
+         *
+         * @param currentSubSetList ArrayList to add the FeatureSubsets.
+         * @param current           FeatureSubset that will be added to currentSubSetList
+         */
+        backward(currentSubSetList, current) {
+            for (let i = 0; i < current.size(); i++) {
+                let candidate = current.clone();
+                candidate.remove(i);
+                currentSubSetList.push(candidate);
+            }
+        }
+        /**
+         * The execute method takes an {@link Experiment} and a {@link MultipleRun} as inputs. By selecting a candidateList from given
+         * Experiment it tries to find a FeatureSubSet that gives best performance.
+         *
+         * @param multipleRun {@link MultipleRun} type input.
+         * @param experiment  {@link Experiment} type input.
+         * @return FeatureSubSet that gives best performance.
+         */
+        execute(multipleRun, experiment) {
+            let processed = new Set();
+            let best = this.initialSubSet;
+            processed.add(best);
+            let betterFound = true;
+            let bestPerformance = undefined, currentPerformance;
+            if (best.size() > 0) {
+                bestPerformance = multipleRun.execute(experiment.featureSelectedExperiment(best));
+            }
+            while (betterFound) {
+                betterFound = false;
+                let candidateList = this.operator(best, experiment.getDataSet().getDataDefinition().attributeCount());
+                for (let candidateSubSet of candidateList) {
+                    if (!processed.has(candidateSubSet)) {
+                        if (candidateSubSet.size() > 0) {
+                            currentPerformance = multipleRun.execute(experiment.featureSelectedExperiment(candidateSubSet));
+                            if (bestPerformance == null || currentPerformance.isBetter(bestPerformance)) {
+                                best = candidateSubSet;
+                                bestPerformance = currentPerformance;
+                                betterFound = true;
+                            }
+                        }
+                        processed.add(candidateSubSet);
+                    }
+                }
+            }
+            return best;
+        }
+    }
+    exports.SubSetSelection = SubSetSelection;
+});
+//# sourceMappingURL=SubSetSelection.js.map

package/dist/FeatureSelection/SubSetSelection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SubSetSelection.js","sourceRoot":"","sources":["../../source/FeatureSelection/SubSetSelection.ts"],"names":[],"mappings":";;;;;;;;;;;;IAIA,MAAsB,eAAe;QAMjC;;;;WAIG;QACH,YAAsB,aAA4B;YAC9C,IAAI,CAAC,aAAa,GAAG,aAAa,CAAA;QACtC,CAAC;QAED;;;;;;WAMG;QACO,OAAO,CAAC,iBAAuC,EAAE,OAAsB,EAAE,gBAAwB;YACvG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,EAAE,CAAC,EAAE,EAAE;gBACvC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE;oBACtB,IAAI,SAAS,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;oBAChC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBACjB,iBAAiB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;iBACrC;aACJ;QACL,CAAC;QAED;;;;;WAKG;QACO,QAAQ,CAAC,iBAAuC,EAAE,OAAsB;YAC9E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE;gBACrC,IAAI,SAAS,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;gBAChC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACpB,iBAAiB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;aACrC;QACL,CAAC;QAED;;;;;;;WAOG;QACH,OAAO,CAAC,WAAwB,EAAE,UAAsB;YACpD,IAAI,SAAS,GAAG,IAAI,GAAG,EAAiB,CAAC;YACzC,IAAI,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC;YAC9B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACpB,IAAI,WAAW,GAAG,IAAI,CAAC;YACvB,IAAI,eAAe,GAAG,SAAS,EAAE,kBAAkB,CAAC;YACpD,IAAI,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,EAAC;gBAChB,eAAe,GAAG,WAAW,CAAC,OAAO,CAAC,UAAU,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC,CAAC;aACrF;YACD,OAAO,WAAW,EAAE;gBAChB,WAAW,GAAG,KAAK,CAAC;gBACpB,IAAI,aAAa,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC,UAAU,EAAE,CAAC,iBAAiB,EAAE,CAAC,cAAc,EAAE,CAAC,CAAC;gBACtG,KAAK,IAAI,eAAe,IAAI,aAAa,EAAE;oBACvC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,eAAe,CAAC,EAAE;wBACjC,IAAI,eAAe,CAAC,IAAI,EAAE,GAAG,CAAC,EAAC;4BAC3B,kBAAkB,GAAG,WAAW,CAAC,OAAO,CAAC,UAAU,CAAC,yBAAyB,CAAC,eAAe,CAAC,CAAC,CAAC;4BAChG,IAAI,eAAe,IAAI,IAAI,IAAI,kBAAkB,CAAC,QAAQ,CAAC,eAAe,CAAC,EAAE;gCACzE,IAAI,GAAG,eAAe,CAAC;gCACvB,eAAe,GAAG,kBAAkB,CAAC;gCACrC,WAAW,GAAG,IAAI,CAAC;6BACtB;yBACJ;wBACD,SAAS,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;qBAClC;iBACJ;aACJ;YACD,OAAO,IAAI,CAAC;QAChB,CAAC;KAEJ;IAnFD,0CAmFC"}

package/dist/Filter/DiscreteToContinuous.d.ts

@@ -0,0 +1,25 @@
+import { LaryFilter } from "./LaryFilter";
+import { Instance } from "../Instance/Instance";
+import { DataSet } from "../DataSet/DataSet";
+export declare class DiscreteToContinuous extends LaryFilter {
+    /**
+     * Converts the data definition with discrete attributes, to data definition with continuous attributes. Basically,
+     * for each discrete attribute with L possible values, L more continuous attributes will be added.
+     */
+    convertDataDefinition(): void;
+    /**
+     * Converts discrete attributes of a single instance to continuous version using 1-of-L encoding. For example, if
+     * an attribute has values red, green, blue; this attribute will be converted to 3 continuous attributes where
+     * red will have the value 100, green will have the value 010, and blue will have the value 001.
+     *
+     * @param instance The instance to be converted.
+     */
+    convertInstance(instance: Instance): void;
+    /**
+     * Constructor for discrete to continuous filter.
+     *
+     * @param dataSet The dataSet whose instances whose discrete attributes will be converted to continuous attributes using
+     *                1-of-L encoding.
+     */
+    constructor(dataSet: DataSet);
+}

package/dist/Filter/DiscreteToContinuous.js

@@ -0,0 +1,69 @@
+(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", "./LaryFilter", "../Attribute/ContinuousAttribute", "../Attribute/AttributeType"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.DiscreteToContinuous = void 0;
+    const LaryFilter_1 = require("./LaryFilter");
+    const ContinuousAttribute_1 = require("../Attribute/ContinuousAttribute");
+    const AttributeType_1 = require("../Attribute/AttributeType");
+    class DiscreteToContinuous extends LaryFilter_1.LaryFilter {
+        /**
+         * Converts the data definition with discrete attributes, to data definition with continuous attributes. Basically,
+         * for each discrete attribute with L possible values, L more continuous attributes will be added.
+         */
+        convertDataDefinition() {
+            let dataDefinition = this.dataSet.getDataDefinition();
+            let size = dataDefinition.attributeCount();
+            for (let i = 0; i < size; i++) {
+                if (this.attributeDistributions[i].size > 0) {
+                    for (let j = 0; j < this.attributeDistributions[i].size; j++) {
+                        dataDefinition.addAttribute(AttributeType_1.AttributeType.CONTINUOUS);
+                    }
+                }
+            }
+            this.removeDiscreteAttributesFromDataDefinition(size);
+        }
+        /**
+         * Converts discrete attributes of a single instance to continuous version using 1-of-L encoding. For example, if
+         * an attribute has values red, green, blue; this attribute will be converted to 3 continuous attributes where
+         * red will have the value 100, green will have the value 010, and blue will have the value 001.
+         *
+         * @param instance The instance to be converted.
+         */
+        convertInstance(instance) {
+            let size = instance.attributeSize();
+            for (let i = 0; i < size; i++) {
+                if (this.attributeDistributions[i].size > 0) {
+                    let index = this.attributeDistributions[i].getIndex(instance.getAttribute(i).toString());
+                    for (let j = 0; j < this.attributeDistributions[i].size; j++) {
+                        if (j != index) {
+                            instance.addAttribute(new ContinuousAttribute_1.ContinuousAttribute(0));
+                        }
+                        else {
+                            instance.addAttribute(new ContinuousAttribute_1.ContinuousAttribute(1));
+                        }
+                    }
+                }
+            }
+            this.removeDiscreteAttributesFromInstance(instance, size);
+        }
+        /**
+         * Constructor for discrete to continuous filter.
+         *
+         * @param dataSet The dataSet whose instances whose discrete attributes will be converted to continuous attributes using
+         *                1-of-L encoding.
+         */
+        constructor(dataSet) {
+            super(dataSet);
+        }
+    }
+    exports.DiscreteToContinuous = DiscreteToContinuous;
+});
+//# sourceMappingURL=DiscreteToContinuous.js.map

package/dist/Filter/DiscreteToContinuous.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DiscreteToContinuous.js","sourceRoot":"","sources":["../../source/Filter/DiscreteToContinuous.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,6CAAwC;IAGxC,0EAAqE;IACrE,8DAAyD;IAEzD,MAAa,oBAAqB,SAAQ,uBAAU;QAEhD;;;WAGG;QACH,qBAAqB;YACjB,IAAI,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,CAAC;YACtD,IAAI,IAAI,GAAG,cAAc,CAAC,cAAc,EAAE,CAAC;YAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;gBAC3B,IAAI,IAAI,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,EAAE;oBACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;wBAC1D,cAAc,CAAC,YAAY,CAAC,6BAAa,CAAC,UAAU,CAAC,CAAC;qBACzD;iBACJ;aACJ;YACD,IAAI,CAAC,0CAA0C,CAAC,IAAI,CAAC,CAAC;QAC1D,CAAC;QAED;;;;;;WAMG;QACH,eAAe,CAAC,QAAkB;YAC9B,IAAI,IAAI,GAAG,QAAQ,CAAC,aAAa,EAAE,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;gBAC3B,IAAI,IAAI,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,EAAE;oBACzC,IAAI,KAAK,GAAG,IAAI,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;oBACzF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;wBAC1D,IAAI,CAAC,IAAI,KAAK,EAAE;4BACZ,QAAQ,CAAC,YAAY,CAAC,IAAI,yCAAmB,CAAC,CAAC,CAAC,CAAC,CAAC;yBACrD;6BAAM;4BACH,QAAQ,CAAC,YAAY,CAAC,IAAI,yCAAmB,CAAC,CAAC,CAAC,CAAC,CAAC;yBACrD;qBACJ;iBACJ;aACJ;YACD,IAAI,CAAC,oCAAoC,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC9D,CAAC;QAED;;;;;WAKG;QACH,YAAY,OAAgB;YACxB,KAAK,CAAC,OAAO,CAAC,CAAC;QACnB,CAAC;KACJ;IApDD,oDAoDC"}

package/dist/Filter/DiscreteToIndexed.d.ts

@@ -0,0 +1,21 @@
+import { LaryFilter } from "./LaryFilter";
+import { Instance } from "../Instance/Instance";
+import { DataSet } from "../DataSet/DataSet";
+export declare class DiscreteToIndexed extends LaryFilter {
+    /**
+     * Converts the data definition with discrete attributes, to data definition with DISCRETE_INDEXED attributes.
+     */
+    convertDataDefinition(): void;
+    /**
+     * Converts discrete attributes of a single instance to indexed version.
+     *
+     * @param instance The instance to be converted.
+     */
+    convertInstance(instance: Instance): void;
+    /**
+     * Constructor for discrete to indexed filter.
+     *
+     * @param dataSet The dataSet whose instances whose discrete attributes will be converted to indexed attributes
+     */
+    constructor(dataSet: DataSet);
+}

package/dist/Filter/DiscreteToIndexed.js

@@ -0,0 +1,56 @@
+(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", "./LaryFilter", "../Attribute/DiscreteIndexedAttribute", "../Attribute/AttributeType"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.DiscreteToIndexed = void 0;
+    const LaryFilter_1 = require("./LaryFilter");
+    const DiscreteIndexedAttribute_1 = require("../Attribute/DiscreteIndexedAttribute");
+    const AttributeType_1 = require("../Attribute/AttributeType");
+    class DiscreteToIndexed extends LaryFilter_1.LaryFilter {
+        /**
+         * Converts the data definition with discrete attributes, to data definition with DISCRETE_INDEXED attributes.
+         */
+        convertDataDefinition() {
+            let dataDefinition = this.dataSet.getDataDefinition();
+            let size = dataDefinition.attributeCount();
+            for (let i = 0; i < size; i++) {
+                if (this.attributeDistributions[i].size > 0) {
+                    dataDefinition.addAttribute(AttributeType_1.AttributeType.DISCRETE_INDEXED);
+                }
+            }
+            this.removeDiscreteAttributesFromDataDefinition(size);
+        }
+        /**
+         * Converts discrete attributes of a single instance to indexed version.
+         *
+         * @param instance The instance to be converted.
+         */
+        convertInstance(instance) {
+            let size = instance.attributeSize();
+            for (let i = 0; i < size; i++) {
+                if (this.attributeDistributions[i].size > 0) {
+                    let index = this.attributeDistributions[i].getIndex(instance.getAttribute(i).toString());
+                    instance.addAttribute(new DiscreteIndexedAttribute_1.DiscreteIndexedAttribute(instance.getAttribute(i).toString(), index, this.attributeDistributions[i].size));
+                }
+            }
+            this.removeDiscreteAttributesFromInstance(instance, size);
+        }
+        /**
+         * Constructor for discrete to indexed filter.
+         *
+         * @param dataSet The dataSet whose instances whose discrete attributes will be converted to indexed attributes
+         */
+        constructor(dataSet) {
+            super(dataSet);
+        }
+    }
+    exports.DiscreteToIndexed = DiscreteToIndexed;
+});
+//# sourceMappingURL=DiscreteToIndexed.js.map

package/dist/Filter/DiscreteToIndexed.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DiscreteToIndexed.js","sourceRoot":"","sources":["../../source/Filter/DiscreteToIndexed.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,6CAAwC;IAGxC,oFAA+E;IAC/E,8DAAyD;IAEzD,MAAa,iBAAkB,SAAQ,uBAAU;QAE7C;;WAEG;QACH,qBAAqB;YACjB,IAAI,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,CAAC;YACtD,IAAI,IAAI,GAAG,cAAc,CAAC,cAAc,EAAE,CAAC;YAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;gBAC3B,IAAI,IAAI,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,EAAE;oBACzC,cAAc,CAAC,YAAY,CAAC,6BAAa,CAAC,gBAAgB,CAAC,CAAC;iBAC/D;aACJ;YACD,IAAI,CAAC,0CAA0C,CAAC,IAAI,CAAC,CAAC;QAC1D,CAAC;QAED;;;;WAIG;QACH,eAAe,CAAC,QAAkB;YAC9B,IAAI,IAAI,GAAG,QAAQ,CAAC,aAAa,EAAE,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;gBAC3B,IAAI,IAAI,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,EAAE;oBACzC,IAAI,KAAK,GAAG,IAAI,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;oBACzF,QAAQ,CAAC,YAAY,CAAC,IAAI,mDAAwB,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,KAAK,EACzF,IAAI,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;iBAC7C;aACJ;YACD,IAAI,CAAC,oCAAoC,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC9D,CAAC;QAED;;;;WAIG;QACH,YAAY,OAAgB;YACxB,KAAK,CAAC,OAAO,CAAC,CAAC;QACnB,CAAC;KACJ;IAzCD,8CAyCC"}

package/dist/Filter/FeatureFilter.d.ts

@@ -0,0 +1,18 @@
+import { DataSet } from "../DataSet/DataSet";
+import { Instance } from "../Instance/Instance";
+export declare abstract class FeatureFilter {
+    protected dataSet: DataSet;
+    abstract convertInstance(instance: Instance): void;
+    abstract convertDataDefinition(): void;
+    /**
+     * Constructor that sets the dataSet.
+     *
+     * @param dataSet DataSet that will bu used.
+     */
+    constructor(dataSet: DataSet);
+    /**
+     * Feature converter for a list of instances. Using the abstract method convertInstance, each instance in the
+     * instance list will be converted.
+     */
+    convert(): void;
+}

package/dist/Filter/FeatureFilter.js

@@ -0,0 +1,36 @@
+(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"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.FeatureFilter = void 0;
+    class FeatureFilter {
+        /**
+         * Constructor that sets the dataSet.
+         *
+         * @param dataSet DataSet that will bu used.
+         */
+        constructor(dataSet) {
+            this.dataSet = dataSet;
+        }
+        /**
+         * Feature converter for a list of instances. Using the abstract method convertInstance, each instance in the
+         * instance list will be converted.
+         */
+        convert() {
+            let instances = this.dataSet.getInstances();
+            for (let instance of instances) {
+                this.convertInstance(instance);
+            }
+            this.convertDataDefinition();
+        }
+    }
+    exports.FeatureFilter = FeatureFilter;
+});
+//# sourceMappingURL=FeatureFilter.js.map

package/dist/Filter/FeatureFilter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"FeatureFilter.js","sourceRoot":"","sources":["../../source/Filter/FeatureFilter.ts"],"names":[],"mappings":";;;;;;;;;;;;IAGA,MAAsB,aAAa;QAO/B;;;;WAIG;QACH,YAAY,OAAgB;YACxB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QAC1B,CAAC;QAED;;;WAGG;QACH,OAAO;YACH,IAAI,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC;YAC5C,KAAK,IAAI,QAAQ,IAAI,SAAS,EAAE;gBAC5B,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;aAClC;YACD,IAAI,CAAC,qBAAqB,EAAE,CAAC;QACjC,CAAC;KACJ;IA3BD,sCA2BC"}

package/dist/Filter/LaryFilter.d.ts

@@ -0,0 +1,27 @@
+import { FeatureFilter } from "./FeatureFilter";
+import { DiscreteDistribution } from "nlptoolkit-math/dist/DiscreteDistribution";
+import { DataSet } from "../DataSet/DataSet";
+import { Instance } from "../Instance/Instance";
+export declare abstract class LaryFilter extends FeatureFilter {
+    protected attributeDistributions: Array<DiscreteDistribution>;
+    /**
+     * Constructor that sets the dataSet and all the attributes distributions.
+     *
+     * @param dataSet DataSet that will bu used.
+     */
+    constructor(dataSet: DataSet);
+    /**
+     * The removeDiscreteAttributes method takes an {@link Instance} as an input, and removes the discrete attributes from
+     * given instance.
+     *
+     * @param instance Instance to removes attributes from.
+     * @param size     Size of the given instance.
+     */
+    protected removeDiscreteAttributesFromInstance(instance: Instance, size: number): void;
+    /**
+     * The removeDiscreteAttributes method removes the discrete attributes from dataDefinition.
+     *
+     * @param size Size of item that attributes will be removed.
+     */
+    protected removeDiscreteAttributesFromDataDefinition(size: number): void;
+}