nlptoolkit-classification 1.0.0

package/dist/Model/KnnModel.d.ts

@@ -0,0 +1,36 @@
+import { Model } from "./Model";
+import { InstanceList } from "../InstanceList/InstanceList";
+import { Instance } from "../Instance/Instance";
+import { DistanceMetric } from "../DistanceMetric/DistanceMetric";
+export declare class KnnModel extends Model {
+    private data;
+    private k;
+    private distanceMetric;
+    /**
+     * Constructor that sets the data {@link InstanceList}, k value and the {@link DistanceMetric}.
+     *
+     * @param data           {@link InstanceList} input.
+     * @param k              K value.
+     * @param distanceMetric {@link DistanceMetric} input.
+     */
+    constructor(data: InstanceList, k: number, distanceMetric: DistanceMetric);
+    /**
+     * The predict method takes an {@link Instance} as an input and finds the nearest neighbors of given instance. Then
+     * it returns the first possible class label as the predicted class.
+     *
+     * @param instance {@link Instance} to make prediction.
+     * @return The first possible class label as the predicted class.
+     */
+    predict(instance: Instance): string;
+    predictProbability(instance: Instance): Map<string, number>;
+    /**
+     * The nearestNeighbors method takes an {@link Instance} as an input. First it gets the possible class labels, then loops
+     * through the data {@link InstanceList} and creates new {@link Array} of {@link KnnInstance}s and adds the corresponding data with
+     * the distance between data and given instance. After sorting this newly created ArrayList, it loops k times and
+     * returns the first k instances as an {@link InstanceList}.
+     *
+     * @param instance {@link Instance} to find nearest neighbors/
+     * @return The first k instances which are nearest to the given instance as an {@link InstanceList}.
+     */
+    nearestNeighbors(instance: Instance): InstanceList;
+}

package/dist/Model/KnnModel.js

@@ -0,0 +1,83 @@
+(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", "./Model", "../InstanceList/InstanceList", "../Instance/CompositeInstance", "./KnnInstance"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.KnnModel = void 0;
+    const Model_1 = require("./Model");
+    const InstanceList_1 = require("../InstanceList/InstanceList");
+    const CompositeInstance_1 = require("../Instance/CompositeInstance");
+    const KnnInstance_1 = require("./KnnInstance");
+    class KnnModel extends Model_1.Model {
+        /**
+         * Constructor that sets the data {@link InstanceList}, k value and the {@link DistanceMetric}.
+         *
+         * @param data           {@link InstanceList} input.
+         * @param k              K value.
+         * @param distanceMetric {@link DistanceMetric} input.
+         */
+        constructor(data, k, distanceMetric) {
+            super();
+            this.data = data;
+            this.k = k;
+            this.distanceMetric = distanceMetric;
+        }
+        /**
+         * The predict method takes an {@link Instance} as an input and finds the nearest neighbors of given instance. Then
+         * it returns the first possible class label as the predicted class.
+         *
+         * @param instance {@link Instance} to make prediction.
+         * @return The first possible class label as the predicted class.
+         */
+        predict(instance) {
+            let nearestNeighbors = this.nearestNeighbors(instance);
+            let predictedClass;
+            if (instance instanceof CompositeInstance_1.CompositeInstance && nearestNeighbors.size() == 0) {
+                predictedClass = instance.getPossibleClassLabels()[0];
+            }
+            else {
+                predictedClass = Model_1.Model.getMaximum(nearestNeighbors.getClassLabels());
+            }
+            return predictedClass;
+        }
+        predictProbability(instance) {
+            let nearestNeighbors = this.nearestNeighbors(instance);
+            return nearestNeighbors.classDistribution().getProbabilityDistribution();
+        }
+        /**
+         * The nearestNeighbors method takes an {@link Instance} as an input. First it gets the possible class labels, then loops
+         * through the data {@link InstanceList} and creates new {@link Array} of {@link KnnInstance}s and adds the corresponding data with
+         * the distance between data and given instance. After sorting this newly created ArrayList, it loops k times and
+         * returns the first k instances as an {@link InstanceList}.
+         *
+         * @param instance {@link Instance} to find nearest neighbors/
+         * @return The first k instances which are nearest to the given instance as an {@link InstanceList}.
+         */
+        nearestNeighbors(instance) {
+            let result = new InstanceList_1.InstanceList();
+            let instances = new Array();
+            let possibleClassLabels = undefined;
+            if (instance instanceof CompositeInstance_1.CompositeInstance) {
+                possibleClassLabels = instance.getPossibleClassLabels();
+            }
+            for (let i = 0; i < this.data.size(); i++) {
+                if (!(instance instanceof CompositeInstance_1.CompositeInstance) || possibleClassLabels.includes(this.data.get(i).getClassLabel())) {
+                    instances.push(new KnnInstance_1.KnnInstance(this.data.get(i), this.distanceMetric.distance(this.data.get(i), instance)));
+                }
+            }
+            instances.sort((a, b) => a.getDistance() < b.getDistance() ? -1 : a.getDistance() > b.getDistance() ? 1 : 0);
+            for (let i = 0; i < Math.min(this.k, instances.length); i++) {
+                result.add(instances[i].getInstance());
+            }
+            return result;
+        }
+    }
+    exports.KnnModel = KnnModel;
+});
+//# sourceMappingURL=KnnModel.js.map

