A dynamic multi-reduction algorithm for brain functional connection pathways analysis (Q2338059)

Summary: Revealing brain functional connection pathways is of great significance in understanding the cognitive mechanism of the brain. In this paper, we present a novel rough set based dynamic multi-reduction algorithm (DMRA) to analyze brain functional connection pathways. First, a binary discernibility matrix is introduced to obtain a reduction, and a reduction equivalence theorem is proposed and proved to verify the feasibility of reduction algorithm. Based on this idea, we propose a dynamic single-reduction algorithm (DSRA) to obtain a seed reduction, in which two dynamical acceleration mechanisms are presented to reduce the size of the binary discernibility matrix dynamically. Then, the dynamic multi-reduction algorithm is proposed, and multi-reductions can be obtained by replacing the non-core attributes in seed reduction. Comparative performance experiments were carried out on the UCI datasets to illustrate the superiority of DMRA in execution time and classification accuracy. A memory cognitive experiment was designed and three brain functional connection pathways were successfully obtained from brain functional Magnetic Resonance Imaging (fMRI) by employing the proposed DMRA. The theoretical and empirical results both illustrate the potentials of DMRA for brain functional connection pathways analysis.