IDEAS home Printed from https://ideas.repec.org/a/taf/gcmbxx/v28y2025i1p51-60.html
   My bibliography  Save this article

Research on MI EEG signal classification algorithm using multi-model fusion strategy coupling

Author

Listed:
  • Wu Quanyu
  • Ding Sheng
  • Tao Weige
  • Pan Lingjiao
  • Liu Xiaojie

Abstract

To enhance the accuracy of motor imagery(MI)EEG signal recognition, two methods, namely power spectral density and wavelet packet decomposition combined with a common spatial pattern, were employed to explore the feature information in depth in MI EEG signals. The extracted MI EEG signal features were subjected to series feature fusion, and the F-test method was used to select features with higher information content. Here regarding the accuracy of MI EEG signal classification, we further proposed the Platt Scaling probability calibration method was used to calibrate the results obtained from six basic classifiers, namely random forest (RF), support vector machines (SVM), Logistic Regression (LR), Gaussian naïve bayes (GNB), eXtreme Gradient Boosting (XGBoost), and Light Gradient Boosting Machine (LightGBM). From these 12 classifiers, three to four with higher accuracy were selected for model fusion. The proposed method was validated on Datasets 2a of the 4th International BCI Competition, achieving an average accuracy of MI EEG data of nine subjects reached 91.46%, which indicates that model fusion was an effective method to improve classification accuracy, and provides some reference value for the research on MI brain-machine interface.

Suggested Citation

  • Wu Quanyu & Ding Sheng & Tao Weige & Pan Lingjiao & Liu Xiaojie, 2025. "Research on MI EEG signal classification algorithm using multi-model fusion strategy coupling," Computer Methods in Biomechanics and Biomedical Engineering, Taylor & Francis Journals, vol. 28(1), pages 51-60, January.
  • Handle: RePEc:taf:gcmbxx:v:28:y:2025:i:1:p:51-60
    DOI: 10.1080/10255842.2023.2284091
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/10255842.2023.2284091
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/10255842.2023.2284091?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    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:taf:gcmbxx:v:28:y:2025:i:1:p:51-60. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/gcmb .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.