K-nearest neighbor for English letter classification by doing random partition.
% 1: Load letter.mat file which contains letter data and its label
% seperately.
% 2: Randomize the order of data for each iternation so that new sets of
% training and test data are formed.
%
% The training data is of having size of Nxd where N is the number of
% measurements and d is the number of variables of the training data.
%
% Similarly the size of the test data is Mxd where M is the number of
% measurements and d is the number of variables of the test data.
% 3: For each observation in test data, we compute the euclidean distance
% from each obeservation in training data.
% 4: We evalutate 'k' nearest neighbours among them and store it in an
% array.
% 5: We apply the label for which distance is minimum
% 5.1: In case of a tie, we randomly label the class.
% 6: Return the class label.
% 7: Compute confusion matrix.
Zitieren als
lavya Gavshinde (2024). K-nearest neighbor for English letter classification by doing random partition. (https://www.mathworks.com/matlabcentral/fileexchange/37829-k-nearest-neighbor-for-english-letter-classification-by-doing-random-partition), MATLAB Central File Exchange. Abgerufen .
Kompatibilität der MATLAB-Version
Plattform-Kompatibilität
Windows macOS LinuxKategorien
Tags
Quellenangaben
Inspiriert von: K Nearest Neighbors
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Live Editor erkunden
Erstellen Sie Skripte mit Code, Ausgabe und formatiertem Text in einem einzigen ausführbaren Dokument.
Lavya Gavshinde 201250831 Assignment 1/
Version | Veröffentlicht | Versionshinweise | |
---|---|---|---|
1.0.0.0 |