Frequent Closed Sequence Mining without Candidate Maintenance

IEEE Transactions on Knowledge and Data Engineering - Tập 19 Số 8 - Trang 1042-1056 - 2007
Jianyong Wang1, Jiawei Han2, Chun Li1
1Department of Computer Science and Technology, Tsinghua University, Beijing, China
2Department of Computer Science, University of Illinois, Urbana-Champaign, Urbana, IL, USA

Tóm tắt

Từ khóa


Tài liệu tham khảo

li, 2004, C-Miner: Mining Block Correlations in Storage Systems, Proc Usenix Conf File and Storage Technologies (FAST '04), 173

10.1145/380995.381033

mannila, 1995, Discovering Frequent Episodes in Sequences, Proc ACM SIGKDD Int'l Conf Knowledge Discovery and Data Mining (SIGKDD '02), 210

10.1109/TSE.2006.28

10.1109/ICDE.1998.655804

masseglia, 1998, The PSP Approach for Mining Sequential Patterns, Proc European Symp Principle of Data Mining and Knowledge Discovery (PKDD '98), 176, 10.1007/BFb0094818

10.1109/FSKD.2008.97

10.1145/564691.564738

10.1023/A:1007652502315

10.1109/TKDE.2005.60

han, 2002, Mining Top-K Frequent Closed Patterns without Minimum Support, Proc IEEE Int'l Conf Data Mining (ICDM '02), 211

10.1145/347090.347167

10.1145/1137983.1137997

10.1007/s10115-006-0038-2

xie, 2006, Data Mining for Software Engineering, Proc 2006 ACM SIGKDD Int'l Conf Knowledge Discovery and Data Mining (SIGKDD '06)

10.1002/pro.5560040817

10.1109/ICDM.2003.1250939

deshpande, 2002, Evaluation of Techniques for Classifying Biological Sequences, Proc Pacific-Asia Conf Knowledge Discovery and Data Mining (PAKDD '02), 417, 10.1007/3-540-47887-6_41

10.1007/BFb0014140

10.1145/1081870.1081937

10.1145/956790.956800

10.1137/1.9781611972757.34

seno, 2002, SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint, Proc IEEE Int'l Conf Data Mining (ICDM '02), 418

2004, Proc ICDM Workshop Frequent Itemset Mining Implementations (FIMI '04)

10.1145/956750.956779

garofalakis, 1999, SPIRIT: Sequential Pattern Mining with Regular Expression Constraints, Proc Int'l Conf Very Large Data Bases (VLDB '99), 223

10.1145/775047.775109

10.1006/jmbi.2001.4870

10.1109/ICDE.1995.380415

agrawal, 1994, Fast Algorithms for Mining Association Rules, Proc Int'l Conf Very Large Data Bases (VLDB '94), 487

pasquier, 1999, Discovering Frequent Closed Itemsets for Association Rules, Proc Int'l Conf Database Theory (ICDT '99), 398

10.1145/584796.584799

pei, 2005, Efficiently Mining Frequent Closed Partial Orders, Proc IEEE Int'l Conf Data Mining (ICDM '05), 753

pei, 2000, CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets, Proc ACM SIGMOD Workshop Research Issues in Data Mining and Knowledge Discovery (DMKD), 21

10.1109/TKDE.2004.77