MARBLES: Mining association rules buried in long event sequences

Statistical Analysis and Data Mining

Volumn 7, Issue 2, 2014, Pages 93-110

  Cule, Boris ^a   Tatti, Nikolaj ^b,c   Goethals, Bart ^a  

^a UNIVERSITY OF ANTWERP   (Belgium)

^b UNIVERSITY OF LEUVEN   (Belgium)

^c HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

Author keywords

Association rules; Closed patterns; Confidence boost; Episodes; Sequential data

Indexed keywords

DATA MINING;

CLOSED PATTERN; COMPLEX PATTERN; CONFIDENCE BOOST; CONFIDENCE MEASURE; EPISODE; EVENT SEQUENCE; MINE ASSOCIATION RULES; PATTERN DISCOVERY; SEQUENTIAL DATA; SEQUENTIAL PATTERNS;

ASSOCIATION RULES;

EID: 84937570027     PISSN: 19321864     EISSN: 19321872     Source Type: Journal    
DOI: 10.1002/sam.11199     Document Type: Article

References (26)

1. B. Cule, N. Tatti, and B. Goethals. Marbles: Mining association rules buried in long event sequences, In Proceedings of the SIAM International Conference on Data Mining (SDM 2012), 2012, 248-259.
2. H. Mannila, H. Toivonen, and A. Inkeri Verkamo. Discovery of frequent episodes in event sequences, Data Mining Knowl Discov, 1(3) (1997), 259-289.
3. J. L. Balcázar, Formal and computational properties of the confidence boost of association rules, CoRR abs/1103.4778 (2011).
4. J. Wang and J Han. Bide: Efficient mining of frequent closed sequences, 20th International Conference on Data Engineering (ICDE 2004), 2004, 79.
5. R. Agrawal and R. Srikant, Mining sequential patterns, In 11th International Conference on Data Engineering (ICDE 1995), 1995, 3-14.
6. R. Agrawal and R. Srikant, Fast algorithms for mining association rules, In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB 1994), 1994, 487-499.
7. N. Tatti and B. Cule. Mining closed strict episodes, Data Mining Knowl Discov, 25(1) (2012), 34-66.
8. S. Laxman, P. S. Sastry, and K. P. Unnikrishnan. A fast algorithm for finding frequent episodes in event streams, In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2007), 2007, 410-419.
9. N. Tatti and B. Cule. Mining closed episodes with simultaneous events, In Proceedings of the 17th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD 2011), 2011, 1172-1180.
10. W. Zhou, H. Liu, and H. Cheng. Mining closed episodes from event sequences efficiently, In Proceedings of the 14th Pacific-Asia Conference on Knowledge Discovery and Data Mining (1), 2010, 310-318.
11. N. Méger and C. Rigotti. Constraint-based mining of episode rules and optimal window sizes, In Knowledge Discovery in Databases: PKDD 2004, 8th European Conference on Principles and Practice of Knowledge Discovery in Databases, 2004, 313-324.
12. B. Cule and B. Goethals. Mining association rules in long sequences, In Proceedings of the 14th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2010), 2010, 300-309.
13. B. Cule, B. Goethals, and C. Robardet. A new constraint for mining sets in sequences, In Proceedings of the SIAM International Conference on Data Mining (SDM 2009), 2009, 317-328.
14. X. Yan, J. Han, and R. Afshar. Clospan: Mining closed sequential patterns in large datasets, In Proceedings of the SIAM International Conference on Data Mining (SDM 2003), 2003, 166-177.
15. P. Tzvetkov, Xifeng Yan, and Jiawei Han. Tsp: Mining top-k closed sequential patterns, In Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), 2003, 347-354.
16. J. Tsong-Li Wang, G.-W. Chirn, T. G. Marr, B. Shapiro, D. Shasha, and K. Zhang. Combinatorial pattern discovery for scientific data: some preliminary results, ACM SIGMOD Record 23(2), 1994, 115-125.
17. G. Casas-Garriga. Summarizing sequential data with closed partial orders, In Proceedings of the SIAM International Conference on Data Mining (SDM 2005), 2005, 380-391.
18. S. K. Harms, J. S. Deogun, J. Saquer, and T. Tadesse. Discovering representative episodal association rules from event sequences using frequent closed episode sets and event constraints, In Proceedings of the IEEE International Conference on Data Mining (ICDM 2001), 2001, 603-606.
19. M. Garofalakis, R. Rastogi, and K. Shim. Mining sequential patterns with regular expression constraints, IEEE Trans Knowl Data Eng 14(3) (2002), 530-552.
20. J. Pei, H. Wang, J. Liu, K. Wang, J. Wang, and P. S. Yu. Discovering frequent closed partial orders from strings, IEEE Trans Knowl Data Eng 18(11), 2006, 1467-1481.
21. N. Tatti. Significance of episodes based on minimal windows, In Proceedings of the 9th IEEE International Conference on Data Mining (ICDM 2009), 2009, 513-522.
22. G. Casas-Garriga. Discovering unbounded episodes in sequential data, In Knowledge Discovery in Databases: PKDD 2003, 7th European Conference on Principles and Practice of Knowledge Discovery in Databases, 2003, 83-94.
23. R. Gwadera, M. J. Atallah, and W. Szpankowski. Markov models for identification of significant episodes, In Proceedings of the SIAM International Conference on Data Mining (SDM 2005), 2005, 404-414.
24. R. Gwadera, M. J. Atallah, and W. Szpankowski. Reliable detection of episodes in event sequences, Knowl Inf Sys, 7(4) (2005), 415-437.
25. T. Calders, N. Dexters, and B. Goethals. Mining frequent itemsets in a stream, In Proceedings of the 7th IEEE International Conference on Data Mining (ICDM 2007), 2007, 83-92.
26. Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, and L. Lakhal, Mining minimal non-redundant association rules using frequent closed itemsets, In Computational Logic, 2000, 972-986.