Improving the Accuracy and Efficiency of Compression-based Dissimilarity Measure using Information Quantity in Data Classification Problems

Compression-based Dissimilarity Measure (CDM) is reported to work well in classifying strings without clues. However, CDM depends on the compression program, and its theoretical background is unclear. In this paper, we propose to replace CDM with the computation of information quantity. Since CDM only uses compressed size, our approach uses the value of information quantity of maximum probability partitioning of string instead of file size. We find this approach is more effective. Then, CDM and the proposed method were applied to publicly available time series data. In addition to the careful implementation of computation using suffix arrays, we also find this approach more efficient.