Chang-Seok Ock
Research Subjects
Research Interests
Chang-Seok Ock has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Hwan-Gue Cho
Pusan National University
2 shared publications Jong Kyu Seo
1 shared publicationSung-Hwan Kim
1 shared publication- Sung-Hwan Kim
Pusan National University
1 shared publication
Latest Publications
- 1 July 2013
- Published by International Academy Publishing (IAP) in Journal of Computers
- Vol. 8 (7)
An Efficient Composite-Alphabet Transform for String Matching under a Restricted Alphabet Set
- 1 July 2013
- Published by International Academy Publishing (IAP) in Journal of Computers
- Vol. 8 (7)
An Efficient Composite-Alphabet Transform for String Matching under a Restricted Alphabet Set
- 1 January 2013
- Published by EJournal Publishing in International Journal of Machine Learning and Computing
- p. 112-116
Construction of Adaptive Scoring Matrix Using Similar Strings as a Training Set
Sequence alignment is one of the methods widely used to determine string similarity. It computes similarity by aligning the component characters a string, and summing the similarity scores of pairs of matched characters. Using an appropriate character similarity measure is important when performing the alignment-based similarity calculation, since the string similarity is highly depending on the character similarity. In this paper, we focus on the character similarity learning process for string classification, particularly for when one set of strings that belong to the same class is given. Our method uses the matching frequency to calculate the character similarity. The performance of the method is also demonstrated by experimental evaluation
- 1 January 2013
- Published by EJournal Publishing in International Journal of Machine Learning and Computing
- p. 112-116
Construction of Adaptive Scoring Matrix Using Similar Strings as a Training Set
Sequence alignment is one of the methods widely used to determine string similarity. It computes similarity by aligning the component characters a string, and summing the similarity scores of pairs of matched characters. Using an appropriate character similarity measure is important when performing the alignment-based similarity calculation, since the string similarity is highly depending on the character similarity. In this paper, we focus on the character similarity learning process for string classification, particularly for when one set of strings that belong to the same class is given. Our method uses the matching frequency to calculate the character similarity. The performance of the method is also demonstrated by experimental evaluation