nlptoolkit-classification 1.0.0

package/dist/Filter/LaryFilter.js

@@ -0,0 +1,62 @@
+(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", "./FeatureFilter"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.LaryFilter = void 0;
+    const FeatureFilter_1 = require("./FeatureFilter");
+    class LaryFilter extends FeatureFilter_1.FeatureFilter {
+        /**
+         * Constructor that sets the dataSet and all the attributes distributions.
+         *
+         * @param dataSet DataSet that will bu used.
+         */
+        constructor(dataSet) {
+            super(dataSet);
+            this.attributeDistributions = dataSet.getInstanceList().allAttributesDistribution();
+        }
+        /**
+         * 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.
+         */
+        removeDiscreteAttributesFromInstance(instance, size) {
+            let k = 0;
+            for (let i = 0; i < size; i++) {
+                if (this.attributeDistributions[i].size > 0) {
+                    instance.removeAttribute(k);
+                }
+                else {
+                    k++;
+                }
+            }
+        }
+        /**
+         * The removeDiscreteAttributes method removes the discrete attributes from dataDefinition.
+         *
+         * @param size Size of item that attributes will be removed.
+         */
+        removeDiscreteAttributesFromDataDefinition(size) {
+            let dataDefinition = this.dataSet.getDataDefinition();
+            let k = 0;
+            for (let i = 0; i < size; i++) {
+                if (this.attributeDistributions[i].size > 0) {
+                    dataDefinition.removeAttribute(k);
+                }
+                else {
+                    k++;
+                }
+            }
+        }
+    }
+    exports.LaryFilter = LaryFilter;
+});
+//# sourceMappingURL=LaryFilter.js.map

package/dist/Filter/LaryFilter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LaryFilter.js","sourceRoot":"","sources":["../../source/Filter/LaryFilter.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,mDAA8C;IAK9C,MAAsB,UAAW,SAAQ,6BAAa;QAIlD;;;;WAIG;QACH,YAAY,OAAgB;YACxB,KAAK,CAAC,OAAO,CAAC,CAAC;YACf,IAAI,CAAC,sBAAsB,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC,yBAAyB,EAAE,CAAA;QACvF,CAAC;QAED;;;;;;WAMG;QACO,oCAAoC,CAAC,QAAkB,EAAE,IAAY;YAC3E,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,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,QAAQ,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;iBAC/B;qBAAM;oBACH,CAAC,EAAE,CAAC;iBACP;aACJ;QACL,CAAC;QAED;;;;WAIG;QACO,0CAA0C,CAAC,IAAY;YAC7D,IAAI,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,CAAC;YACtD,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,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,eAAe,CAAC,CAAC,CAAC,CAAC;iBACrC;qBAAM;oBACH,CAAC,EAAE,CAAC;iBACP;aACJ;QACL,CAAC;KACJ;IAhDD,gCAgDC"}

package/dist/Filter/LaryToBinary.d.ts

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

package/dist/Filter/LaryToBinary.js

@@ -0,0 +1,67 @@
+(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/BinaryAttribute", "../Attribute/AttributeType"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.LaryToBinary = void 0;
+    const LaryFilter_1 = require("./LaryFilter");
+    const BinaryAttribute_1 = require("../Attribute/BinaryAttribute");
+    const AttributeType_1 = require("../Attribute/AttributeType");
+    class LaryToBinary extends LaryFilter_1.LaryFilter {
+        /**
+         * Converts the data definition with L-ary discrete attributes, to data definition with binary discrete attributes.
+         */
+        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.BINARY);
+                    }
+                }
+            }
+            this.removeDiscreteAttributesFromDataDefinition(size);
+        }
+        /**
+         * Converts discrete attributes of a single instance to binary discrete version using 1-of-L encoding. For example, if
+         * an attribute has values red, green, blue; this attribute will be converted to 3 binary attributes where
+         * red will have the value true false false, green will have the value false true false, and blue will have the value false false true.
+         *
+         * @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 BinaryAttribute_1.BinaryAttribute(false));
+                        }
+                        else {
+                            instance.addAttribute(new BinaryAttribute_1.BinaryAttribute(true));
+                        }
+                    }
+                }
+            }
+            this.removeDiscreteAttributesFromInstance(instance, size);
+        }
+        /**
+         * Constructor for L-ary discrete to binary discrete filter.
+         *
+         * @param dataSet The instances whose L-ary discrete attributes will be converted to binary discrete attributes.
+         */
+        constructor(dataSet) {
+            super(dataSet);
+        }
+    }
+    exports.LaryToBinary = LaryToBinary;
+});
+//# sourceMappingURL=LaryToBinary.js.map

