{"title":"A robust approach to sequence classification","authors":"Ming Li, R. Sleep","doi":"10.1109/ICTAI.2005.16","DOIUrl":null,"url":null,"abstract":"We report results for classification of representations of music, spoken words, and text documents. Experimental comparisons with other state-of-the-art algorithms yield improved results for all three examples. We use a support vector machine (SVM) as our classifier in all experiments. This is driven by a kernel matrix of similarity measures between the sequences. Our similarity measure is based on n-grams of varying length (multi-grams), weighted to reflect discrimination ability. To alleviate the problem of the exponential growth of feature size with n, we use a modified LZ78 algorithm (Z. Jacob and L. Abraham, 1978) to guide feature selection. Our method exhibits good performance over the three widely distinct tasks reported here, and is very computationally efficient and may therefore be useful in real time applications","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAI.2005.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21
Abstract
We report results for classification of representations of music, spoken words, and text documents. Experimental comparisons with other state-of-the-art algorithms yield improved results for all three examples. We use a support vector machine (SVM) as our classifier in all experiments. This is driven by a kernel matrix of similarity measures between the sequences. Our similarity measure is based on n-grams of varying length (multi-grams), weighted to reflect discrimination ability. To alleviate the problem of the exponential growth of feature size with n, we use a modified LZ78 algorithm (Z. Jacob and L. Abraham, 1978) to guide feature selection. Our method exhibits good performance over the three widely distinct tasks reported here, and is very computationally efficient and may therefore be useful in real time applications
我们报告了音乐、口语和文本文档表示的分类结果。与其他最先进的算法进行实验比较,对所有三个示例都产生了改进的结果。在所有实验中,我们使用支持向量机(SVM)作为我们的分类器。这是由序列之间相似性度量的核矩阵驱动的。我们的相似性度量是基于不同长度的n个克(多克),加权以反映辨别能力。为了缓解特征大小随n呈指数增长的问题,我们使用改进的LZ78算法(Z. Jacob and L. Abraham, 1978)来指导特征选择。我们的方法在这里报告的三种截然不同的任务中表现出良好的性能,并且计算效率很高,因此可能在实时应用程序中很有用