package/dist/Model/KnnModel.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"KnnModel.js","sourceRoot":"","sources":["../../source/Model/KnnModel.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,mCAA8B;IAC9B,+DAA0D;IAG1D,qEAAgE;IAChE,+CAA0C;IAE1C,MAAa,QAAS,SAAQ,aAAK;QAM/B;;;;;;WAMG;QACH,YAAY,IAAkB,EAAE,CAAS,EAAE,cAA8B;YACrE,KAAK,EAAE,CAAC;YACR,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;YAChB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;YACV,IAAI,CAAC,cAAc,GAAG,cAAc,CAAA;QACxC,CAAC;QAED;;;;;;WAMG;QACH,OAAO,CAAC,QAAkB;YACtB,IAAI,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;YACvD,IAAI,cAAc,CAAA;YAClB,IAAI,QAAQ,YAAY,qCAAiB,IAAI,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE;gBACvE,cAAc,GAAwB,QAAS,CAAC,sBAAsB,EAAE,CAAC,CAAC,CAAC,CAAC;aAC/E;iBAAM;gBACH,cAAc,GAAG,aAAK,CAAC,UAAU,CAAC,gBAAgB,CAAC,cAAc,EAAE,CAAC,CAAC;aACxE;YACD,OAAO,cAAc,CAAC;QAC1B,CAAC;QAED,kBAAkB,CAAC,QAAkB;YACjC,IAAI,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;YACvD,OAAO,gBAAgB,CAAC,iBAAiB,EAAE,CAAC,0BAA0B,EAAE,CAAC;QAC7E,CAAC;QAED;;;;;;;;WAQG;QACH,gBAAgB,CAAC,QAAkB;YAC/B,IAAI,MAAM,GAAG,IAAI,2BAAY,EAAE,CAAC;YAChC,IAAI,SAAS,GAAG,IAAI,KAAK,EAAe,CAAC;YACzC,IAAI,mBAAmB,GAAG,SAAS,CAAC;YACpC,IAAI,QAAQ,YAAY,qCAAiB,EAAE;gBACvC,mBAAmB,GAAwB,QAAS,CAAC,sBAAsB,EAAE,CAAC;aACjF;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE;gBACvC,IAAI,CAAC,CAAC,QAAQ,YAAY,qCAAiB,CAAC,IAAI,mBAAmB,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,EAAE;oBAC5G,SAAS,CAAC,IAAI,CAAC,IAAI,yBAAW,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;iBAC/G;aACJ;YACD,SAAS,CAAC,IAAI,CAAC,CAAC,CAAc,EAAE,CAAc,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA,CAAC,CAAC,CAAC,CAAC,CAAC;YACtI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE;gBACzD,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;aAC1C;YACD,OAAO,MAAM,CAAC;QAClB,CAAC;KACJ;IAtED,4BAsEC"}

package/dist/Model/LdaModel.d.ts

@@ -0,0 +1,25 @@
+import { GaussianModel } from "./GaussianModel";
+import { Vector } from "nlptoolkit-math/dist/Vector";
+import { DiscreteDistribution } from "nlptoolkit-math/dist/DiscreteDistribution";
+import { Instance } from "../Instance/Instance";
+export declare class LdaModel extends GaussianModel {
+    protected w0: Map<string, number>;
+    protected w: Map<string, Vector>;
+    /**
+     * A constructor which sets the priorDistribution, w and w0 according to given inputs.
+     *
+     * @param priorDistribution {@link DiscreteDistribution} input.
+     * @param w                 {@link HashMap} of String and Vectors.
+     * @param w0                {@link HashMap} of String and Double.
+     */
+    constructor(priorDistribution: DiscreteDistribution, w: Map<string, Vector>, w0: Map<string, number>);
+    /**
+     * The calculateMetric method takes an {@link Instance} and a String as inputs. It returns the dot product of given Instance
+     * and wi plus w0i.
+     *
+     * @param instance {@link Instance} input.
+     * @param Ci       String input.
+     * @return The dot product of given Instance and wi plus w0i.
+     */
+    calculateMetric(instance: Instance, Ci: string): number;
+}

package/dist/Model/LdaModel.js

@@ -0,0 +1,45 @@
+(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", "./GaussianModel"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.LdaModel = void 0;
+    const GaussianModel_1 = require("./GaussianModel");
+    class LdaModel extends GaussianModel_1.GaussianModel {
+        /**
+         * A constructor which sets the priorDistribution, w and w0 according to given inputs.
+         *
+         * @param priorDistribution {@link DiscreteDistribution} input.
+         * @param w                 {@link HashMap} of String and Vectors.
+         * @param w0                {@link HashMap} of String and Double.
+         */
+        constructor(priorDistribution, w, w0) {
+            super();
+            this.priorDistribution = priorDistribution;
+            this.w = w;
+            this.w0 = w0;
+        }
+        /**
+         * The calculateMetric method takes an {@link Instance} and a String as inputs. It returns the dot product of given Instance
+         * and wi plus w0i.
+         *
+         * @param instance {@link Instance} input.
+         * @param Ci       String input.
+         * @return The dot product of given Instance and wi plus w0i.
+         */
+        calculateMetric(instance, Ci) {
+            let xi = instance.toVector();
+            let wi = this.w.get(Ci);
+            let w0i = this.w0.get(Ci);
+            return wi.dotProduct(xi) + w0i;
+        }
+    }
+    exports.LdaModel = LdaModel;
+});
+//# sourceMappingURL=LdaModel.js.map

