There are many types of sequences on which classification algorithms are applied. Sequences of symbols with information on the relation between every two direct successors (referred to as link information) is one of these. A common approach for classification of such sequences is to only consider the symbols and disregard the link information. However, this can be at the expense of the quality of the classifications. In this thesis, we show how the edit distance can be used to classify sequences based on its symbols as well as its link information. The edit distance is an alignment-based pairwise dissimilarity metric. Its definition depends on the structural representation of the instances that are compared. The set of edit operations deter...
Computing the Edit Distance between two strings is one of the most fundamental problems in computer ...
Paaßen B, Gallicchio C, Micheli A, Hammer B. Tree Edit Distance Learning via Adaptive Symbol Embeddi...
International audienceOne of the most popular distance measures between a pair of graphs is the Grap...
Comparison functions for sequences (of symbols) are important components of many applications, for e...
Nowadays sequences of symbols are becoming more important, as they are the standard format for repre...
We model the edit distance as a function in a labelling space. A labelling space is an Euclidean spa...
Abstract. In this article we introduce new variants of the edit distance string similarity measure, ...
The edit-distance of two strings is the minimal cost of a sequence of symbol insertions, deletions, ...
Graph edit distance measures the distance between two graphs as the number of elementary operations ...
Abstract. In this article we introduce new variants of the edit distance string sim-ilarity measure,...
Pattern Recognition tasks in the structural domain generally exhibit high accuracy results, but thei...
We discuss several approaches to similarity preserving coding of symbol sequences and possible conne...
A common model for computing the similarity of two stringsXandYof lengthsm, andnrespectively with n,...
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither ...
The edit distance (or Levenshtein distance) between two strings x, y is the minimum number of charac...
Computing the Edit Distance between two strings is one of the most fundamental problems in computer ...
Paaßen B, Gallicchio C, Micheli A, Hammer B. Tree Edit Distance Learning via Adaptive Symbol Embeddi...
International audienceOne of the most popular distance measures between a pair of graphs is the Grap...
Comparison functions for sequences (of symbols) are important components of many applications, for e...
Nowadays sequences of symbols are becoming more important, as they are the standard format for repre...
We model the edit distance as a function in a labelling space. A labelling space is an Euclidean spa...
Abstract. In this article we introduce new variants of the edit distance string similarity measure, ...
The edit-distance of two strings is the minimal cost of a sequence of symbol insertions, deletions, ...
Graph edit distance measures the distance between two graphs as the number of elementary operations ...
Abstract. In this article we introduce new variants of the edit distance string sim-ilarity measure,...
Pattern Recognition tasks in the structural domain generally exhibit high accuracy results, but thei...
We discuss several approaches to similarity preserving coding of symbol sequences and possible conne...
A common model for computing the similarity of two stringsXandYof lengthsm, andnrespectively with n,...
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither ...
The edit distance (or Levenshtein distance) between two strings x, y is the minimum number of charac...
Computing the Edit Distance between two strings is one of the most fundamental problems in computer ...
Paaßen B, Gallicchio C, Micheli A, Hammer B. Tree Edit Distance Learning via Adaptive Symbol Embeddi...
International audienceOne of the most popular distance measures between a pair of graphs is the Grap...