package/dist/Filter/LaryToBinary.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LaryToBinary.js","sourceRoot":"","sources":["../../source/Filter/LaryToBinary.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,6CAAwC;IAGxC,kEAA6D;IAC7D,8DAAyD;IAEzD,MAAa,YAAa,SAAQ,uBAAU;QAExC;;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,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,MAAM,CAAC,CAAC;qBACrD;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,iCAAe,CAAC,KAAK,CAAC,CAAC,CAAC;yBACrD;6BAAM;4BACH,QAAQ,CAAC,YAAY,CAAC,IAAI,iCAAe,CAAC,IAAI,CAAC,CAAC,CAAC;yBACpD;qBACJ;iBACJ;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;IAlDD,oCAkDC"}

package/dist/Filter/Normalize.d.ts

@@ -0,0 +1,21 @@
+import { FeatureFilter } from "./FeatureFilter";
+import { Instance } from "../Instance/Instance";
+import { DataSet } from "../DataSet/DataSet";
+export declare class Normalize extends FeatureFilter {
+    private averageInstance;
+    private standardDeviationInstance;
+    /**
+     * Constructor for normalize feature filter. It calculates and stores the mean (m) and standard deviation (s) of
+     * the sample.
+     *
+     * @param dataSet Instances whose continuous attribute values will be normalized.
+     */
+    constructor(dataSet: DataSet);
+    convertDataDefinition(): void;
+    /**
+     * Normalizes the continuous attributes of a single instance. For all i, new x_i = (x_i - m_i) / s_i.
+     *
+     * @param instance Instance whose attributes will be normalized.
+     */
+    convertInstance(instance: Instance): void;
+}

package/dist/Filter/Normalize.js

@@ -0,0 +1,47 @@
+(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", "./FeatureFilter", "../Attribute/ContinuousAttribute"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.Normalize = void 0;
+    const FeatureFilter_1 = require("./FeatureFilter");
+    const ContinuousAttribute_1 = require("../Attribute/ContinuousAttribute");
+    class Normalize extends FeatureFilter_1.FeatureFilter {
+        /**
+         * Constructor for normalize feature filter. It calculates and stores the mean (m) and standard deviation (s) of
+         * the sample.
+         *
+         * @param dataSet Instances whose continuous attribute values will be normalized.
+         */
+        constructor(dataSet) {
+            super(dataSet);
+            this.averageInstance = dataSet.getInstanceList().average();
+            this.standardDeviationInstance = dataSet.getInstanceList().standardDeviation();
+        }
+        convertDataDefinition() {
+        }
+        /**
+         * Normalizes the continuous attributes of a single instance. For all i, new x_i = (x_i - m_i) / s_i.
+         *
+         * @param instance Instance whose attributes will be normalized.
+         */
+        convertInstance(instance) {
+            for (let i = 0; i < instance.attributeSize(); i++) {
+                if (instance.getAttribute(i) instanceof ContinuousAttribute_1.ContinuousAttribute) {
+                    let xi = instance.getAttribute(i);
+                    let mi = this.averageInstance.getAttribute(i);
+                    let si = this.standardDeviationInstance.getAttribute(i);
+                    xi.setValue((xi.getValue() - mi.getValue()) / si.getValue());
+                }
+            }
+        }
+    }
+    exports.Normalize = Normalize;
+});
+//# sourceMappingURL=Normalize.js.map

