Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/986537.986592acmconferencesArticle/Chapter ViewAbstractPublication Pagesacm-seConference Proceedingsconference-collections
Article

Anchors: a technique of pre-classification and its effects on Hidden Markov Models

Published: 02 April 2004 Publication History

Abstract

Hidden Markov Models have been prominent in the categorization of biological data in recent years. Genemark and Genscan, which incorporate Hidden Markov Models, are popular tools used to identify regions in DNA sequences.Hidden Markov Models make predictions about an observable sequence based on transition and emission probabilities of its states. A pre-classification of part of the observable sequence is proposed in order to increase the accuracy of prediction of the HMM. To pre-classify the sequence, we analyze overrepresented and under-represented substrings in the observable sequence and make a classification if the substring is significantly unique to one of the classification categories. With the addition of these 'anchors' in the sequence, the predictive accuracy of a HMM has been found to be improved.A previous experiment which studied the predictive accuracy of a first order Hidden Markov Model on a mix of English and Spanish (based upon consonant and vowel transitions) yielded favorable results at low probabilities of a language transition. The experiment is revisited with the addition of the pre-classification, which classifies approximately 1% of the sequence at a high accuracy (over 90%). This yields a considerable improvement in classification by the Hidden Markov Model. This addition to new or current HMM techniques of DNA sequence classification should improve accuracy.

References

[1]
L. E. Baum and T. Petrie, "Statistical Inference for probabilistic functions of finite state Markov chains," Ann. Math. Stat., vol. 37, pp. 1554--1563, 1966.
[2]
L. E. Baum and J. A. Egon, "an inequality with applications to statistical estimation for probabilistic functions of a Markov process and toa model for ecology, "Bull. Amer. Meterorol. Soc., vol 73, pp. 360--363, 1967.
[3]
L. E. Baum and G. R. Sell, "Growth functions for transformations on manifolds, " Pac. J. Math., vol. 27, no. 2, pp. 211--227, 1968.
[4]
L. E. Baum, T. Petrie, G. Soules, and N. Weiss, "A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains, " Ann. Math. Stat., vol. 41, no. 1, pp. 164--171, 1970.
[5]
L. E. Baum, "An inequality and associated maximization technique in statistical estimation for probabilistic functions of Markov processes, " Inequalities, vol. 3, pp 1--8, 1972.
[6]
J. Fisher, F. Hernandez, A. Sprague. "Language Patterns: Comparison and Prediction Using Hidden Markov Models". Proceedings of the ACMSE'03- ACM Southeastern Conference
[7]
Apostolico, et al. "Efficient Detection of Unusual Words". Journal of Computational Biology, Volume 7, Number 1/2, 2000. P 71--94.
[8]
Rogic et al. "Evaluation of Gene-Finding Programs on Mammalian Sequences" Genome Research, 2001. May; 11 (5): 817--832.

Cited By

View all
  • (2012)A distributed model for approximate service provisioning in internet of thingsProceedings of the 2012 international workshop on Self-aware internet of things10.1145/2378023.2378030(31-36)Online publication date: 17-Sep-2012

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
ACMSE '04: Proceedings of the 42nd annual ACM Southeast Conference
April 2004
485 pages
ISBN:1581138709
DOI:10.1145/986537
  • General Chair:
  • Seong-Moo Yoo,
  • Program Chair:
  • Letha Hughes Etzkorn
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 April 2004

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Hidden Markov Models
  2. bioinformatics
  3. data mining

Qualifiers

  • Article

Conference

ACM SE04
Sponsor:
ACM SE04: ACM Southeast Regional Conference 2004
April 2 - 3, 2004
Alabama, Huntsville

Acceptance Rates

Overall Acceptance Rate 502 of 1,023 submissions, 49%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2012)A distributed model for approximate service provisioning in internet of thingsProceedings of the 2012 international workshop on Self-aware internet of things10.1145/2378023.2378030(31-36)Online publication date: 17-Sep-2012

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media