//:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: /** @author Khalifeh Al-Jadda, John A. Miller * @version 1.2 * @date Mon Aug 15 13:13:15 EDT 2016 * @see LICENSE (MIT style license file). */ package scalation.analytics.classifier import scalation.linalgebra.{MatriI, VectoI, VectorD, VectorI} import scalation.linalgebra.gen._ import scalation.relalgebra.Relation import scalation.util.{time, banner} //::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: /** The `PGMHD3cp` class implements a three level Bayes Classifier for discrete input data. * The classifier is trained using a data matrix 'x' and a classification vector 'y'. * Each data vector in the matrix is classified into one of 'k' classes numbered * 0, ..., k-1. Prior probabilities are calculated based on the frequency/population * of each class in the training-set. Relative posterior probabilities are computed * by multiplying these by values computed using conditional probabilities. The * classifier is naive, because it assumes feature independence and therefore * simply multiplies the conditional probabilities. * ----------------------------------------------------------------------------- * [ x ] -> [ x z ] where x features are level 2 and z features are level 3. * ----------------------------------------------------------------------------- * @param x the integer-valued data vectors stored as rows of a matrix * @param nx the number of x features/columns * @param y the class vector, where y(l) = class for row l of the matrix x, x(l) * @param fn the names for all features/variables * @param k the number of classes * @param cn the names for all classes * @param vc the value count (number of distinct values) for each feature * @param me use m-estimates (me == 0 => regular MLE estimates) */ class PGMHD3cp (x: MatriI, nx: Int, y: VectoI, fn: Array [String], k: Int, cn: Array [String], private var vc: VectoI = null, me: Int = 0) extends BayesClassifier (x, y, fn, k, cn) { private val DEBUG = true // debug flag private val nz = x.dim2 - nx // number of z features/columns private val cor = calcCorrelation // feature correlation matrix // private val f_X = new HMatrix2 [Int] (nx) // frequency counts for X-feature jx private val f_CX = new HMatrix3 [Int] (k, nx) // frequency counts for C-class i & X-feature jx // private val f_XZ = new HMatrix4 [Int] (nx, nz) // frequency counts for X-feature jx & Z-feature jz private val f_CXZ = new HMatrix5 [Int] (k, nx, nz) // frequency counts for C-class i & X-feature jx & Z-feature jz if (vc == null) { shiftToZero; vc = vc_fromData // set value counts from the data } // if val vc_x = vc.slice (0, nx)().toArray // distinct value counts for X-features val vc_z = vc.slice (nx, n)().toArray // distinct value counts for Z-features // f_X.alloc (vc_x) f_CX.alloc (vc_x) // f_XZ.alloc (vc_x, vc_z) f_CXZ.alloc2 (vc_x, vc_z) if (DEBUG) { println ("distinct value count vc_x = " + vc_x) println ("distinct value count vc_z = " + vc_z) println ("correlation matrix = " + cor) } // if def parent (j: Int): Int = j - nx // FIX: find best X for parent of Z //::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: /** Build a model. * @param testStart starting index of test region (inclusive) used in cross-validation * @param testEnd ending index of test region (exclusive) used in cross-validation */ def buildModel (testStart: Int, testEnd: Int): (Array [Boolean], DAG) = { (Array.fill (n)(true), new DAG (Array.ofDim [Int] (n, 0))) } // buildModel //::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: /** Count the frequencies for 'y' having class 'i' and value 'x' for cases 0, 1, ... * Only the test region from 'testStart' to 'testEnd' is skipped, the rest is * training data. * @param testStart starting index of test region (inclusive) used in cross-validation * @param testEnd ending index of test region (exclusive) used in cross-validation */ private def frequencies (testStart: Int, testEnd: Int) { banner ("frequencies (testStart, testEnd)") for (l <- 0 until m if l < testStart || l >= testEnd) { // l = l-th row of data matrix x val i = y(l) // get the class for l-th tow for (j <- 0 until n) { if (j < nx) { val x_j = x(l, j) // get value for j-th X-feature // f_X(j, x_j) += 1 // f_X f_CX(i, j, x_j) += 1 // f_CX } else { val z_j = x(l, j) // get value for j-th Z-feature val jp = parent (j) // X_jp is parent of Z_j val x_jp = x(l, jp) // get value for jp-th X-feature // f_XZ(jp, j-nx, x_jp, z_j) += 1 // f_Z_X f_CXZ(i, jp, j-nx, x_jp, z_j) += 1 // f_CZ_X } // if } // for } // for if (DEBUG) { // println ("f_X = " + f_X) // #(X_j = x) println ("f_CX = " + f_CX) // #(C = i & X_j = x) // println ("f_XZ = " + f_XZ) // #(X_jp = x & Z_j = z) println ("f_CXZ = " + f_CXZ) // #(C = i & X_jp = x & Z_j = z) } // if } // frequencies //::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: /** Train the classifier by computing the probabilities for C, and the * conditional probabilities for X_j. * @param testStart starting index of test region (inclusive) used in cross-validation. * @param testEnd ending index of test region (exclusive) used in cross-validation. */ def train (testStart: Int, testEnd: Int) { frequencies (testStart, testEnd) // compute frequencies skipping test region banner ("train (testStart, testEnd)") } // train //::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: /** Count the frequencies for 'y' having class 'i' and value 'x' for cases 0, 1, ... * Only the test region from 'testStart' to 'testEnd' is skipped, the rest is * training data. * @param itrain indices of the instances considered train data */ private def frequencies (itrain: Array [Int]) { banner ("frequencies (itrain)") for (l <- itrain) { // l = lth row of data matrix x // l = l-th row of data matrix x val i = y(l) // get the class for l-th tow for (j <- 0 until n) { if (j < nx) { val x_j = x(l, j) // get value for j-th X-feature // f_X(j, x_j) += 1 // f_X f_CX(i, j, x_j) += 1 // f_CX } else { val z_j = x(l, j) // get value for j-th Z-feature val jp = parent (j) // X_jp is parent of Z_j val x_jp = x(l, jp) // get value for jp-th X-feature // f_XZ(jp, j-nx, x_jp, z_j) += 1 // f_Z_X f_CXZ(i, jp, j-nx, x_jp, z_j) += 1 // f_CZ_X } // if } // for } // for if (DEBUG) { // println ("f_X = " + f_X) // #(X_j = x) println ("f_CX = " + f_CX) // #(C = i & X_j = x) // println ("f_XZ = " + f_XZ) // #(X_jp = x & Z_j = z) println ("f_CXZ = " + f_CXZ) // #(C = i & X_jp = x & Z_j = z) } // if } // frequencies //::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: /** Train the classifier by computing the probabilities for C, and the * conditional probabilities for X_j. * @param itrain indices of the instances considered train data */ override def train (itrain: Array [Int]) { frequencies (itrain) // compute frequencies skipping test region banner ("train (itrain)") } // train //::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: /** Given a discrete data vector 'u', classify it returning the class number * (0, ..., k-1) with the highest relative posterior probability. * @param u the data vector to classify */ def classify (u: VectoI): Tuple2 [Int, String] = { banner ("classify (u)") val prob = new VectorD (k) for (i <- 0 until k) { prob(i) = 1.0 // proportional to probabilty for (j <- 0 until n) { if (j < nx) prob(i) *= f_CX(i, j, u(j)) else { val jp = parent(j); prob(i) *= f_CXZ(i, jp, j-nx, u(jp), u(j)) } } // for if (DEBUG) println ("prob = " + prob) } // for if (DEBUG) println ("prob = " + prob) val best = prob.argmax () // class with the highest relative probability (best, cn(best)) // return the best class and its name } // classify //::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: /** Reset or re-initialize all the frequency hypermatrices to 0. */ def reset () { // f_X.set (0) f_CX.set (0) // f_XZ.set (0) f_CXZ.set (0) } // reset } // PGMHD3cp class //:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: /** `PGMHD3cp` is the companion object for the `PGMHD3cp` class. */ object PGMHD3cp { //::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: /** Create a 'PGMHD3cp` object, passing 'x' and 'y' together in one matrix. * @param xy the data vectors along with their classifications stored as rows of a matrix * @param nx the number of x features/columns * @param fn the names of the features * @param k the number of classes * @param vc the value count (number of distinct values) for each feature * @param me use m-estimates (me == 0 => regular MLE estimates) */ def apply (xy: MatriI, nx: Int, fn: Array [String], k: Int, cn: Array [String], vc: VectoI = null, me: Int = 3) = { new PGMHD3cp (xy(0 until xy.dim1, 0 until xy.dim2 - 1), nx, xy.col(xy.dim2 - 1), fn, k, cn, vc, me) } // apply } // PGMHD3cp object import scalation.linalgebra.MatrixI //::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: /** The `PGMHD3cpTest` object is used to test the `PGMHD3cp` class. * Classify whether a car is more likely to be stolen (1) or not (1). * @see www.inf.u-szeged.hu/~ormandi/ai2/06-naiveBayes-example.pdf * > run-main scalation.analytics.classifier.PGMHD3cpTest */ object PGMHD3cpTest extends App { // x0: Color: Red (1), Yellow (0) // x1: Type: SUV (1), Sports (0) // x2: Origin: Domestic (1), Imported (0) // x3: Mpg: High (1), Low (0) // features: x0 x1 x2 x3 val x = new MatrixI ((10, 4), 1, 0, 1, 1, // data matrix 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0) val y = VectorI (1, 0, 1, 0, 1, 0, 1, 0, 0, 1) // classification vector: 0(No), 1(Yes)) val fn = Array ("Color", "Type", "Origin", "Mpg") // feature/variable names val cn = Array ("No", "Yes") // class names println ("x = " + x) println ("y = " + y) println ("---------------------------------------------------------------") val nb = new PGMHD3cp (x, 2, y, fn, 2, cn) // create the classifier // train the classifier --------------------------------------------------- nb.train () // test sample ------------------------------------------------------------ val z1 = VectorI (1, 0, 1, 1) // existing data vector to classify val z2 = VectorI (1, 1, 1, 0) // new data vector to classify println ("classify (" + z1 + ") = " + nb.classify (z1) + "\n") println ("classify (" + z2 + ") = " + nb.classify (z2) + "\n") // nb.crossValidateRand () // cross validate the classifier } // PGMHD3cpTest object //::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: /** The `PGMHD3cpTest2` object is used to test the 'PGMHD3cp' class. * Given whether a person is Fast and/or Strong, classify them as making C = 1 * or not making C = 0 the football team. * > run-main scalation.analytics.classifier.PGMHD3cpTest2 */ object PGMHD3cpTest2 extends App { // training-set ----------------------------------------------------------- // x0: Fast // x1: Strong // y: Classification (No/0, Yes/1) // features: x0 x1 y val xy = new MatrixI ((10, 3), 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0) val fn = Array ("Fast", "Strong") // feature names val cn = Array ("No", "Yes") // class names println ("xy = " + xy) println ("---------------------------------------------------------------") val nb = PGMHD3cp (xy, 1, fn, 2, cn, null, 0) // create the classifier // train the classifier --------------------------------------------------- nb.train() // test sample ------------------------------------------------------------ val z = VectorI (1, 0) // new data vector to classify println ("classify (" + z + ") = " + nb.classify (z) + "\n") nb.crossValidate () // cross validate the classifier } // PGMHD3cpTest2 object //::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: /** The `PGMHD3cpTest3` object is used to test the 'PGMHD3cp' class. * > run-main scalation.analytics.classifier.PGMHD3cpTest3 */ object PGMHD3cpTest3 extends App { val filename = BASE_DIR + "breast-cancer.arff" var data = Relation (filename, -1, null) val xy = data.toMatriI2 (null) val fn = data.colName.toArray val cn = Array ("0", "1") // class names val nb = PGMHD3cp (xy, 2, fn, 2, cn, null, 0) // create the classifier nb.train () nb.crossValidate () } // PGMHD3cpTest3 object