package/dist/Model/LdaModel.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LdaModel.js","sourceRoot":"","sources":["../../source/Model/LdaModel.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,mDAA8C;IAK9C,MAAa,QAAS,SAAQ,6BAAa;QAKvC;;;;;;WAMG;QACH,YAAY,iBAAuC,EAAE,CAAsB,EAAE,EAAuB;YAChG,KAAK,EAAE,CAAC;YACR,IAAI,CAAC,iBAAiB,GAAG,iBAAiB,CAAC;YAC3C,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACX,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACjB,CAAC;QAED;;;;;;;WAOG;QACH,eAAe,CAAC,QAAkB,EAAE,EAAU;YAC1C,IAAI,EAAE,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC;YAC7B,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACxB,IAAI,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC1B,OAAO,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;QACnC,CAAC;KACJ;IAjCD,4BAiCC"}

package/dist/Model/LinearPerceptronModel.d.ts

@@ -0,0 +1,21 @@
+import { NeuralNetworkModel } from "./NeuralNetworkModel";
+import { Matrix } from "nlptoolkit-math/dist/Matrix";
+import { InstanceList } from "../InstanceList/InstanceList";
+import { LinearPerceptronParameter } from "../Parameter/LinearPerceptronParameter";
+export declare class LinearPerceptronModel extends NeuralNetworkModel {
+    protected W: Matrix;
+    /**
+     * Constructor that takes {@link InstanceList}s as trainsSet and validationSet. Initially it allocates layer weights,
+     * then creates an input vector by using given trainSet and finds error. Via the validationSet it finds the classification
+     * performance and at the end it reassigns the allocated weight Matrix with the matrix that has the best accuracy.
+     *
+     * @param trainSet      InstanceList that is used to train.
+     * @param validationSet InstanceList that is used to validate.
+     * @param parameters    Linear perceptron parameters; learningRate, etaDecrease, crossValidationRatio, epoch.
+     */
+    constructor(trainSet: InstanceList, validationSet?: InstanceList, parameters?: LinearPerceptronParameter);
+    /**
+     * The calculateOutput method calculates the {@link Matrix} y by multiplying Matrix W with {@link Vector} x.
+     */
+    protected calculateOutput(): void;
+}

package/dist/Model/LinearPerceptronModel.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", "./NeuralNetworkModel", "nlptoolkit-math/dist/Matrix", "../Performance/ClassificationPerformance"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.LinearPerceptronModel = void 0;
+    const NeuralNetworkModel_1 = require("./NeuralNetworkModel");
+    const Matrix_1 = require("nlptoolkit-math/dist/Matrix");
+    const ClassificationPerformance_1 = require("../Performance/ClassificationPerformance");
+    class LinearPerceptronModel extends NeuralNetworkModel_1.NeuralNetworkModel {
+        /**
+         * Constructor that takes {@link InstanceList}s as trainsSet and validationSet. Initially it allocates layer weights,
+         * then creates an input vector by using given trainSet and finds error. Via the validationSet it finds the classification
+         * performance and at the end it reassigns the allocated weight Matrix with the matrix that has the best accuracy.
+         *
+         * @param trainSet      InstanceList that is used to train.
+         * @param validationSet InstanceList that is used to validate.
+         * @param parameters    Linear perceptron parameters; learningRate, etaDecrease, crossValidationRatio, epoch.
+         */
+        constructor(trainSet, validationSet, parameters) {
+            super(trainSet);
+            if (validationSet != undefined) {
+                let W = this.allocateLayerWeights(this.K, this.d + 1);
+                let bestW = W.clone();
+                let bestClassificationPerformance = new ClassificationPerformance_1.ClassificationPerformance(0.0);
+                let epoch = parameters.getEpoch();
+                let learningRate = parameters.getLearningRate();
+                for (let i = 0; i < epoch; i++) {
+                    trainSet.shuffle(parameters.getSeed());
+                    for (let j = 0; j < trainSet.size(); j++) {
+                        this.createInputVector(trainSet.get(j));
+                        let rMinusY = this.calculateRMinusY(trainSet.get(j), this.x, W);
+                        let deltaW = new Matrix_1.Matrix(rMinusY, this.x);
+                        deltaW.multiplyWithConstant(learningRate);
+                        W.add(deltaW);
+                    }
+                    let currentClassificationPerformance = this.testClassifier(validationSet);
+                    if (currentClassificationPerformance.getAccuracy() > bestClassificationPerformance.getAccuracy()) {
+                        bestClassificationPerformance = currentClassificationPerformance;
+                        bestW = W.clone();
+                    }
+                    learningRate *= parameters.getEtaDecrease();
+                }
+                W = bestW;
+            }
+        }
+        /**
+         * The calculateOutput method calculates the {@link Matrix} y by multiplying Matrix W with {@link Vector} x.
+         */
+        calculateOutput() {
+            this.y = this.W.multiplyWithVectorFromRight(this.x);
+        }
+    }
+    exports.LinearPerceptronModel = LinearPerceptronModel;
+});
+//# sourceMappingURL=LinearPerceptronModel.js.map

