共 50 条
- [31] An Efficient Approach for Generating Frequent Patterns without Candidate Generation PROCEEDINGS OF THE 2012 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI'12), 2012, : 1061 - 1067
- [32] An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data LECTURE NOTES IN COMPUTER SCIENCE <D>, 2000, 1910 : 13 - 23
- [33] An apriori-based algorithm for mining frequent substructures from graph data Lect. Notes Comput. Sci., (13-23):
- [35] Mining maximum frequent itemsets based on directed itemsets graph PROCEEDINGS OF 2004 CHINESE CONTROL AND DECISION CONFERENCE, 2004, : 681 - 683
- [36] Mining updated frequent itemsets based on directed itemsets graph Proceedings of 2004 Chinese Control and Decision Conference, 2004, : 690 - 693
- [37] A sliding window algorithm for mining frequent itemsets on data stream DCABES 2006 PROCEEDINGS, VOLS 1 AND 2, 2006, : 637 - 639
- [40] A Mining Frequent Itemsets Algorithm in Stream Data Based on Sliding Time Decay Window AIPR 2020: 2020 3RD INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND PATTERN RECOGNITION, 2020, : 18 - 24