package/dist/Filter/Normalize.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Normalize.js","sourceRoot":"","sources":["../../source/Filter/Normalize.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,mDAA8C;IAG9C,0EAAqE;IAErE,MAAa,SAAU,SAAQ,6BAAa;QAKxC;;;;;WAKG;QACH,YAAY,OAAgB;YACxB,KAAK,CAAC,OAAO,CAAC,CAAC;YACf,IAAI,CAAC,eAAe,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC,OAAO,EAAE,CAAC;YAC3D,IAAI,CAAC,yBAAyB,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC,iBAAiB,EAAE,CAAC;QACnF,CAAC;QAED,qBAAqB;QACrB,CAAC;QAED;;;;WAIG;QACH,eAAe,CAAC,QAAkB;YAC9B,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,yCAAmB,EAAE;oBACzD,IAAI,EAAE,GAAyB,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;oBACxD,IAAI,EAAE,GAAyB,IAAI,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;oBACpE,IAAI,EAAE,GAAyB,IAAI,CAAC,yBAAyB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;oBAC9E,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC;iBAChE;aACJ;QACL,CAAC;KAEJ;IApCD,8BAoCC"}

package/dist/Filter/Pca.d.ts

@@ -0,0 +1,44 @@
+import { TrainedFeatureFilter } from "./TrainedFeatureFilter";
+import { Instance } from "../Instance/Instance";
+import { DataSet } from "../DataSet/DataSet";
+export declare class Pca extends TrainedFeatureFilter {
+    private readonly covarianceExplained;
+    private eigenvectors;
+    private readonly numberOfDimensions;
+    /**
+     * The convertDataDefinition method gets the data definitions of the dataSet and removes all the attributes. Then adds
+     * new attributes as CONTINUOUS.
+     */
+    convertDataDefinition(): void;
+    /**
+     * The convertInstance method takes an {@link Instance} as an input and creates a {@link Vector} attributes from continuousAttributes.
+     * After removing all attributes of given instance, it then adds new {@link ContinuousAttribute} by using the dot
+     * product of attribute Vector and the eigenvectors.
+     *
+     * @param instance Instance that will be converted to {@link ContinuousAttribute} by using eigenvectors.
+     */
+    convertInstance(instance: Instance): void;
+    /**
+     * The train method creates an averageVector from continuousAttributeAverage and a covariance {@link Matrix} from that averageVector.
+     * Then finds the eigenvectors of that covariance matrix and removes its unnecessary eigenvectors.
+     */
+    protected train(): void;
+    /**
+     * Constructor that sets the dataSet and dimension. Then calls train method.
+     *
+     * @param dataSet            DataSet that will be used.
+     * @param numberOfDimensionsOrCovarianceExplained Dimension number.
+     */
+    constructor(dataSet: DataSet, numberOfDimensionsOrCovarianceExplained?: number);
+    /**
+     * The removeUnnecessaryEigenvectors methods takes an ArrayList of Eigenvectors. It first calculates the summation
+     * of eigenValues. Then it finds the eigenvectors which have lesser summation than covarianceExplained and removes these
+     * eigenvectors.
+     */
+    private removeUnnecessaryEigenvectors;
+    /**
+     * The removeAllEigenvectorsExceptTheMostImportantK method takes an {@link Array} of {@link Eigenvector}s and removes the
+     * surplus eigenvectors when the number of eigenvectors is greater than the dimension.
+     */
+    private removeAllEigenvectorsExceptTheMostImportantK;
+}

package/dist/Filter/Pca.js

