Name
Abstract | ||
|---|---|---|
Sequences of events arise naturally in various applications. Such sequences consist of pairs of event type and occurrence time. The similarity search problem is the following: given a query window into the sequence, i.e., the subsequence consisting of the events occurring within a period of time, find all windows of the sequence such that they are similar to the query window. The similarity between two windows is defined by an edit distance notion. The edit distance between two windows in an... |
Year | Venue | Keywords |
|---|---|---|
2001 | SDM | edit distance,similarity search |
Field | DocType | Citations |
Randomized algorithm,Telecommunications network,Event type,Pattern recognition,ALARM,Computer science,Artificial intelligence,User interface,Nearest neighbor search,Johnson–Lindenstrauss lemma | Conference | 5 |
PageRank | References | Authors |
0.46 | 14 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Heikki Mannila | 1 | 6595 | 1495.69 |
| Jouni K. Seppanen | 2 | 5 | 0.46 |