Minimum Mean Distance and k-Nearest Neighbor Classifiers for Signal Processing Kun Yi Li, Young Scholar Student, Quincy High School Eric Lehman, Young Scholar Student, Belmont High School Graduate research mentors: Matt Higger, Fernando Quiviria, PhD Candidate, Northeastern University Professor Deniz Erdogmus, Associate Professor, Northestern University College of Computer Engineering, Cognitive Systems Laboratory
17
Embed
Minimum Mean Distance and k-Nearest Neighbor Classifiers for Signal Processing Kun Yi Li, Young Scholar Student, Quincy High School Eric Lehman, Young.
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Minimum Mean Distance and k-Nearest Neighbor Classifiers for Signal Processing Kun Yi Li, Young Scholar Student, Quincy High School
Eric Lehman, Young Scholar Student, Belmont High School
Graduate research mentors: Matt Higger, Fernando Quiviria, PhD Candidate, Northeastern University
Professor Deniz Erdogmus, Associate Professor, Northestern University College of Computer Engineering, Cognitive Systems Laboratory
• Help a targeted group of individuals with severe speech and motor impairments who are unable to perform simple tasks or communicate with everyday individuals
• SSVEP: Stands for “Steady State Visually Evoked Potential”. This type of brain signal is a response to looking at repeated intensities of light from 0 to 60 Hz.• EEG: Stands for “electroencephalography”. EEG
data is the measurement of the brain’s electrical activity voltages on the surface of the scalp over a certain period of time. • Iris Dataset: A dataset that contains 3 different
types for flowers, 50 samples each, and 4 different features (sepal length in cm, sepal width in cm, petal length in cm, petal width in cm). • Classifier: An algorithm that divides data into
different group based on their similarities.
Minimum Mean DistanceClassifier
•An algorithm that classifies multiple types of data.
•When given a test point, the program:
1. calculates the distance from the new data point to the average of training data points.
2. selects the training data point with the shortest distance
3. identifies the new data point in the same group as the closest training point.
6
Minimum Mean Distance Classifier
7
Classification of Iris Flower Dataset Using Minimum Mean Distance Classifier
Ground Truth Class
Estimated Class
I. setosa I. versicolor
I. virginica
I. setosa 1 0 0
I. versicolor 0 0.92 0.14
I. virginica 0 0.08 0.86
iPad
8
Minimum Mean Distance Classifier
Classification of EEG Data Using Minimum Mean Distance Classifier
Ground Truth Class
Estimated Class
20 Hz 15 Hz 12 Hz
20 Hz 1 0 0
15 Hz 0 1 0
12 Hz 0 0 1
iPad
k-Nearest Neighbor Classifier
•An algorithm that classifies and divides multiple types of data.
•When given a new test data point, the KNN classifier:
• 1. Calculates the distance from the test data to all training data points
• 2. Selects the k number of training data points that are the closest to the test data point
• 3. Identifies the test data point as the same as the most common class among the k nearest training data points
9
k-Nearest Neighbor Classifier
10
Classification of Iris Flower Dataset Using Minimum Mean Distance Classifier
Ground Truth Class
Estimated Class
I. setosa I. versicolor
I. virginica
I. setosa 1 0 0
I. versicolor 0 0.94 0.04
I. virginica 0 0.06 0.96
K-Nearest Neighbor Classifier
11
Classification of EEG Data Using K-Nearest Neighbor Classifier
Ground Truth Class
Estimated Class
20 Hz 15 Hz 12 Hz
20 Hz 1 0 0
15 Hz 0 1 0
12 Hz 0 0 1
K Fold Cross Validation
•Separates the training set from the test set by segmenting the data into k number of sections
•The classifier will test on one section and train the remaining sections