paper-with-me

Papers

Voxel selection framework based on meta-heuristic search and mutual information for brain decoding

2021-07-29 · Osama Hourani, Nasrollah Moghadam Charkari, Saeed Jalili

Visual stimulus decoding is an increasingly important challenge in neuroscience. The goal is to classify the activity patterns from the human brain; during the sighting of visual objects. One of the crucial problems in the brain decoder is the selecting informative voxels. We propose a meta-heuristic voxel selection framework for brain decoding. It is composed of four phases: preprocessing of fMRI data; filtering insignificant voxels; postprocessing; and meta-heuristics selection. The main contribution is benefiting a meta-heuristics search algorithm to guide a wrapper voxel selection. The main criterion to nominate a voxel is based on its mutual information with the provided stimulus label. The results show impressive accuracy rates which are 90.66 +/- 3.66 and 91.61 +/- 8.24 for DS105 and DS107, respectively. This outperforms the most of existing brain decoders in similar validation conditions. The experimental results are very encouraging which can be successfully useId in the brain-computer interface.

📄 PDF Abstract BibTeX arXiv:2109.02486

Code (0)

등록된 구현이 없습니다.

Tasks

Brain Computer InterfaceBrain DecodingDecoderHeuristic Search

Similar Papers 제목 키워드 기반

RAG/LLM Augmented Switching Driven Polymorphic Metaheuristic Framework

2025-05-20 · Faramarz Safi Esfahani, Ghassan Beydoun, Morteza Saberi, Brad McCusker 외

Metaheuristic algorithms are widely used for solving complex optimization problems, yet their effectiveness is often constrained by fixed structures and the need for extensive tuning. The Polymorphic Metaheuristic Framew…

Decision MakingRAG

A machine learning framework for neighbor generation in metaheuristic search

2022-12-22 · Defeng Liu, Vincent Perreault, Alain Hertz, Andrea Lodi

This paper presents a methodology for integrating machine learning techniques into metaheuristics for solving combinatorial optimization problems. Namely, we propose a general machine learning framework for neighbor gene…

Combinatorial OptimizationVariable Selection

An Exploratory Study on Simulated Annealing for Feature Selection in Learning-to-Rank

2023-10-20 · Mohd. Sayemul Haque, Md. Fahim, Muhammad Ibrahim

Learning-to-rank is an applied domain of supervised machine learning. As feature selection has been found to be effective for improving the accuracy of learning models in general, it is intriguing to investigate this pro…

feature selectionLearning-To-Rank

QBSO-FS: A Reinforcement Learning Based Bee Swarm Optimization Metaheuristic for Feature Selection

2019-05-16 · International Work-Conference on Artificial Neural Networks 2019 5 · Souhila Sadeg, Leila Hamdad, Amine Riad Remache, Mehdi Nedjmeddine Karech 외

Feature selection is often used before a data mining or a machine learning task in order to build more accurate models. It is considered as a hard optimization problem and metaheuristics give very satisfactory results fo…

feature selectionMulti-agent Reinforcement LearningQ-Learningreinforcement-learning+2

Energy-Aware Metaheuristics

2026-02-06 · Enrique Alba, Tomohiro Harada, Gabriel Luque arxiv

This paper presents a principled framework for designing energy-aware metaheuristics that operate under fixed energy budgets. We introduce a unified operator-level model that quantifies both numerical gain and energy usa…