共 50 条
- [21] Recent Weighted Maximal Frequent Itemsets Mining [J]. 2017 INTERNATIONAL CONFERENCE ON I-SMAC (IOT IN SOCIAL, MOBILE, ANALYTICS AND CLOUD) (I-SMAC), 2017, : 391 - 397
- [22] Maintenance of Maximal Frequent Itemsets in Large Databases [J]. APPLIED COMPUTING 2007, VOL 1 AND 2, 2007, : 388 - 392
- [23] An efficient approach based on selective partitioning for maximal frequent itemsets mining [J]. SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2019, 44 (08):
- [24] Efficiently Mining Maximal Diverse Frequent Itemsets [J]. DATABASE SYSTEMS FOR ADVANCED APPLICATIONS (DASFAA 2019), PT II, 2019, 11447 : 191 - 207
- [25] An efficient approach based on selective partitioning for maximal frequent itemsets mining [J]. Sādhanā, 2019, 44
- [26] A New Method for Mining Maximal Frequent Itemsets based on Graph Theory [J]. 2014 4TH INTERNATIONAL CONFERENCE ON COMPUTER AND KNOWLEDGE ENGINEERING (ICCKE), 2014, : 183 - 188
- [28] Fast mining maximal frequent itemsets; Based on FP-tree [J]. CONCEPTUAL MODELING - ER 2004, PROCEEDINGS, 2004, 3288 : 348 - 361
- [29] Document clustering based on maximal frequent sequences [J]. ADVANCES IN NATURAL LANGUAGE PROCESSING, PROCEEDINGS, 2006, 4139 : 257 - 267
- [30] Hierarchical document clustering using frequent itemsets [J]. PROCEEDINGS OF THE THIRD SIAM INTERNATIONAL CONFERENCE ON DATA MINING, 2003, : 59 - 70