An implementation of a discriminant function over a normal distribution to help classify datasets.

Last update: Nov 09, 2021

Related tags

Deep Learning Discriminant-Function

Overview

CS4044D Machine Learning Assignment 1

By Dev Sony, B180297CS

The question, report and source code can be found here.

Github Repo

Solution 1

Based on the formula given:

The function has been defined:

def discriminant_function(x, mean, cov, d, P):
    if d == 1:
        output = -0.5*(x - mean) * (1/cov)
        output = output * (x - mean)
        output += -0.5*d*log(2*pi) - 0.5*log(cov) 

    else: 
        output = np.matmul(-0.5*(x - mean), np.linalg.inv(cov))
        output = np.matmul(output, (x - mean).T)
        output += -0.5*d*log(2*pi) - 0.5*log(np.linalg.det(cov)) 

    # Adding Prior Probability
    output += log(P)

    return output

It also accomdatees the case if only one feature is used, thus using only scalar quantities.

The variables can be configured based on the scenario. Here, it's assumed that prior probabilities are equally distributed and all features are taken:

n = len(data)
P = [1/n for i in range(n)]
d = len(data[0][0])

The input is the sample dataset, each set separated by the class they belong to as given below:

data = [
    # W1
    np.array([
        [-5.01, -8.12, -3.68],
        [-5.43, -3.48, -3.54],
        [1.08, -5.52, 1.66],
        [0.86, -3.78, -4.11],
        [-2.67, 0.63, 7.39],
        [4.94, 3.29, 2.08],
        [-2.51, 2.09, -2.59],
        [-2.25, -2.13, -6.94],
        [5.56, 2.86, -2.26],
        [1.03, -3.33, 4.33]
    ]),

    # W2
    np.array([
        [-0.91, -0.18, -0.05],
        [1.30, -2.06, -3.53],
        [-7.75, -4.54, -0.95],
        [-5.47, 0.50, 3.92],
        [6.14, 5.72, -4.85],
        [3.60, 1.26, 4.36],
        [5.37, -4.63, -3.65],
        [7.18, 1.46, -6.66],
        [-7.39, 1.17, 6.30],
        [-7.50, -6.32, -0.31]
    ]),

    # W3
    np.array([
        [5.35, 2.26, 8.13],
        [5.12, 3.22, -2.66],
        [-1.34, -5.31, -9.87],
        [4.48, 3.42, 5.19],
        [7.11, 2.39, 9.21],
        [7.17, 4.33, -0.98],
        [5.75, 3.97, 6.65],
        [0.77, 0.27, 2.41],
        [0.90, -0.43, -8.71],
        [3.52, -0.36, 6.43]
    ]) 
]

In order to classify the sample data, we first run the function through our sample dataset, classwise. On each sample, we find the class which gives the maximum output from its discriminant function.

A count and total count is maintained in order to find the success and failiure rates.

for j in range(n):
    print("\nData classes should be classified as:", j+1)
    total_count, count = 0, 0

    # Taking x as dataset belonging to class j + 1
    for x in data[j]:
        g_values = [0 for g in range(n)]        

        # Itering through each class' discriminant function
        for i in range(n):
            g_values[i] = discriminant_function(x, means[i], cov[i], d, P[i])

        # Now to output the maximum result 
        result = g_values.index(max(g_values)) + 1
        print(x, "\twas classified as", result)
        total_count, count = total_count + 1, (count + 1 if j == result - 1 else count)
        
    print("Success Rate:", (count/total_count)*100,"%")
    print("Fail Rate:", 100 - ((count/total_count))*100,"%")

Assuming that all classes have an equal prior probability (as per the configuration in the example picture), the following output is produced:

Solution 2

Part (a) and (b)

In order to match the question, the configuration variables are altered.

data-1 for n indicates that only 2 classes will be considered (the final class would not be considered as its Prior probability is 0, implying that it wouldn't appear.)
We iterate through n + 1 in the outer loop as datasets of all 3 classes are being classified. (Althought class 3 is fully misclassified.)
The d value is changed to 1, indicating that only 1 feature will be used. (which is x₁ )

n = len(data) - 1
P = [0.5, 0.5, 0]
d = 1

The configuration parameters being passed are also changed.

x[0] indicates that only x₁ will be used.
means[i][0] indiciates that we need the mean only for x₁).
cov[i][0][0] indicates the variance of feature x₁).

