ACM Home Page
Please provide us with feedback. Feedback
Improving Markov chain classification using string transformations and evolutionary search
Full text PdfPdf (1.67 MB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 11th Annual conference on Genetic and evolutionary computation table of contents
Montreal, Québec, Canada
SESSION: Track 11: genetics-based machine learning table of contents
Pages 1259-1266  
Year of Publication: 2009
ISBN:978-1-60558-325-9
Authors
Timothy Meekhof  University of Idaho, Moscow, ID, USA
Terence Soule  University of Idaho, Moscow, ID, USA
Robert B. Heckendorn  University of Idaho, Moscow, ID, USA
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1569901.1570070
What is a DOI?

ABSTRACT

Markov chain classification or n-gram modeling, as it is sometimes called, is a very common and powerful tool for many problems that involve sequences of finite tokens. It has been used in a wide range of tasks, including natural language modeling, author identification, protein similarity searches, and even bird-song recognition. Clearly, an improvement in the Markov chain classification will have broad implications in many fields. Our new system, called SCS, improves upon Markov chain classification by introducing a preprocessing step in which an arbitrary set of transformation functions are performed on the input sequences. Since the space of possible transformations is unbounded, a genetic algorithm search is used to search for functions that improve classification. We show that GA is able to consistently find preprocessing functions that substantially improve the performance of the Markov chain model.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
L. R. Bahl, F. Jelinek, and R. L. Mercer. Likelihood approach to continuous speech recognition. Transactions on Pattern Analysis and Machine Intelligence, 2:179--190, 1983.
 
3
A. Bairoch and R. Apweiler. The swiss-prot protein sequence data bank and its supplement trembl. Nucleic Acids Research, 25(1):31--36, 1997.
 
4
 
5
 
6
B. Y. M. Cheng, J. G. Carbonell, and J. Klein-Seetharaman. Protein classification based on text document classification techniques. Proteins: Structure, Function, and Bioinformatics, 58(4):955--970, 2005.
 
7
 
8

Collaborative Colleagues:
Timothy Meekhof: colleagues
Terence Soule: colleagues
Robert B. Heckendorn: colleagues