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

Konrad Rieck, Pavel Laskov, Klaus Muller

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages374-383
Number of pages10
Volume4174 LNCS
Publication statusPublished - 2006 Oct 30
Externally publishedYes
Event28th Symposium of the German Association for Pattern Recognition, DAGM 2006 - Berlin, Germany
Duration: 2006 Sep 122006 Sep 14

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4174 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other28th Symposium of the German Association for Pattern Recognition, DAGM 2006
CountryGermany
CityBerlin
Period06/9/1206/9/14

Fingerprint

Similarity Measure
Efficient Algorithms
kernel
Intrusion detection
Research
Data structures
Similarity Coefficient
Intrusion Detection
Distance Function
Kernel Function
Data Structures
Experiments
Experiment

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Rieck, K., Laskov, P., & Muller, K. (2006). Efficient algorithms for similarity measures over sequential data: A look beyond kernels. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4174 LNCS, pp. 374-383). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4174 LNCS).

Efficient algorithms for similarity measures over sequential data : A look beyond kernels. / Rieck, Konrad; Laskov, Pavel; Muller, Klaus.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4174 LNCS 2006. p. 374-383 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4174 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Rieck, K, Laskov, P & Muller, K 2006, Efficient algorithms for similarity measures over sequential data: A look beyond kernels. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4174 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4174 LNCS, pp. 374-383, 28th Symposium of the German Association for Pattern Recognition, DAGM 2006, Berlin, Germany, 06/9/12.
Rieck K, Laskov P, Muller K. Efficient algorithms for similarity measures over sequential data: A look beyond kernels. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4174 LNCS. 2006. p. 374-383. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Rieck, Konrad ; Laskov, Pavel ; Muller, Klaus. / Efficient algorithms for similarity measures over sequential data : A look beyond kernels. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4174 LNCS 2006. pp. 374-383 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{7d86c32e28f6426cae9ed45ed4108d98,
title = "Efficient algorithms for similarity measures over sequential data: A look beyond kernels",
abstract = "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.",
author = "Konrad Rieck and Pavel Laskov and Klaus Muller",
year = "2006",
month = "10",
day = "30",
language = "English",
isbn = "3540444122",
volume = "4174 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "374--383",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Efficient algorithms for similarity measures over sequential data

T2 - A look beyond kernels

AU - Rieck, Konrad

AU - Laskov, Pavel

AU - Muller, Klaus

PY - 2006/10/30

Y1 - 2006/10/30

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33750258120&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33750258120&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33750258120

SN - 3540444122

SN - 9783540444121

VL - 4174 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 374

EP - 383

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -