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

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.

• Type: Conference
• Year: 2006
• Where: DAGM
• Authors: Konrad Rieck, Pavel Laskov, Klaus-Robert Müller
• Keywords: DAGM 2006, Efficient Computation, Image Processing, Sequential Data, Similarity Measures