By Topic

Hierarchal Decomposition of Neural Data using Boosted Mixtures of Hidden Markov Chains and its application to a BMI

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Shalom Darmanjian ; Student Member, IEEE, Department of Electrical and Computer Engineering, University of Florida, Gainesville, FL 32611-6200. ; Antonio Paiva ; Jose Principe ; Justin Sanchez

In this paper, we propose a simple algorithm that takes multidimensional neural input data and decomposes the joint likelihood into marginals using boosted mixtures of hidden Markov chains (BM-HMM). The algorithm applies techniques from boosting to create hierarchal dependencies between these marginal subspaces. Finally, borrowing ideas from mixture of experts, the local information is weighted and incorporated into an ensemble decision. Our results show that this algorithm is very simple to train and computationally efficient, while also providing the ability to reduce the input dimensionality for brain machine interfaces (BMIs).

Published in:

2007 International Joint Conference on Neural Networks

Date of Conference:

12-17 Aug. 2007