Summarizing sequential data with closed partial orders

Proceedings of the 2005 SIAM International Conference on Data Mining, SDM 2005

Volumn , Issue , 2005, Pages 380-391

  Casas Garriga, Gemma ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Closed partial orders; Post processing closed sequential patterns; Sequence analysis

Indexed keywords

CLOSED SEQUENCES; CLOSED SEQUENTIAL PATTERNS; GALOIS LATTICES; INPUT SEQUENCE; PARTIAL ORDER; POST PROCESSING; SEQUENCE ANALYSIS; SEQUENTIAL DATA;

DATA MINING;

EID: 35248820419     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972757.34     Document Type: Conference Paper

References (19)

1. R. Agrawal and R. Srikant. Mining sequential patterns. In Eleventh International Conference on Data Engineering, pages 3-14. IEEE Computer Society Press, 1995.
2. M.J. Atallah, R. Gwadera, and W. Szpankowski. Detection of significant sets of episodes in event sequences. In Proceedings of the 4th International Conference on Data Mining, pages 3-10, 2004.
3. J.L. Balćazar and G. Casas-Garriga. On Horn axiom-atizations for sequential data. In Proceedings of the 10th Int. Conference on Database Theory, pages 215-229, 2005.
4. G. Casas-Garriga. Towards a formal framework for mining general patterns from structured data. In Workshop Multi-relational Datamining, in KDD Int. Conf, pages 215-229, 2003.
5. G. Casas-Garriga and J.L. Balćazar. Coproduct transformations on lattices of closed partial orders. In Proceedings of 2nd. Int. Conference on Graph Transformation, pages 336-351, 2004.
6. G. Das, R. Fleischer, L. Gasieniec, D. Gunopulos, and J. Kärkkäinen. Episode matching. In Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching, pages 12-27, 1997.
7. B.A. Davey and H.A. Priestly. Introduction to Lattices and Order. Cambridge, 2002.
8. B. Ganter and R. Wille. Formal Concept Analysis. Mathematical Foundations. Springer, 1998.
9. W. Lee, S.J. Stolfo, and K. Mok. A data mining framework for building intrusion detection models. In Proceedings of the IEEE Symposium on Security and Privacy, pages 120-132, 1999.
10. H. Mannila and C. Meek. Global partial orders from sequential data. In Proceedings of the 6th Int. Conference on Knowledge Discovery in Databases, pages 161-168, 2000.
11. H. Mannila, H. Toivonen, and A.I. Verkamo. Discovering frequent episodes in sequences. Data Mining and Knowledge Discovery, 1(3):259-289, 1997.
12. N. Pasquier, Y. Bastide, R. Taouil L., and Lakhal. Closed set based discovery of small covers for association rules. In Proceedings of the 15th Int. Conference on Advanced Databases, pages 361-381, 1999.
13. J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M. Hsu. PrefixSpan: mining sequential patterns by prefixprojected growth. In Proceedings of the 17th Int. Conference on Data Engineering, pages 215-224, 2001.
14. Z. Tronicek. Episode matching. In Combinatorial Pattern Matching, pages 143-146, 2001.
15. P. Tzvetkov, X. Yan, and J. Han. TSP: Mining top-k closed sequential patterns. In Proceedints of the 3rd IEEE International Conference on Data Mining, pages 347-358, 2003.
16. J. Wang and J. Han. BIDE: Efficient mining of frequent closed sequences. In Proceedings of the 19th Int. Conference on Data Engineering, pages 79-90, 2003.
17. X. Yan, J. Han, and R. Afshar. CloSpan: Mining closed sequential patterns in large datasets. In Proceedings of the Int. Conference SIAM Data Mining, pages 166-177, 2003.
18. M. Zaki. Generating non-redundant association rules. In Proceedings of the 6th Int. Conference on Knowledge Discovery and Data Mining, pages 34-43, 2000.
19. M. Zaki. SPADE: An efficient algorithm for mining frequent sequences. Machine Learning Journal, special issue on Unsupervised Learning, 42(1/2):31-60, 2001.