Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

Efficient algorithms for similarity measures over sequential data: A look beyond kernels

: Rieck, K.; Laskov, P.; Müller, K.-R.

Franke, K.; Müller, K.R.; Nickolay, B.; Schäfer, R. ; Deutsche Arbeitsgemeinschaft für Mustererkennung -DAGM-:
Pattern recognition : 28th DAGM Symposium. Proceedings : Berlin, Germany, September 12-14, 2006
Berlin: Springer, 2006 (Lecture Notes in Computer Science 4174)
ISBN: 3-540-44412-2
ISBN: 978-3-540-44412-1
Deutsche Arbeitsgemeinschaft für Mustererkennung (Symposium) <28, 2006, Berlin>
Conference Paper
Fraunhofer FIRST ()

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.