By Topic

Sequence learning: analysis and solutions for sparse data in high dimensional spaces

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
$31 $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

2 Author(s)
Zhou Bai ; Sch. of Comput. Sci., Univ. of Guelph, Guelph, ON, Canada ; Kremer, S.C.

We examine the problem of classifying biological sequences, and in particular the challenge of generalizing to novel input data. The high dimensionality of sequence results in an extremely sparsely populated input space. This motivates a need for regularization (a form of inductive bias), in order to achieve generalization. We discuss regularization in the context of regular Neural Networks and Deep Belief Networks, and provide experimental results on an example problem of DNA barcoding classification. Our results support the importance of using an effective regularization method, and indicate the adaptive, data-depended regularization mechanism of a DBN is more powerful than the simple methods of model selection / weight decay / early stopping.

Published in:

Computational Intelligence in Bioinformatics and Computational Biology (CIBCB), 2012 IEEE Symposium on

Date of Conference:

9-12 May 2012