@@ -0,0 +1,109 @@
+(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", "./TrainedFeatureFilter", "nlptoolkit-math/dist/Vector", "../Attribute/ContinuousAttribute", "../Attribute/AttributeType"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.Pca = void 0;
+    const TrainedFeatureFilter_1 = require("./TrainedFeatureFilter");
+    const Vector_1 = require("nlptoolkit-math/dist/Vector");
+    const ContinuousAttribute_1 = require("../Attribute/ContinuousAttribute");
+    const AttributeType_1 = require("../Attribute/AttributeType");
+    class Pca extends TrainedFeatureFilter_1.TrainedFeatureFilter {
+        /**
+         * Constructor that sets the dataSet and dimension. Then calls train method.
+         *
+         * @param dataSet            DataSet that will be used.
+         * @param numberOfDimensionsOrCovarianceExplained Dimension number.
+         */
+        constructor(dataSet, numberOfDimensionsOrCovarianceExplained) {
+            super(dataSet);
+            this.covarianceExplained = 0.99;
+            this.eigenvectors = new Array();
+            this.numberOfDimensions = -1;
+            if (numberOfDimensionsOrCovarianceExplained != undefined) {
+                if (Number.isInteger(numberOfDimensionsOrCovarianceExplained)) {
+                    this.numberOfDimensions = numberOfDimensionsOrCovarianceExplained;
+                }
+                else {
+                    this.covarianceExplained = numberOfDimensionsOrCovarianceExplained;
+                }
+            }
+            this.train();
+        }
+        /**
+         * The convertDataDefinition method gets the data definitions of the dataSet and removes all the attributes. Then adds
+         * new attributes as CONTINUOUS.
+         */
+        convertDataDefinition() {
+            let dataDefinition = this.dataSet.getDataDefinition();
+            dataDefinition.removeAllAttributes();
+            for (let i = 0; i < this.eigenvectors.length; i++) {
+                dataDefinition.addAttribute(AttributeType_1.AttributeType.CONTINUOUS);
+            }
+        }
+        /**
+         * The convertInstance method takes an {@link Instance} as an input and creates a {@link Vector} attributes from continuousAttributes.
+         * After removing all attributes of given instance, it then adds new {@link ContinuousAttribute} by using the dot
+         * product of attribute Vector and the eigenvectors.
+         *
+         * @param instance Instance that will be converted to {@link ContinuousAttribute} by using eigenvectors.
+         */
+        convertInstance(instance) {
+            let attributes = new Vector_1.Vector(instance.continuousAttributes());
+            instance.removeAllAttributes();
+            for (let eigenvector of this.eigenvectors) {
+                instance.addAttribute(new ContinuousAttribute_1.ContinuousAttribute(attributes.dotProduct(eigenvector)));
+            }
+        }
+        /**
+         * The train method creates an averageVector from continuousAttributeAverage and a covariance {@link Matrix} from that averageVector.
+         * Then finds the eigenvectors of that covariance matrix and removes its unnecessary eigenvectors.
+         */
+        train() {
+            let averageVector = new Vector_1.Vector(this.dataSet.getInstanceList().continuousAttributeAverage());
+            let covariance = this.dataSet.getInstanceList().covariance(averageVector);
+            this.eigenvectors = covariance.characteristics();
+            if (this.numberOfDimensions != -1) {
+                this.removeAllEigenvectorsExceptTheMostImportantK();
+            }
+            else {
+                this.removeUnnecessaryEigenvectors();
+            }
+        }
+        /**
+         * The removeUnnecessaryEigenvectors methods takes an ArrayList of Eigenvectors. It first calculates the summation
+         * of eigenValues. Then it finds the eigenvectors which have lesser summation than covarianceExplained and removes these
+         * eigenvectors.
+         */
+        removeUnnecessaryEigenvectors() {
+            let sum = 0.0, currentSum = 0.0;
+            for (let eigenvector of this.eigenvectors) {
+                sum += eigenvector.getEigenValue();
+            }
+            for (let i = 0; i < this.eigenvectors.length; i++) {
+                if (currentSum / sum < this.covarianceExplained) {
+                    currentSum += this.eigenvectors[i].getEigenValue();
+                }
+                else {
+                    this.eigenvectors.splice(i, 1);
+                    i--;
+                }
+            }
+        }
+        /**
+         * The removeAllEigenvectorsExceptTheMostImportantK method takes an {@link Array} of {@link Eigenvector}s and removes the
+         * surplus eigenvectors when the number of eigenvectors is greater than the dimension.
+         */
+        removeAllEigenvectorsExceptTheMostImportantK() {
+            this.eigenvectors.splice(this.numberOfDimensions, this.eigenvectors.length - this.numberOfDimensions);
+        }
+    }
+    exports.Pca = Pca;
+});
+//# sourceMappingURL=Pca.js.map

