Fast discovery of frequent closed sequential patterns based on positional data
暂无分享,去创建一个
[1] Mohammed J. Zaki,et al. Efficient algorithms for mining closed itemsets and their lattice structure , 2005, IEEE Transactions on Knowledge and Data Engineering.
[2] Jianyong Wang,et al. Mining sequential patterns by pattern-growth: the PrefixSpan approach , 2004, IEEE Transactions on Knowledge and Data Engineering.
[3] Umeshwar Dayal,et al. FreeSpan: frequent pattern-projected sequential pattern mining , 2000, KDD '00.
[4] Ramakrishnan Srikant,et al. Mining Sequential Patterns: Generalizations and Performance Improvements , 1996, EDBT.
[5] Xifeng Yan,et al. CloSpan: Mining Closed Sequential Patterns in Large Datasets , 2003, SDM.
[6] Dayang Rohaya Awang Rambli,et al. Mining Sequential Patterns Using I-PrefixSpan , 2007 .
[7] Jiawei Han,et al. BIDE: efficient mining of frequent closed sequences , 2004, Proceedings. 20th International Conference on Data Engineering.
[8] Mohammed J. Zaki,et al. CHARM: An Efficient Algorithm for Closed Itemset Mining , 2002, SDM.
[9] Zhang Kun and Zhu Yangyong. Sequence Pattern Mining Without Duplicate Project Database Scan , 2007 .
[10] Jiawei Han,et al. Frequent Closed Sequence Mining without Candidate Maintenance , 2007, IEEE Transactions on Knowledge and Data Engineering.
[11] Jian Pei,et al. CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets , 2000, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery.
[12] Mohammed J. Zaki,et al. SPADE: An Efficient Algorithm for Mining Frequent Sequences , 2004, Machine Learning.
[13] Ramakrishnan Srikant,et al. Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.