for j in range(n + 1):
    print("\nData classes should be classified as:", j+1)
    total_count, count = 0, 0

    # Taking x as dataset belonging to class j + 1
    for x in data[j]:
        g_values = [0 for g in range(n)]        # Array for all discrminant function outputs.

        # Itering through each class' discriminant function
        for i in range(n):
            g_values[i] = discriminant_function(x[0], means[i][0], cov[i][0][0], d, P[i])

        # Now to output the maximum result 
        result = g_values.index(max(g_values)) + 1
        print(x, "\twas classified as", result)
        total_count, count = total_count + 1, (count + 1 if j == result - 1 else count)
        
    print("Success Rate:", (count/total_count)*100,"%")
    print("Fail Rate:", 100 - ((count/total_count))*100,"%")

This results in the following output:

Part (c)

Here, the configuration parameters are changed slightly.

d is changed to 2, as now we are considering the first and second features.
The matrix paramateres passed now include necessary values for the same reason.

n = len(data) - 1
P = [0.5, 0.5, 0]
d = 2

This results in the following output:

Part (d)

Here again, the configurations are changed in a similiar fashion as in (c).

d values is changed to 3 as all three features are now considered.
The matrix paramaeteres are now passed without slicing as all values are important.

n = len(data) - 1
P = [0.5, 0.5, 0]
d = 3

The resuls in the following output:

Part (e)

On comparing the three outputs, using one or three features give more accurate results than using the first and second features.

The reason for this could be because the covariance with the third feature is much higher than the ones associated with the second feature.

Part (f)

In order to consider the possible configurations mentioned, the code takes an input vector and goes through all of them.

General Configuration values

n = len(data) - 1
P = [0.5, 0.5, 0]
g_values = [0 for i in range(n)]

Get input

x = list(map(float, input("Enter the input vector: ").strip().split()))

Case A

d = 1
print("Case A: Using only feature vector x1")
for i in range(n):
    g_values[i] = discriminant_function(x[0], means[i][0], cov[i][0][0], d, P[i])

result = g_values.index(max(g_values)) + 1
print(x, "\twas classified as", result)

Case B

d = 2
print("\nCase B: Using only feature vectors x1 and x2")
for i in range(n):
    g_values[i] = discriminant_function(x[0:2], means[i][0:2], cov[i][0:2, 0:2], d, P[i])

result = g_values.index(max(g_values)) + 1
print(x, "\twas classified as", result)

Case C

d = 3
print("\nCase C: Using all feature vectors")
for i in range(n):
    g_values[i] = discriminant_function(x, means[i], cov[i], d, P[i])

result = g_values.index(max(g_values)) + 1
print(x, "\twas classified as", result)

Here are the outputs for the 4 input vectors mentioned in the question:

An implementation of a discriminant function over a normal distribution to help classify datasets.

Related tags

Overview

CS4044D Machine Learning Assignment 1

Solution 1

Solution 2

Part (a) and (b)

Part (c)

Part (d)

Part (e)

Part (f)

General Configuration values

Get input

Case A

Case B

Case C

Owner

Dev Sony

Repository for publicly available deep learning models developed in Rosetta community

Memory efficient transducer loss computation

Simple and Robust Loss Design for Multi-Label Learning with Missing Labels

A Closer Look at Invalid Action Masking in Policy Gradient Algorithms

Python package for multiple object tracking research with focus on laboratory animals tracking.

Reliable probability face embeddings

A annotation of yolov5-5.0

TLoL (Python Module) - League of Legends Deep Learning AI (Research and Development)

Surrogate-Assisted Genetic Algorithm for Wrapper Feature Selection

Progressive Coordinate Transforms for Monocular 3D Object Detection

Machine Learning From Scratch. Bare bones NumPy implementations of machine learning models and algorithms with a focus on accessibility. Aims to cover everything from linear regression to deep learning.

Our CIKM21 Paper "Incorporating Query Reformulating Behavior into Web Search Evaluation"

pytorch implementation of GPV-Pose

Implementing DeepMind's Fast Reinforcement Learning paper

This code is an unofficial implementation of HiFiSinger.

The codes I made while I practiced various TensorFlow examples

Image transformations designed for Scene Text Recognition (STR) data augmentation. Published at ICCV 2021 Workshop on Interactive Labeling and Data Augmentation for Vision.

QICK: Quantum Instrumentation Control Kit

TransMIL: Transformer based Correlated Multiple Instance Learning for Whole Slide Image Classification

A Comprehensive Study on Learning-Based PE Malware Family Classification Methods