package/dist/Filter/Pca.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Pca.js","sourceRoot":"","sources":["../../source/Filter/Pca.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,iEAA4D;IAI5D,wDAAmD;IACnD,0EAAqE;IAErE,8DAAyD;IAEzD,MAAa,GAAI,SAAQ,2CAAoB;QAgDzC;;;;;WAKG;QACH,YAAY,OAAgB,EAAE,uCAAgD;YAC1E,KAAK,CAAC,OAAO,CAAC,CAAC;YArDF,wBAAmB,GAAW,IAAI,CAAA;YAC3C,iBAAY,GAAuB,IAAI,KAAK,EAAe,CAAA;YAClD,uBAAkB,GAAY,CAAC,CAAC,CAAA;YAoD7C,IAAI,uCAAuC,IAAI,SAAS,EAAC;gBACrD,IAAI,MAAM,CAAC,SAAS,CAAC,uCAAuC,CAAC,EAAC;oBAC1D,IAAI,CAAC,kBAAkB,GAAG,uCAAuC,CAAA;iBACpE;qBAAM;oBACH,IAAI,CAAC,mBAAmB,GAAG,uCAAuC,CAAA;iBACrE;aACJ;YACD,IAAI,CAAC,KAAK,EAAE,CAAA;QAChB,CAAC;QA1DD;;;WAGG;QACH,qBAAqB;YACjB,IAAI,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,CAAC;YACtD,cAAc,CAAC,mBAAmB,EAAE,CAAC;YACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC/C,cAAc,CAAC,YAAY,CAAC,6BAAa,CAAC,UAAU,CAAC,CAAC;aACzD;QACL,CAAC;QAED;;;;;;WAMG;QACH,eAAe,CAAC,QAAkB;YAC9B,IAAI,UAAU,GAAY,IAAI,eAAM,CAAC,QAAQ,CAAC,oBAAoB,EAAE,CAAC,CAAC;YACtE,QAAQ,CAAC,mBAAmB,EAAE,CAAC;YAC/B,KAAK,IAAI,WAAW,IAAI,IAAI,CAAC,YAAY,EAAE;gBACvC,QAAQ,CAAC,YAAY,CAAC,IAAI,yCAAmB,CAAC,UAAU,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;aACtF;QACL,CAAC;QAED;;;WAGG;QACO,KAAK;YACX,IAAI,aAAa,GAAY,IAAI,eAAM,CAAC,IAAI,CAAC,OAAO,CAAC,eAAe,EAAE,CAAC,0BAA0B,EAAE,CAAC,CAAC;YACrG,IAAI,UAAU,GAAY,IAAI,CAAC,OAAO,CAAC,eAAe,EAAE,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC;YACnF,IAAI,CAAC,YAAY,GAAG,UAAU,CAAC,eAAe,EAAE,CAAC;YACjD,IAAI,IAAI,CAAC,kBAAkB,IAAI,CAAC,CAAC,EAAE;gBAC/B,IAAI,CAAC,4CAA4C,EAAE,CAAC;aACvD;iBAAM;gBACH,IAAI,CAAC,6BAA6B,EAAE,CAAC;aACxC;QACL,CAAC;QAoBD;;;;WAIG;QACK,6BAA6B;YACjC,IAAI,GAAG,GAAG,GAAG,EAAE,UAAU,GAAG,GAAG,CAAC;YAChC,KAAK,IAAI,WAAW,IAAI,IAAI,CAAC,YAAY,EAAE;gBACvC,GAAG,IAAI,WAAW,CAAC,aAAa,EAAE,CAAC;aACtC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC/C,IAAI,UAAU,GAAG,GAAG,GAAG,IAAI,CAAC,mBAAmB,EAAE;oBAC7C,UAAU,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;iBACtD;qBAAM;oBACH,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC/B,CAAC,EAAE,CAAC;iBACP;aACJ;QACL,CAAC;QAED;;;WAGG;QACK,4CAA4C;YAChD,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,kBAAkB,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,IAAI,CAAC,kBAAkB,CAAC,CAAA;QACzG,CAAC;KAEJ;IA9FD,kBA8FC"}

package/dist/Filter/TrainedFeatureFilter.d.ts

@@ -0,0 +1,11 @@
+import { FeatureFilter } from "./FeatureFilter";
+import { DataSet } from "../DataSet/DataSet";
+export declare abstract class TrainedFeatureFilter extends FeatureFilter {
+    protected abstract train(): void;
+    /**
+     * Constructor that sets the dataSet.
+     *
+     * @param dataSet DataSet that will bu used.
+     */
+    constructor(dataSet: DataSet);
+}

package/dist/Filter/TrainedFeatureFilter.js

@@ -0,0 +1,26 @@
+(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", "./FeatureFilter"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.TrainedFeatureFilter = void 0;
+    const FeatureFilter_1 = require("./FeatureFilter");
+    class TrainedFeatureFilter extends FeatureFilter_1.FeatureFilter {
+        /**
+         * Constructor that sets the dataSet.
+         *
+         * @param dataSet DataSet that will bu used.
+         */
+        constructor(dataSet) {
+            super(dataSet);
+        }
+    }
+    exports.TrainedFeatureFilter = TrainedFeatureFilter;
+});
+//# sourceMappingURL=TrainedFeatureFilter.js.map

