We present a new classification algorithm for high dimensional problems. The algorithm uses a Markov random field for modeling meaningful interactions within the training data set. The model parameters are efficiently estimated using the Kalman filter algorithm and adapted to fit the test data using a recursive matrix formulation of the extended Baum-Welch algorithm. A spatially likelihood test procedure is then used for classifying the data. The performance of the new algorithm is demonstrated in fMRI classification.
By: Avishy Carmi; Dimitri Kanevsky; Bhuvana Ramabhadran
Published in: RC24648 in 2008
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .