Efficient Algorithms for Similarity Measures over Sequential Data: A Look Beyond Kernels [chapter]

Konrad Rieck, Pavel Laskov, Klaus-Robert Müller
2006 Lecture Notes in Computer Science  
Kernel functions as similarity measures for sequential data have been extensively studied in previous research. This contribution addresses the efficient computation of distance functions and similarity coefficients for sequential data. Two proposed algorithms utilize different data structures for efficient computation and yield a runtime linear in the sequence length. Experiments on network data for intrusion detection suggest the importance of distances and even non-metric similarity measures for sequential data.
doi:10.1007/11861898_38 fatcat:3oankd3oqraafakv63zqgaizmm