package/dist/Filter/TrainedFeatureFilter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TrainedFeatureFilter.js","sourceRoot":"","sources":["../../source/Filter/TrainedFeatureFilter.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,mDAA8C;IAG9C,MAAsB,oBAAqB,SAAQ,6BAAa;QAI5D;;;;WAIG;QACH,YAAY,OAAgB;YACxB,KAAK,CAAC,OAAO,CAAC,CAAC;QACnB,CAAC;KAEJ;IAbD,oDAaC"}

package/dist/Instance/CompositeInstance.d.ts

@@ -0,0 +1,32 @@
+import { Instance } from "./Instance";
+import { Attribute } from "../Attribute/Attribute";
+export declare class CompositeInstance extends Instance {
+    private possibleClassLabels;
+    /**
+     * Constructor of {@link CompositeInstance} class which takes a class label, attributes and an {@link ArrayList} of
+     * possible labels as inputs. It generates a new composite instance with given labels, attributes and possible labels.
+     *
+     * @param classLabel          Class label of the composite instance.
+     * @param attributes          Attributes of the composite instance.
+     * @param possibleClassLabels Possible labels of the composite instance.
+     */
+    constructor(classLabel: string, attributes?: Array<Attribute>, possibleClassLabels?: Array<string>);
+    /**
+     * Accessor for the possible class labels.
+     *
+     * @return Possible class labels of the composite instance.
+     */
+    getPossibleClassLabels(): Array<string>;
+    /**
+     * Mutator method for possible class labels.
+     *
+     * @param possibleClassLabels Ner value of possible class labels.
+     */
+    setPossibleClassLabels(possibleClassLabels: Array<string>): void;
+    /**
+     * Converts composite instance to {@link String}.
+     *
+     * @return String representation of composite instance.
+     */
+    toString(): string;
+}

package/dist/Instance/CompositeInstance.js

@@ -0,0 +1,61 @@
+(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"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.CompositeInstance = void 0;
+    const Instance_1 = require("./Instance");
+    class CompositeInstance extends Instance_1.Instance {
+        /**
+         * Constructor of {@link CompositeInstance} class which takes a class label, attributes and an {@link ArrayList} of
+         * possible labels as inputs. It generates a new composite instance with given labels, attributes and possible labels.
+         *
+         * @param classLabel          Class label of the composite instance.
+         * @param attributes          Attributes of the composite instance.
+         * @param possibleClassLabels Possible labels of the composite instance.
+         */
+        constructor(classLabel, attributes, possibleClassLabels) {
+            super(classLabel, attributes);
+            this.possibleClassLabels = new Array();
+            if (possibleClassLabels != undefined) {
+                this.possibleClassLabels = possibleClassLabels;
+            }
+        }
+        /**
+         * Accessor for the possible class labels.
+         *
+         * @return Possible class labels of the composite instance.
+         */
+        getPossibleClassLabels() {
+            return this.possibleClassLabels;
+        }
+        /**
+         * Mutator method for possible class labels.
+         *
+         * @param possibleClassLabels Ner value of possible class labels.
+         */
+        setPossibleClassLabels(possibleClassLabels) {
+            this.possibleClassLabels = possibleClassLabels;
+        }
+        /**
+         * Converts composite instance to {@link String}.
+         *
+         * @return String representation of composite instance.
+         */
+        toString() {
+            let result = super.toString();
+            for (let possibleClassLabel of this.possibleClassLabels) {
+                result += ";" + possibleClassLabel;
+            }
+            return result.toString();
+        }
+    }
+    exports.CompositeInstance = CompositeInstance;
+});
+//# sourceMappingURL=CompositeInstance.js.map

