Efficiently mining frequent closed partial orders
暂无分享,去创建一个
Philip S. Yu | Jian Liu | Jian Pei | Haixun Wang | Jianyong Wang | Ke Wang
[1] Heikki Mannila,et al. Levelwise Search and Borders of Theories in Knowledge Discovery , 1997, Data Mining and Knowledge Discovery.
[2] Heikki Mannila,et al. Discovery of Frequent Episodes in Event Sequences , 1997, Data Mining and Knowledge Discovery.
[3] Umeshwar Dayal,et al. PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth , 2001, ICDE 2001.
[4] Heikki Mannila,et al. Global partial orders from sequential data , 2000, KDD '00.
[5] Richard M. Karp,et al. Discovering local structure in gene expression data: the order-preserving submatrix problem , 2002, RECOMB '02.
[6] A. Akhmetova. Discovery of Frequent Episodes in Event Sequences , 2006 .
[7] Aristides Gionis,et al. Fragments of order , 2003, KDD '03.
[8] Gemma C. Garriga,et al. Summarizing Sequential Data with Closed Partial Orders , 2005, SDM.
[9] Qiming Chen,et al. PrefixSpan,: mining sequential patterns efficiently by prefix-projected pattern growth , 2001, Proceedings 17th International Conference on Data Engineering.
[10] Ramakrishnan Srikant,et al. Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.