Author
Abstract
We introduce a supervised learning method that classifies each test point by selecting the class for which its inclusion causes minimum displacement of the class’s existing n-th central moment. After each such inclusion, the n-th central moment of the corresponding class is updated by some incremental calculations in constant time, i.e., each class evolves gradually and changes its definition incrementally after the inclusion of every new data point. We then use k-fold and stratified k-fold cross validation techniques to compare the performance of our proposed model with various state of the art supervised learning algorithms including Neural Network (NN), Support Vector Machine (SVM), Random Forest (RF), K-Nearest Neighbor (KNN) and Logistic Regression (LR) using Pima Indian Diabetes (PID) dataset and Wisconsin breast cancer dataset, which are popular datasets in machine learning research. Our analyses suggest the performances of different MDEM algorithms as proposed here involving different order of moments vary within the range of [83.19% − 95.82%] of the best algorithm under consideration in k-fold and stratified k-fold cross validation techniques for PID dataset. Moreover, for Wisconsin breast cancer dataset, different variants of MDEM algorithms have achieved accuracy scores in the range of [88.85% − 96.41%] of the best algorithm. Finally, we compare the results produced by different algorithms by constructing the corresponding confusion matrices.
Suggested Citation
Ahmed Mehedi Nizam, 2025.
"Minimum Displacement in Existing Moment (MDEM)- A new supervised learning algorithm by incrementally constructing the moments of the underlying classes,"
PLOS ONE, Public Library of Science, vol. 20(12), pages 1-35, December.
Handle:
RePEc:plo:pone00:0336933
DOI: 10.1371/journal.pone.0336933
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0336933. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.