DMCA
Discovery of frequent episodes in event sequences (1997)
Cached
Download Links
- [www.cs.uiuc.edu]
- [cs.chungbuk.ac.kr]
- [www.cs.helsinki.fi]
- [www.cs.helsinki.fi]
- [www.cs.helsinki.fi]
- [www.win.tue.nl]
- DBLP
Other Repositories/Bibliography
Venue: | Data Min. Knowl. Discov |
Citations: | 361 - 13 self |
Citations
3329 | Mining Association Rules between Sets of Items in Large Databases
- Agrawal, Iminlinski, et al.
- 1993
(Show Context)
Citation Context ...been presented in Goodman et al. (1995). The task of discovering frequent parallel episodes can be stated as a task of discovering all frequent sets, a central phase of discovering association rules (=-=Agrawal et al., 1993-=-). The rule generation methods are essentially the same for association rules and WINEPI. The levelwise main algorithm has also been used successfully in the search of frequent sets (Agrawal et al., 1... |
1567 | Mining sequential patterns
- Agrawal, Srikant
- 1995
(Show Context)
Citation Context ...from a telecommunication network, or different types of user actions, and they have been marked on a time line. Recently, interest in knowledge discovery from sequential data has increased (see e.g., =-=Agrawal and Srikant, 1995-=-; Bettini et al., 1996; Dousson et al., 1993; Hätönen et al., 1996a; Howe, 1995; Jonassen et al., 1995; Laird, 1993; Mannila et al., 1995; Morris et al., 1994; Oates and Cohen, 1996; Wang et al., 1994... |
1194 | Foundations of Inductive Logic Programming
- Muggleton
- 1995
(Show Context)
Citation Context ...covery tasks is. There are also some interesting similarities between the286 MANNILA, TOIVONEN AND VERKAMO discovery of frequent episodes and the work done on inductive logic programming (see, e.g., =-=Muggleton, 1992-=-); a noticeable difference is caused by the sequentiality of the underlying data model, and the emphasis on time-limited occurrences. Similarly, the problem of looking for one occurrence of an episode... |
1085 |
The Statistical Analysis of Failure Time Data
- Kalbfreisch, Prentice
- 1980
(Show Context)
Citation Context ... method is not practical for episodes since the deterministic automata could be very large.EPISODES IN EVENT SEQUENCES 287 In stochastics, event sequence data is often called a marked point process (=-=Kalbfleisch and Prentice, 1980-=-). It should be noted that traditional methods for analyzing marked point processes are ill-suited for the cases where the number of event types is large. However, there is a promising combination of ... |
784 |
Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem
- Forgy
- 1982
(Show Context)
Citation Context ...e group of recent events has been studied, e.g., in artificial intelligence, where a similar problem in spirit is the many pattern/many object pattern match problem in production system interpreters (=-=Forgy, 1982-=-). Also, comparable strategies using a sliding window have been used, e.g., to study the locality of reference in virtual memory (Denning, 1968). Our setting differs from these in that our window is a... |
758 | Mining Sequential Patterns: Generalizations and Performance Improvements
- Srikant, Agrawal
- 1996
(Show Context)
Citation Context ...g tools, such as in the TASA system, episodes can provide useful views to the collection of recent alarms. 6. Related work The work most closely related to ours is perhaps (Agrawal and Srikant, 1995; =-=Srikant and Agrawal, 1996-=-). There multiple sequences are searched for patterns that are similar to serial episodes with some extra restrictions and an event taxonomy. Our methods can be extended with a taxonomy by a direct ap... |
590 | Mining generalized association rules
- Srikant, Agrawal
- 1995
(Show Context)
Citation Context ...extra restrictions and an event taxonomy. Our methods can be extended with a taxonomy by a direct application of the similar extensions to association rules (Han and Fu, 1995; Holsheimer et al.,1995; =-=Srikant and Agrawal, 1995-=-). Also, our methods can be applied on analyzing several sequences; there is actually a variety of choices for the definition of frequency (or support) of an episode in a set of sequences. Patterns ov... |
581 |
I.: “Fast discovery of association rules
- Agrawal, Mannila, et al.
- 1996
(Show Context)
Citation Context ...awal et al., 1993). The rule generation methods are essentially the same for association rules and WINEPI. The levelwise main algorithm has also been used successfully in the search of frequent sets (=-=Agrawal et al., 1996-=-); a generic levelwise algorithm and its analysis has been presented in Mannila and Toivonen (1997). Technical problems related to the recognition of episodes have been researched in several fields. T... |
462 | Y.Fu. Discovery of multiple-level association rules from large databases
- Han
- 1995
(Show Context)
Citation Context ... are similar to serial episodes with some extra restrictions and an event taxonomy. Our methods can be extended with a taxonomy by a direct application of the similar extensions to association rules (=-=Han and Fu, 1995-=-; Holsheimer et al.,1995; Srikant and Agrawal, 1995). Also, our methods can be applied on analyzing several sequences; there is actually a variety of choices for the definition of frequency (or suppor... |
338 | Verkamo. Fast discovery of association rules. - Agrawal, Mannila, et al. - 1996 |
288 |
The working set model for program behavior
- DENNING
- 1968
(Show Context)
Citation Context ...t pattern match problem in production system interpreters (Forgy, 1982). Also, comparable strategies using a sliding window have been used, e.g., to study the locality of reference in virtual memory (=-=Denning, 1968-=-). Our setting differs from these in that our window is a queue with the special property that we know in advance when an event will leave the window; this knowledge is used by WINEPI in the recogniti... |
262 | Levelwise Search and Borders of Theories in Knowledge Discovery, - Mannila, Toivonen - 1997 |
233 |
The PROSITE database, its status in
- Bairoch, Bucher, et al.
- 1995
(Show Context)
Citation Context ...t the time requirement is roughly linear with respect to the length of the input sequence, as could be expected. Finally, we experimented with protein sequences. We used data in the PROSITE database (=-=Bairoch et al., 1995-=-) of the ExPASy WWW molecular biology server of the Geneva University Hospital and the University of Geneva (ExPASy). PROSITE contains biologically significant DNA and protein patterns that help to id... |
179 | Composite event specification in active databases: Model and implementation. - Gehani, Jagadish, et al. - 1992 |
152 | Discovering generalized episodes using minimal occurrences. In:
- Mannila, Toivonen
- 1996
(Show Context)
Citation Context ...; Laird, 1993; Mannila et al., 1995; Morris et al., 1994; Oates and Cohen, 1996; Wang et al., 1994). One basic problem in analyzing event sequences is to find frequent episodes (Mannila et al., 1995; =-=Mannila and Toivonen, 1996-=-), i.e., collections of events occurring frequently together. For example, in the sequence of figure 1, the episode “E is followed by F” occurs several times, even when the sequence is viewed through ... |
99 |
Finding flexible patterns in unaligned protein sequences
- Jonassen, Collins, et al.
- 1995
(Show Context)
Citation Context ...line. Recently, interest in knowledge discovery from sequential data has increased (see e.g., Agrawal and Srikant, 1995; Bettini et al., 1996; Dousson et al., 1993; Hätönen et al., 1996a; Howe, 1995; =-=Jonassen et al., 1995-=-; Laird, 1993; Mannila et al., 1995; Morris et al., 1994; Oates and Cohen, 1996; Wang et al., 1994). One basic problem in analyzing event sequences is to find frequent episodes (Mannila et al., 1995; ... |
96 |
Combinatorial pattern discovery for scientific data: some preliminary results
- Wang, Chirn, et al.
- 1994
(Show Context)
Citation Context ...and Srikant, 1995; Bettini et al., 1996; Dousson et al., 1993; Hätönen et al., 1996a; Howe, 1995; Jonassen et al., 1995; Laird, 1993; Mannila et al., 1995; Morris et al., 1994; Oates and Cohen, 1996; =-=Wang et al., 1994-=-). One basic problem in analyzing event sequences is to find frequent episodes (Mannila et al., 1995; Mannila and Toivonen, 1996), i.e., collections of events occurring frequently together. For exampl... |
91 | Alarm Correlation. - Jakobson, Weissman - 1993 |
90 | Situation recognition: Representation and algorithms
- Dousson, Gaborit, et al.
- 1993
(Show Context)
Citation Context ...pes of user actions, and they have been marked on a time line. Recently, interest in knowledge discovery from sequential data has increased (see e.g., Agrawal and Srikant, 1995; Bettini et al., 1996; =-=Dousson et al., 1993-=-; Hätönen et al., 1996a; Howe, 1995; Jonassen et al., 1995; Laird, 1993; Mannila et al., 1995; Morris et al., 1994; Oates and Cohen, 1996; Wang et al., 1994). One basic problem in analyzing event sequ... |
56 | Knowledge Discovery from Telecommunication Network Alarm Databases
- Hätönen, Klemettinen, et al.
- 1996
(Show Context)
Citation Context ...nd they have been marked on a time line. Recently, interest in knowledge discovery from sequential data has increased (see e.g., Agrawal and Srikant, 1995; Bettini et al., 1996; Dousson et al., 1993; =-=Hätönen et al., 1996-=-a; Howe, 1995; Jonassen et al., 1995; Laird, 1993; Mannila et al., 1995; Morris et al., 1994; Oates and Cohen, 1996; Wang et al., 1994). One basic problem in analyzing event sequences is to find frequ... |
56 | Searching for structure in multiple streams of data.
- Oates, Cohen
- 1996
(Show Context)
Citation Context ...sed (see e.g., Agrawal and Srikant, 1995; Bettini et al., 1996; Dousson et al., 1993; Hätönen et al., 1996a; Howe, 1995; Jonassen et al., 1995; Laird, 1993; Mannila et al., 1995; Morris et al., 1994; =-=Oates and Cohen, 1996-=-; Wang et al., 1994). One basic problem in analyzing event sequences is to find frequent episodes (Mannila et al., 1995; Mannila and Toivonen, 1996), i.e., collections of events occurring frequently t... |
46 | A perspective on databases and data mining. - Holsheimer, Kersten, et al. - 1995 |
39 | Testing complex temporal relationships involving multiple granularities and its application to data mining. In:
- Bettini, Wang, et al.
- 1996
(Show Context)
Citation Context ...twork, or different types of user actions, and they have been marked on a time line. Recently, interest in knowledge discovery from sequential data has increased (see e.g., Agrawal and Srikant, 1995; =-=Bettini et al., 1996-=-; Dousson et al., 1993; Hätönen et al., 1996a; Howe, 1995; Jonassen et al., 1995; Laird, 1993; Mannila et al., 1995; Morris et al., 1994; Oates and Cohen, 1996; Wang et al., 1994). One basic problem i... |
39 | Pattern discovery in temporal databases: A temporal logic approach.
- Padmanabhan, Tuzhilin
- 1996
(Show Context)
Citation Context ...ces corresponds here to searching episodes from a sequence of (sender, alarm type) pairs. First order temporal logic has been proposed as a means of both expressing and discovering temporal patterns (=-=Padmanabhan and Tuzhilin, 1996-=-). The formalism is strong and allows expressing more complex patterns than episodes; it is unclear what the complexity of different discovery tasks is. There are also some interesting similarities be... |
31 | Episode matching - DAS, FLEISCHER, et al. - 1997 |
22 |
Simple and efficient string matching with k mismatches
- Grossi, Luccio
- 1989
(Show Context)
Citation Context ...e fact that we know where subepisodes of candidates have occurred. The methods for matching sets of episodes against a sequence have some similarities to the algorithms used in string matching (e.g., =-=Grossi and Luccio, 1989-=-). In particular, recognizing serial episodes in a sequence can be seen as locating all occurrences of subsequences, or matches of patterns with variable length do not care symbols, where the length o... |
15 |
Identifying and using patterns in sequential data.
- Laird
- 1993
(Show Context)
Citation Context ...t in knowledge discovery from sequential data has increased (see e.g., Agrawal and Srikant, 1995; Bettini et al., 1996; Dousson et al., 1993; Hätönen et al., 1996a; Howe, 1995; Jonassen et al., 1995; =-=Laird, 1993-=-; Mannila et al., 1995; Morris et al., 1994; Oates and Cohen, 1996; Wang et al., 1994). One basic problem in analyzing event sequences is to find frequent episodes (Mannila et al., 1995; Mannila and T... |
12 | TASA: Telecommunications Alarm Sequence Analyzer, or How to enjoy faults in your network
- Hatonen, Klemettinen, et al.
- 1996
(Show Context)
Citation Context ...nd they have been marked on a time line. Recently, interest in knowledge discovery from sequential data has increased (see e.g., Agrawal and Srikant, 1995; Bettini et al., 1996; Dousson et al., 1993; =-=Hätönen et al., 1996-=-a; Howe, 1995; Jonassen et al., 1995; Laird, 1993; Mannila et al., 1995; Morris et al., 1994; Oates and Cohen, 1996; Wang et al., 1994). One basic problem in analyzing event sequences is to find frequ... |
11 |
TIGER: real-time situation assessment of dynamic systems,
- Milne
- 1994
(Show Context)
Citation Context ...for corrective actions. See, e.g., Jakobson and Weissman (1993) for a description of a representative correlation system; similar approaches have been used successfully also in process control tasks (=-=Milne et al., 1994-=-). While the use of alarm correlation systems is quite popular and methods for specifying the correlations are maturing, acquiring all the knowledge necessary for constructing an alarm correlation sys... |
6 | The prosite database, its status - Hofman, Bucher, et al. - 1999 |
5 | Noaa—An expert system managing the telephone network - Goodman, Ambrose, et al. - 1995 |
5 |
Finding dependencies in event streams using local search
- Howe
- 1995
(Show Context)
Citation Context ...d on a time line. Recently, interest in knowledge discovery from sequential data has increased (see e.g., Agrawal and Srikant, 1995; Bettini et al., 1996; Dousson et al., 1993; Hätönen et al., 1996a; =-=Howe, 1995-=-; Jonassen et al., 1995; Laird, 1993; Mannila et al., 1995; Morris et al., 1994; Oates and Cohen, 1996; Wang et al., 1994). One basic problem in analyzing event sequences is to find frequent episodes ... |
4 | Composite event speci®cation in active databases: Model and implementation - Gehani, Jagadish, et al. - 1992 |
3 | SEQ: Design and implementation of a sequence database system
- Seshadri, Livny, et al.
- 1996
(Show Context)
Citation Context ...ences can be within a given edit distance. Recent results on the pattern matching aspects of recognizing episodes can be found in Das et al. (1997). The recent work on sequence data in databases (see =-=Seshadri et al., 1996-=-) provides interesting openings towards the use of database techniques in the processing of queries on sequences. A problem similar to the computation of frequencies occurs also in the area of active ... |
2 | An algebraic formulation of temporal knowledge for reasoning about recurring events
- Morris, Shoaff, et al.
- 1994
(Show Context)
Citation Context ...ntial data has increased (see e.g., Agrawal and Srikant, 1995; Bettini et al., 1996; Dousson et al., 1993; Hätönen et al., 1996a; Howe, 1995; Jonassen et al., 1995; Laird, 1993; Mannila et al., 1995; =-=Morris et al., 1994-=-; Oates and Cohen, 1996; Wang et al., 1994). One basic problem in analyzing event sequences is to find frequent episodes (Mannila et al., 1995; Mannila and Toivonen, 1996), i.e., collections of events... |
1 | Simple and eOEcient string matching with k mismatches - Grossi, Luccio - 1989 |
1 | Finding AEexible patterns in unaligned protein sequences - Jonassen, Collins, et al. - 1995 |