package/dist/Model/LinearPerceptronModel.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LinearPerceptronModel.js","sourceRoot":"","sources":["../../source/Model/LinearPerceptronModel.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,6DAAwD;IACxD,wDAAmD;IAGnD,wFAAmF;IAEnF,MAAa,qBAAsB,SAAQ,uCAAkB;QAIzD;;;;;;;;WAQG;QACH,YAAY,QAAsB,EAAE,aAA4B,EAAE,UAAsC;YACpG,KAAK,CAAC,QAAQ,CAAC,CAAC;YAChB,IAAI,aAAa,IAAI,SAAS,EAAC;gBAC3B,IAAI,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACtD,IAAI,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;gBACtB,IAAI,6BAA6B,GAAG,IAAI,qDAAyB,CAAC,GAAG,CAAC,CAAC;gBACvE,IAAI,KAAK,GAAG,UAAU,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,YAAY,GAAG,UAAU,CAAC,eAAe,EAAE,CAAC;gBAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;oBAC5B,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;oBACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE;wBACtC,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;wBACxC,IAAI,OAAO,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAChE,IAAI,MAAM,GAAG,IAAI,eAAM,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;wBACzC,MAAM,CAAC,oBAAoB,CAAC,YAAY,CAAC,CAAC;wBAC1C,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;qBACjB;oBACD,IAAI,gCAAgC,GAAG,IAAI,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;oBAC1E,IAAI,gCAAgC,CAAC,WAAW,EAAE,GAAG,6BAA6B,CAAC,WAAW,EAAE,EAAE;wBAC9F,6BAA6B,GAAG,gCAAgC,CAAC;wBACjE,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;qBACrB;oBACD,YAAY,IAAI,UAAU,CAAC,cAAc,EAAE,CAAC;iBAC/C;gBACD,CAAC,GAAG,KAAK,CAAC;aACb;QACL,CAAC;QAED;;WAEG;QACO,eAAe;YACrB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,2BAA2B,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxD,CAAC;KAEJ;IAhDD,sDAgDC"}

package/dist/Model/Model.d.ts

@@ -0,0 +1,12 @@
+import { Instance } from "../Instance/Instance";
+export declare abstract class Model {
+    abstract predict(instance: Instance): string;
+    abstract predictProbability(instance: Instance): Map<string, number>;
+    /**
+     * Given an array of class labels, returns the maximum occurred one.
+     *
+     * @param classLabels An array of class labels.
+     * @return The class label that occurs most in the array of class labels (mod of class label list).
+     */
+    static getMaximum(classLabels: Array<string>): string;
+}

package/dist/Model/Model.js

