Mining minimal distinguishing subsequence patterns with gap constraints
暂无分享,去创建一个
[1] Johannes Gehrke,et al. Sequential PAttern mining using a bitmap representation , 2002, KDD.
[2] David Wai-Lok Cheung,et al. Mining periodic patterns with gap requirement from sequences , 2005, SIGMOD '05.
[3] Ayumi Shinohara,et al. A practical algorithm to find the best subsequence patterns , 2000, Theor. Comput. Sci..
[4] Mohammed J. Zaki. Sequence mining in categorical domains: incorporating constraints , 2000, CIKM '00.
[5] Ke Wang,et al. Frequent-subsequence-based prediction of outer membrane proteins , 2003, KDD '03.
[6] Giri Narasimhan,et al. Mining Protein Sequences for Motifs , 2002, J. Comput. Biol..
[7] Umeshwar Dayal,et al. PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth , 2001, ICDE 2001.
[8] Christophe Rigotti,et al. Constraint-Based Mining of Episode Rules and Optimal Window Sizes , 2004, PKDD.
[9] Dan Gusfield,et al. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .
[10] Chi Lap Yip,et al. Mining emerging substrings , 2003, Eighth International Conference on Database Systems for Advanced Applications, 2003. (DASFAA 2003). Proceedings..
[11] Heikki Mannila,et al. Discovering Frequent Episodes in Sequences , 1995, KDD.
[12] Gemma Casas-Garriga. Discovering Unbounded Episodes in Sequential Data , 2003 .
[13] Mohammed J. Zaki,et al. Scalable Feature Mining for Sequential Data , 2000, IEEE Intell. Syst..
[14] Cláudia Antunes,et al. Generalization of Pattern-Growth Methods for Sequential Pattern Mining with Gap Constraints , 2003, MLDM.
[15] Jinyan Li,et al. Efficient mining of emerging patterns: discovering trends and differences , 1999, KDD '99.
[16] Jiawei Han,et al. TSP: mining top-K closed sequential patterns , 2003, Third IEEE International Conference on Data Mining.
[17] Robert E. W. Hancock,et al. Outer Membrane Proteins , 1998 .
[18] Jianyong Wang,et al. Mining sequential patterns by pattern-growth: the PrefixSpan approach , 2004, IEEE Transactions on Knowledge and Data Engineering.
[19] Ramakrishnan Srikant,et al. Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.
[20] James Bailey,et al. Mining Minimal Distinguishing Subsequence Patterns with Gap Constraints , 2005, ICDM.
[21] Geoffrey I. Webb,et al. On detecting differences between groups , 2003, KDD '03.
[22] Umeshwar Dayal,et al. FreeSpan: frequent pattern-projected sequential pattern mining , 2000, KDD '00.
[23] Mohammed J. Zaki,et al. SPADE: An Efficient Algorithm for Mining Frequent Sequences , 2004, Machine Learning.
[24] Jinyan Li,et al. CAEP: Classification by Aggregating Emerging Patterns , 1999, Discovery Science.
[25] James Bailey,et al. Classification Using Constrained Emerging Patterns , 2003, WAIM.
[26] Kotagiri Ramamohanarao,et al. Making Use of the Most Expressive Jumping Emerging Patterns for Classification , 2001, Knowledge and Information Systems.
[27] David Maier,et al. The Complexity of Some Problems on Subsequences and Supersequences , 1978, JACM.
[28] Stephen D. Bay,et al. Detecting Group Differences: Mining Contrast Sets , 2001, Data Mining and Knowledge Discovery.
[29] Jinyan Li,et al. Mining border descriptions of emerging patterns from dataset pairs , 2005, Knowledge and Information Systems.
[30] Luc De Raedt,et al. The Levelwise Version Space Algorithm and its Application to Molecular Fragment Finding , 2001, IJCAI.
[31] Luc De Raedt,et al. Towards Optimizing Conjunctive Inductive Queries , 2004, KDID.
[32] Dimitrios Gunopulos,et al. Episode Matching , 1997, CPM.
[33] Gemma C. Garriga. Discovering Unbounded Episodes in Sequential Data , 2003, PKDD.
[34] Xifeng Yan,et al. CloSpan: Mining Closed Sequential Patterns in Large Datasets , 2003, SDM.
[35] Tom M. Mitchell,et al. Generalization as Search , 2002 .
[36] Jiawei Han,et al. BIDE: efficient mining of frequent closed sequences , 2004, Proceedings. 20th International Conference on Data Engineering.