The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
A Review of Kernel Methods Based Approaches to Classification and Clustering of Sequential Patterns, Part II: Sequences of Discrete Symbols
|
|
Author(s): Veena T. (Veena T.Indian Institute of Technology Madras, India), Dileep A. D. (Dileep A. D.Indian Institute of Technology Madras, India)and C. Chandra Sekhar (Indian Institute of Technology Madras, India)
Copyright: 2012
Pages: 21
Source title:
Pattern Discovery Using Sequence Data Mining: Applications and Studies
Source Author(s)/Editor(s): Pradeep Kumar (Indian Institute of Management, India), P. Radha Krishna (Infosys Technologies Limited, India)and S. Bapi Raju (University of Hyderabad, India)
DOI: 10.4018/978-1-61350-056-9.ch003
Purchase
|
Abstract
Pattern analysis tasks on sequences of discrete symbols are important for pattern discovery in bioinformatics, text analysis, speech processing, and handwritten character recognition. Discrete symbols may correspond to amino acids or nucleotides in biological sequence analysis, characters in text analysis, and codebook indices in processing of speech and handwritten character data. The main issues in kernel methods based approaches to pattern analysis tasks on discrete symbol sequences are related to defining a measure of similarity between sequences of discrete symbols, and handling the varying length nature of sequences. We present a review of methods to design dynamic kernels for sequences of discrete symbols. We then present a review of approaches to classification and clustering of sequences of discrete symbols using the dynamic kernel based methods.
Related Content
|
.
© 2023.
34 pages.
|
|
.
© 2023.
15 pages.
|
|
.
© 2023.
15 pages.
|
|
.
© 2023.
18 pages.
|
|
.
© 2023.
24 pages.
|
|
.
© 2023.
32 pages.
|
|
.
© 2023.
21 pages.
|
|
|