@@ -0,0 +1,31 @@
+(function (factory) {
+    if (typeof module === "object" && typeof module.exports === "object") {
+        var v = factory(require, exports);
+        if (v !== undefined) module.exports = v;
+    }
+    else if (typeof define === "function" && define.amd) {
+        define(["require", "exports", "nlptoolkit-datastructure/dist/CounterHashMap"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.Model = void 0;
+    const CounterHashMap_1 = require("nlptoolkit-datastructure/dist/CounterHashMap");
+    class Model {
+        /**
+         * Given an array of class labels, returns the maximum occurred one.
+         *
+         * @param classLabels An array of class labels.
+         * @return The class label that occurs most in the array of class labels (mod of class label list).
+         */
+        static getMaximum(classLabels) {
+            let frequencies = new CounterHashMap_1.CounterHashMap();
+            for (let label of classLabels) {
+                frequencies.put(label);
+            }
+            return frequencies.max();
+        }
+    }
+    exports.Model = Model;
+});
+//# sourceMappingURL=Model.js.map

package/dist/Model/Model.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Model.js","sourceRoot":"","sources":["../../source/Model/Model.ts"],"names":[],"mappings":";;;;;;;;;;;;IACA,iFAA4E;IAE5E,MAAsB,KAAK;QAKvB;;;;;WAKG;QACH,MAAM,CAAC,UAAU,CAAC,WAA0B;YACxC,IAAI,WAAW,GAAG,IAAI,+BAAc,EAAU,CAAC;YAC/C,KAAK,IAAI,KAAK,IAAI,WAAW,EAAE;gBAC3B,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;aAC1B;YACD,OAAO,WAAW,CAAC,GAAG,EAAE,CAAC;QAC7B,CAAC;KACJ;IAlBD,sBAkBC"}

package/dist/Model/MultiLayerPerceptronModel.d.ts

@@ -0,0 +1,29 @@
+import { LinearPerceptronModel } from "./LinearPerceptronModel";
+import { ActivationFunction } from "../Parameter/ActivationFunction";
+import { InstanceList } from "../InstanceList/InstanceList";
+import { MultiLayerPerceptronParameter } from "../Parameter/MultiLayerPerceptronParameter";
+export declare class MultiLayerPerceptronModel extends LinearPerceptronModel {
+    private V;
+    protected activationFunction: ActivationFunction;
+    /**
+     * The allocateWeights method allocates layers' weights of Matrix W and V.
+     *
+     * @param H Integer value for weights.
+     */
+    private allocateWeights;
+    /**
+     * A constructor that takes {@link InstanceList}s as trainsSet and validationSet. It  sets the {@link NeuralNetworkModel}
+     * nodes with given {@link InstanceList} then creates an input vector by using given trainSet and finds error.
+     * Via the validationSet it finds the classification performance and reassigns the allocated weight Matrix with the matrix
+     * that has the best accuracy and the Matrix V with the best Vector input.
+     *
+     * @param trainSet      InstanceList that is used to train.
+     * @param validationSet InstanceList that is used to validate.
+     * @param parameters    Multi layer perceptron parameters; seed, learningRate, etaDecrease, crossValidationRatio, epoch, hiddenNodes.
+     */
+    constructor(trainSet: InstanceList, validationSet: InstanceList, parameters: MultiLayerPerceptronParameter);
+    /**
+     * The calculateOutput method calculates the forward single hidden layer by using Matrices W and V.
+     */
+    protected calculateOutput(): void;
+}

package/dist/Model/MultiLayerPerceptronModel.js

@@ -0,0 +1,101 @@
+(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", "./LinearPerceptronModel", "nlptoolkit-math/dist/Matrix", "../Parameter/ActivationFunction", "../Performance/ClassificationPerformance", "nlptoolkit-math/dist/Vector"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.MultiLayerPerceptronModel = void 0;
+    const LinearPerceptronModel_1 = require("./LinearPerceptronModel");
+    const Matrix_1 = require("nlptoolkit-math/dist/Matrix");
+    const ActivationFunction_1 = require("../Parameter/ActivationFunction");
+    const ClassificationPerformance_1 = require("../Performance/ClassificationPerformance");
+    const Vector_1 = require("nlptoolkit-math/dist/Vector");
+    class MultiLayerPerceptronModel extends LinearPerceptronModel_1.LinearPerceptronModel {
+        /**
+         * A constructor that takes {@link InstanceList}s as trainsSet and validationSet. It  sets the {@link NeuralNetworkModel}
+         * nodes with given {@link InstanceList} then creates an input vector by using given trainSet and finds error.
+         * Via the validationSet it finds the classification performance and reassigns the allocated weight Matrix with the matrix
+         * that has the best accuracy and the Matrix V with the best Vector input.
+         *
+         * @param trainSet      InstanceList that is used to train.
+         * @param validationSet InstanceList that is used to validate.
+         * @param parameters    Multi layer perceptron parameters; seed, learningRate, etaDecrease, crossValidationRatio, epoch, hiddenNodes.
+         */
+        constructor(trainSet, validationSet, parameters) {
+            super(trainSet);
+            this.activationFunction = parameters.getActivationFunction();
+            this.allocateWeights(parameters.getHiddenNodes());
+            let bestW = this.W.clone();
+            let bestV = this.V.clone();
+            let bestClassificationPerformance = new ClassificationPerformance_1.ClassificationPerformance(0.0);
+            let epoch = parameters.getEpoch();
+            let learningRate = parameters.getLearningRate();
+            for (let i = 0; i < epoch; i++) {
+                trainSet.shuffle(parameters.getSeed());
+                for (let j = 0; j < trainSet.size(); j++) {
+                    this.createInputVector(trainSet.get(j));
+                    let hidden = this.calculateHidden(this.x, this.W, this.activationFunction);
+                    let hiddenBiased = hidden.biased();
+                    let rMinusY = this.calculateRMinusY(trainSet.get(j), hiddenBiased, this.V);
+                    let deltaV = new Matrix_1.Matrix(rMinusY, hiddenBiased);
+                    let tmph = this.V.multiplyWithVectorFromLeft(rMinusY);
+                    tmph.remove(0);
+                    let activationDerivative;
+                    switch (this.activationFunction) {
+                        case ActivationFunction_1.ActivationFunction.SIGMOID:
+                        default:
+                            let oneMinusHidden = this.calculateOneMinusHidden(hidden);
+                            activationDerivative = oneMinusHidden.elementProduct(hidden);
+                            break;
+                        case ActivationFunction_1.ActivationFunction.TANH:
+                            let one = new Vector_1.Vector(hidden.size(), 1.0);
+                            hidden.tanh();
+                            activationDerivative = one.difference(hidden.elementProduct(hidden));
+                            break;
+                        case ActivationFunction_1.ActivationFunction.RELU:
+                            hidden.reluDerivative();
+                            activationDerivative = hidden;
+                            break;
+                    }
+                    let tmpHidden = tmph.elementProduct(activationDerivative);
+                    let deltaW = new Matrix_1.Matrix(tmpHidden, this.x);
+                    deltaV.multiplyWithConstant(learningRate);
+                    this.V.add(deltaV);
+                    deltaW.multiplyWithConstant(learningRate);
+                    this.W.add(deltaW);
+                }
+                let currentClassificationPerformance = this.testClassifier(validationSet);
+                if (currentClassificationPerformance.getAccuracy() > bestClassificationPerformance.getAccuracy()) {
+                    bestClassificationPerformance = currentClassificationPerformance;
+                    bestW = this.W.clone();
+                    bestV = this.V.clone();
+                }
+                learningRate *= parameters.getEtaDecrease();
+            }
+            this.W = bestW;
+            this.V = bestV;
+        }
+        /**
+         * The allocateWeights method allocates layers' weights of Matrix W and V.
+         *
+         * @param H Integer value for weights.
+         */
+        allocateWeights(H) {
+            this.W = this.allocateLayerWeights(H, this.d + 1);
+            this.V = this.allocateLayerWeights(this.K, H + 1);
+        }
+        /**
+         * The calculateOutput method calculates the forward single hidden layer by using Matrices W and V.
+         */
+        calculateOutput() {
+            this.calculateForwardSingleHiddenLayer(this.W, this.V, this.activationFunction);
+        }
+    }
+    exports.MultiLayerPerceptronModel = MultiLayerPerceptronModel;
+});
+//# sourceMappingURL=MultiLayerPerceptronModel.js.map

package/dist/Model/MultiLayerPerceptronModel.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MultiLayerPerceptronModel.js","sourceRoot":"","sources":["../../source/Model/MultiLayerPerceptronModel.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,mEAA8D;IAC9D,wDAAmD;IACnD,wEAAmE;IAGnE,wFAAmF;IACnF,wDAAmD;IAEnD,MAAa,yBAA0B,SAAQ,6CAAqB;QAehE;;;;;;;;;WASG;QACH,YAAY,QAAsB,EAAE,aAA2B,EAAE,UAAyC;YACtG,KAAK,CAAC,QAAQ,CAAC,CAAC;YAChB,IAAI,CAAC,kBAAkB,GAAG,UAAU,CAAC,qBAAqB,EAAE,CAAC;YAC7D,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,cAAc,EAAE,CAAC,CAAC;YAClD,IAAI,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;YAC3B,IAAI,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;YAC3B,IAAI,6BAA6B,GAAG,IAAI,qDAAyB,CAAC,GAAG,CAAC,CAAC;YACvE,IAAI,KAAK,GAAG,UAAU,CAAC,QAAQ,EAAE,CAAC;YAClC,IAAI,YAAY,GAAG,UAAU,CAAC,eAAe,EAAE,CAAC;YAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;gBAC5B,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;gBACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE;oBACtC,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;oBACxC,IAAI,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,kBAAkB,CAAC,CAAC;oBAC3E,IAAI,YAAY,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;oBACnC,IAAI,OAAO,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;oBAC3E,IAAI,MAAM,GAAG,IAAI,eAAM,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;oBAC/C,IAAI,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,0BAA0B,CAAC,OAAO,CAAC,CAAC;oBACtD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBACf,IAAI,oBAAoB,CAAA;oBACxB,QAAQ,IAAI,CAAC,kBAAkB,EAAC;wBAC5B,KAAK,uCAAkB,CAAC,OAAO,CAAC;wBAChC;4BACI,IAAI,cAAc,GAAG,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,CAAC;4BAC1D,oBAAoB,GAAG,cAAc,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;4BAC7D,MAAM;wBACV,KAAK,uCAAkB,CAAC,IAAI;4BACxB,IAAI,GAAG,GAAG,IAAI,eAAM,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,CAAC;4BACzC,MAAM,CAAC,IAAI,EAAE,CAAC;4BACd,oBAAoB,GAAG,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC;4BACrE,MAAM;wBACV,KAAK,uCAAkB,CAAC,IAAI;4BACxB,MAAM,CAAC,cAAc,EAAE,CAAC;4BACxB,oBAAoB,GAAG,MAAM,CAAC;4BAC9B,MAAM;qBACb;oBACD,IAAI,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,oBAAoB,CAAC,CAAC;oBAC1D,IAAI,MAAM,GAAG,IAAI,eAAM,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;oBAC3C,MAAM,CAAC,oBAAoB,CAAC,YAAY,CAAC,CAAC;oBAC1C,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;oBACnB,MAAM,CAAC,oBAAoB,CAAC,YAAY,CAAC,CAAC;oBAC1C,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;iBACtB;gBACD,IAAI,gCAAgC,GAAG,IAAI,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;gBAC1E,IAAI,gCAAgC,CAAC,WAAW,EAAE,GAAG,6BAA6B,CAAC,WAAW,EAAE,EAAE;oBAC9F,6BAA6B,GAAG,gCAAgC,CAAC;oBACjE,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;oBACvB,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;iBAC1B;gBACD,YAAY,IAAI,UAAU,CAAC,cAAc,EAAE,CAAC;aAC/C;YACD,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;YACf,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;QACnB,CAAC;QAzED;;;;WAIG;QACK,eAAe,CAAC,CAAS;YAC7B,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAClD,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,CAAC;QAmED;;WAEG;QACO,eAAe;YACrB,IAAI,CAAC,iCAAiC,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,kBAAkB,CAAC,CAAC;QACpF,CAAC;KACJ;IAtFD,8DAsFC"}

package/dist/Model/NaiveBayesModel.d.ts

@@ -0,0 +1,47 @@
+import { GaussianModel } from "./GaussianModel";
+import { Instance } from "../Instance/Instance";
+import { Vector } from "nlptoolkit-math/dist/Vector";
+import { DiscreteDistribution } from "nlptoolkit-math/dist/DiscreteDistribution";
+export declare class NaiveBayesModel extends GaussianModel {
+    private classMeans;
+    private classDeviations;
+    private readonly classAttributeDistributions;
+    /**
+     * A constructor that sets the priorDistribution, classMeans and classDeviations.
+     *
+     * @param priorDistribution {@link DiscreteDistribution} input.
+     * @param classMeans        A {@link Map} of String and {@link Vector}.
+     * @param classDeviations   A {@link Map} of String and {@link Vector}.
+     */
+    constructor(priorDistribution: DiscreteDistribution, classMeans: any, classDeviations?: Map<string, Vector>);
+    /**
+     * The calculateMetric method takes an {@link Instance} and a String as inputs, and it returns the log likelihood of
+     * these inputs.
+     *
+     * @param instance {@link Instance} input.
+     * @param Ci       String input.
+     * @return The log likelihood of inputs.
+     */
+    calculateMetric(instance: Instance, Ci: string): number;
+    /**
+     * The logLikelihoodContinuous method takes an {@link Instance} and a class label as inputs. First it gets the logarithm
+     * of given class label's probability via prior distribution as logLikelihood. Then it loops times of given instance attribute size, and accumulates the
+     * logLikelihood by calculating -0.5 * ((xi - mi) / si )** 2).
+     *
+     * @param classLabel String input class label.
+     * @param instance   {@link Instance} input.
+     * @return The log likelihood of given class label and {@link Instance}.
+     */
+    private logLikelihoodContinuous;
+    /**
+     * The logLikelihoodDiscrete method takes an {@link Instance} and a class label as inputs. First it gets the logarithm
+     * of given class label's probability via prior distribution as logLikelihood and gets the class attribute distribution of given class label.
+     * Then it loops times of given instance attribute size, and accumulates the logLikelihood by calculating the logarithm of
+     * corresponding attribute distribution's smoothed probability by using laplace smoothing on xi.
+     *
+     * @param classLabel String input class label.
+     * @param instance   {@link Instance} input.
+     * @return The log likelihood of given class label and {@link Instance}.
+     */
+    private logLikelihoodDiscrete;
+}

package/dist/Model/NaiveBayesModel.js

@@ -0,0 +1,95 @@
+(function (factory) {
+    if (typeof module === "object" && typeof module.exports === "object") {
+        var v = factory(require, exports);
+        if (v !== undefined) module.exports = v;
+    }
+    else if (typeof define === "function" && define.amd) {
+        define(["require", "exports", "./GaussianModel"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.NaiveBayesModel = void 0;
+    const GaussianModel_1 = require("./GaussianModel");
+    class NaiveBayesModel extends GaussianModel_1.GaussianModel {
+        /**
+         * A constructor that sets the priorDistribution, classMeans and classDeviations.
+         *
+         * @param priorDistribution {@link DiscreteDistribution} input.
+         * @param classMeans        A {@link Map} of String and {@link Vector}.
+         * @param classDeviations   A {@link Map} of String and {@link Vector}.
+         */
+        constructor(priorDistribution, classMeans, classDeviations) {
+            super();
+            this.classMeans = undefined;
+            this.classDeviations = undefined;
+            this.classAttributeDistributions = undefined;
+            this.priorDistribution = priorDistribution;
+            if (classDeviations != undefined) {
+                this.classMeans = classMeans;
+                this.classDeviations = classDeviations;
+            }
+            else {
+                this.classAttributeDistributions = classMeans;
+            }
+        }
+        /**
+         * The calculateMetric method takes an {@link Instance} and a String as inputs, and it returns the log likelihood of
+         * these inputs.
+         *
+         * @param instance {@link Instance} input.
+         * @param Ci       String input.
+         * @return The log likelihood of inputs.
+         */
+        calculateMetric(instance, Ci) {
+            if (this.classAttributeDistributions == undefined) {
+                return this.logLikelihoodContinuous(Ci, instance);
+            }
+            else {
+                return this.logLikelihoodDiscrete(Ci, instance);
+            }
+        }
+        /**
+         * The logLikelihoodContinuous method takes an {@link Instance} and a class label as inputs. First it gets the logarithm
+         * of given class label's probability via prior distribution as logLikelihood. Then it loops times of given instance attribute size, and accumulates the
+         * logLikelihood by calculating -0.5 * ((xi - mi) / si )** 2).
+         *
+         * @param classLabel String input class label.
+         * @param instance   {@link Instance} input.
+         * @return The log likelihood of given class label and {@link Instance}.
+         */
+        logLikelihoodContinuous(classLabel, instance) {
+            let logLikelihood = Math.log(this.priorDistribution.getProbability(classLabel));
+            for (let i = 0; i < instance.attributeSize(); i++) {
+                let xi = instance.getAttribute(i).getValue();
+                let mi = this.classMeans.get(classLabel).getValue(i);
+                let si = this.classDeviations.get(classLabel).getValue(i);
+                if (si != 0) {
+                    logLikelihood += -0.5 * Math.pow((xi - mi) / si, 2);
+                }
+            }
+            return logLikelihood;
+        }
+        /**
+         * The logLikelihoodDiscrete method takes an {@link Instance} and a class label as inputs. First it gets the logarithm
+         * of given class label's probability via prior distribution as logLikelihood and gets the class attribute distribution of given class label.
+         * Then it loops times of given instance attribute size, and accumulates the logLikelihood by calculating the logarithm of
+         * corresponding attribute distribution's smoothed probability by using laplace smoothing on xi.
+         *
+         * @param classLabel String input class label.
+         * @param instance   {@link Instance} input.
+         * @return The log likelihood of given class label and {@link Instance}.
+         */
+        logLikelihoodDiscrete(classLabel, instance) {
+            let logLikelihood = Math.log(this.priorDistribution.getProbability(classLabel));
+            let attributeDistributions = this.classAttributeDistributions.get(classLabel);
+            for (let i = 0; i < instance.attributeSize(); i++) {
+                let xi = instance.getAttribute(i).getValue();
+                logLikelihood += Math.log(attributeDistributions[i].getProbabilityLaplaceSmoothing(xi));
+            }
+            return logLikelihood;
+        }
+    }
+    exports.NaiveBayesModel = NaiveBayesModel;
+});
+//# sourceMappingURL=NaiveBayesModel.js.map

package/dist/Model/NaiveBayesModel.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"NaiveBayesModel.js","sourceRoot":"","sources":["../../source/Model/NaiveBayesModel.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,mDAA8C;IAO9C,MAAa,eAAgB,SAAQ,6BAAa;QAM9C;;;;;;WAMG;QACH,YAAY,iBAAuC,EAAE,UAAe,EAAE,eAAqC;YACvG,KAAK,EAAE,CAAC;YAZJ,eAAU,GAAwB,SAAS,CAAA;YAC3C,oBAAe,GAAwB,SAAS,CAAA;YACvC,gCAA2B,GAA6C,SAAS,CAAA;YAW9F,IAAI,CAAC,iBAAiB,GAAG,iBAAiB,CAAA;YAC1C,IAAI,eAAe,IAAI,SAAS,EAAC;gBAC7B,IAAI,CAAC,UAAU,GAAG,UAAU,CAAA;gBAC5B,IAAI,CAAC,eAAe,GAAG,eAAe,CAAA;aACzC;iBAAM;gBACH,IAAI,CAAC,2BAA2B,GAAG,UAAU,CAAA;aAChD;QACL,CAAC;QAED;;;;;;;WAOG;QACH,eAAe,CAAC,QAAkB,EAAE,EAAU;YAC1C,IAAI,IAAI,CAAC,2BAA2B,IAAI,SAAS,EAAE;gBAC/C,OAAO,IAAI,CAAC,uBAAuB,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;aACrD;iBAAM;gBACH,OAAO,IAAI,CAAC,qBAAqB,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;aACnD;QACL,CAAC;QAED;;;;;;;;WAQG;QACK,uBAAuB,CAAC,UAAkB,EAAE,QAAkB;YAClE,IAAI,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,iBAAiB,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC;YAChF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE,EAAE;gBAC/C,IAAI,EAAE,GAA0B,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAE,CAAC,QAAQ,EAAE,CAAC;gBACrE,IAAI,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACrD,IAAI,EAAE,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC1D,IAAI,EAAE,IAAI,CAAC,EAAC;oBACR,aAAa,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;iBACvD;aACJ;YACD,OAAO,aAAa,CAAC;QACzB,CAAC;QAED;;;;;;;;;WASG;QACK,qBAAqB,CAAC,UAAkB,EAAE,QAAkB;YAChE,IAAI,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,iBAAiB,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC;YAChF,IAAI,sBAAsB,GAAG,IAAI,CAAC,2BAA2B,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAC9E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,aAAa,EAAE,EAAE,CAAC,EAAE,EAAE;gBAC/C,IAAI,EAAE,GAAwB,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAE,CAAC,QAAQ,EAAE,CAAC;gBACnE,aAAa,IAAI,IAAI,CAAC,GAAG,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,8BAA8B,CAAC,EAAE,CAAC,CAAC,CAAC;aAC3F;YACD,OAAO,aAAa,CAAC;QACzB,CAAC;KACJ;IAjFD,0CAiFC"}