检索结果-内蒙古大学图书馆

The method of ensembles of decision trees for the analysis of the electrical activity produced by the human brain

Moscow University Computational Mathematics and Cybernetics 2008年第3期32卷 167-176页

作者： Popova, E.A. Department of the Automation of the Systems of Computer Complexes Faculty of Computational Mathematics and Cybernetics Moscow State University Moscow 119991 Russian Federation

In this paper, we develop a method for localization of the active domains of the brain by electroencephalography signals on the basis of ensembles of random decision trees. We suggest a method for reducing the problem of localization to the problem of classification of the quality of the dipole sources. We present a localization algorithm, which consists in constructing an ensemble of decision trees for the parameters of the dipole sources (which are responsible for the approximation of the potential detected at various time instants) and finding the most probable source regions on the basis of a special voting procedure. It is demonstrated that the approach that employs the decision trees technique allows a stable determination of the parameters of the transient function between the source and the signal detected, which is essential for the construction of the brain-computer interface. The method suggested is demonstrated to converge both on the exact solutions and on signals of real experiments by the analysis of evoked potentials. © 2008 Allerton Press, Inc.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On one approach to realization of the branch-and-bound method on a distributed system

引用

Moscow University Computational Mathematics and Cybernetics 2008年第3期32卷 182-185页

作者： Gulyaev, A.V. Makhnychev, V.S. Department of the Automation of the Systems of Computer Complexes Faculty of Computational Mathematics and Cybernetics Moscow State University Moscow 119992 Russian Federation

The branch-and-bound method is one of most efficient search algorithms. However, parallel decomposition of this method is difficult even on architectures with common memory, not to mention distributed systems. The paper describes an algorithm for solution of the problems that can be solved with the branch-and-bound method on a distributed computer system. The results of testing of the proposed algorithm via solution of the chess-game problem are presented. © 2008 Allerton Press, Inc.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：