package/dist/Instance/CompositeInstance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CompositeInstance.js","sourceRoot":"","sources":["../../source/Instance/CompositeInstance.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,yCAAoC;IAGpC,MAAa,iBAAkB,SAAQ,mBAAQ;QAI3C;;;;;;;WAOG;QACH,YAAY,UAAkB,EAAE,UAA6B,EAAE,mBAAmC;YAC9F,KAAK,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YAX1B,wBAAmB,GAAkB,IAAI,KAAK,EAAU,CAAA;YAY5D,IAAI,mBAAmB,IAAI,SAAS,EAAC;gBACjC,IAAI,CAAC,mBAAmB,GAAG,mBAAmB,CAAA;aACjD;QACL,CAAC;QAED;;;;WAIG;QACH,sBAAsB;YAClB,OAAO,IAAI,CAAC,mBAAmB,CAAA;QACnC,CAAC;QAED;;;;WAIG;QACH,sBAAsB,CAAC,mBAAkC;YACrD,IAAI,CAAC,mBAAmB,GAAG,mBAAmB,CAAA;QAClD,CAAC;QAED;;;;WAIG;QACH,QAAQ;YACJ,IAAI,MAAM,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;YAC9B,KAAK,IAAI,kBAAkB,IAAI,IAAI,CAAC,mBAAmB,EAAE;gBACrD,MAAM,IAAI,GAAG,GAAG,kBAAkB,CAAC;aACtC;YACD,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC7B,CAAC;KACJ;IAjDD,8CAiDC"}

package/dist/Instance/Instance.d.ts

@@ -0,0 +1,89 @@
+import { Attribute } from "../Attribute/Attribute";
+import { Vector } from "nlptoolkit-math/dist/Vector";
+import { FeatureSubSet } from "../FeatureSelection/FeatureSubSet";
+export declare class Instance {
+    private readonly classLabel;
+    private attributes;
+    /**
+     * Constructor for a single instance. Given the attributes and class label, it generates a new instance.
+     *
+     * @param classLabel Class label of the instance.
+     * @param attributes Attributes of the instance.
+     */
+    constructor(classLabel: string, attributes?: Array<Attribute>);
+    /**
+     * Adds a new attribute.
+     *
+     * @param value Attribute to be added.
+     */
+    addAttribute(value: any): void;
+    /**
+     * Adds a {@link Vector} of continuous attributes.
+     *
+     * @param vector {@link Vector} that has the continuous attributes.
+     */
+    addVectorAttribute(vector: Vector): void;
+    /**
+     * Removes attribute with the given index from the attributes list.
+     *
+     * @param index Index of the attribute to be removed.
+     */
+    removeAttribute(index: number): void;
+    /**
+     * Removes all the attributes from the attributes list.
+     */
+    removeAllAttributes(): void;
+    /**
+     * Accessor for a single attribute.
+     *
+     * @param index Index of the attribute to be accessed.
+     * @return Attribute with index 'index'.
+     */
+    getAttribute(index: number): Attribute;
+    /**
+     * Returns the number of attributes in the attributes list.
+     *
+     * @return Number of attributes in the attributes list.
+     */
+    attributeSize(): number;
+    /**
+     * Returns the number of continuous and discrete indexed attributes in the attributes list.
+     *
+     * @return Number of continuous and discrete indexed attributes in the attributes list.
+     */
+    continuousAttributeSize(): number;
+    /**
+     * The continuousAttributes method creates a new {@link Array} result and it adds the continuous attributes of the
+     * attributes list and also it adds 1 for the discrete indexed attributes
+     * .
+     *
+     * @return result {@link Array} that has continuous and discrete indexed attributes.
+     */
+    continuousAttributes(): Array<number>;
+    /**
+     * Accessor for the class label.
+     *
+     * @return Class label of the instance.
+     */
+    getClassLabel(): string;
+    /**
+     * Converts instance to a {@link String}.
+     *
+     * @return A string of attributes separated with comma character.
+     */
+    toString(): string;
+    /**
+     * The getSubSetOfFeatures method takes a {@link FeatureSubSet} as an input. First it creates a result {@link Instance}
+     * with the class label, and adds the attributes of the given featureSubSet to it.
+     *
+     * @param featureSubSet {@link FeatureSubSet} an {@link Array} of indices.
+     * @return result Instance.
+     */
+    getSubSetOfFeatures(featureSubSet: FeatureSubSet): Instance;
+    /**
+     * The toVector method returns a {@link Vector} of continuous attributes and discrete indexed attributes.
+     *
+     * @return {@link Vector} of continuous attributes and discrete indexed attributes.
+     */
+    toVector(): Vector;
+}