共 50 条
- [1] Mining frequent patterns without candidate generation [J]. SIGMOD RECORD, 2000, 29 (02) : 1 - 12
- [2] Mining frequent ordered patterns without candidate generation [J]. FOURTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 1, PROCEEDINGS, 2007, : 402 - 406
- [3] An Efficient Algorithm for Mining Frequent Patterns in Data Stream [J]. INTERNATIONAL CONFERENCE OF CHINA COMMUNICATION (ICCC2010), 2010, : 160 - +
- [4] An algorithm for mining maximal frequent itemsets without candidate generation [J]. 2011 INTERNATIONAL CONFERENCE ON COMPUTER, ELECTRICAL, AND SYSTEMS SCIENCES, AND ENGINEERING (CESSE 2011), 2011, : 330 - 333
- [5] Graph Theoretic Based Algorithm for Mining Frequent Patterns [J]. 2008 IEEE INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOLS 1-8, 2008, : 628 - 632
- [6] Incremental mining of frequent patterns without candidate generation or support constraint [J]. SEVENTH INTERNATIONAL DATABASE ENGINEERING AND APPLICATIONS SYMPOSIUM, PROCEEDINGS, 2003, : 111 - 116
- [7] Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach [J]. Data Mining and Knowledge Discovery, 2004, 8 : 53 - 87
- [9] Frequent Patterns Mining from Data Cube Using Aggregation and Directed Graph [J]. PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON FRONTIERS IN INTELLIGENT COMPUTING: THEORY AND APPLICATIONS (FICTA) 2015, 2016, 404 : 167 - 177