Frequent regular itemset mining

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2010, Pages 263-272

  Ruggieri, Salvatore ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Closed and free itemsets; Concise representations

Indexed keywords

CLOSED ITEMSETS; CONCISE REPRESENTATIONS; DATA ANALYSTS; DATA SETS; FREQUENT ITEMSETS; INTERPRETABILITY; ITEM SETS; ITEMSET; ITEMSET MINING;

EQUIVALENCE CLASSES;

EID: 77956192691     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835804.1835840     Document Type: Conference Paper

References (22)

1. R. Agrawal and R. Srikant. Quest synthetic data generator. http://www.almaden.ibm.com/cs/projects/iis/hdb/Projects/data-mining/datasets/ -syndata.html.
2. Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal. Mining frequent patterns with counting inference. SIGKDD Explorations, 2(2):66-75, 2000.
3. C. Borgelt. An implementation of the FP-growth algorithm. In Proc. of OSDM 2005, pages 1-5. ACM, 2005.
4. J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Free-sets: A condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery, 7(1):5-22, 2003.
5. A. Bykowski and C. Rigotti. DBC: A condensed representation of frequent patterns for efficient mining. Information Systems, 28(8):949-977, 2003.
6. T. Calders and B. Goethals. Non-derivable itemset mining. Data Mining & Knowledge Discovery, 14(1):171-206, 2007.
7. T. Calders, C. Rigotti, and J.-F. Boulicaut. A survey on condensed representations for frequent sets. In Constraint-Based Mining and Inductive Databases, volume 3848 of LNCS, pages 64-80. Springer, 2004.
8. G. Dong, C. Jiang, J. Pei, J. Li, and L. Wong. Mining succinct systems of minimal generators of formal concepts. In Proc. of DASFAA 2005, volume 3453 of LNCS, pages 175-187. Springer, 2005.
9. J. Galambos and I. Simonelli. Bonferroni-type Inequalities with Applications. Springer, 1996.
10. B. Goethals. Frequent Itemset Mining Implementations Repository. http://fimi.cs.helsinki.fi.
11. T. Hamrouni, S. B. Yahia, and E. M. Nguifo. Succinct minimal generators: Theoretical foundations and applications. Int. J. Foundations of Computer Science, 19(2):271-296, 2008.
12. T. Hamrouni, S. B. Yahia, and E. M. Nguifo. Sweeping the disjunctive search space towards mining new exact concise representations of frequent itemsets. Data & Knowledge Engineering, 68(10):1091-1111, 2009.
13. M. Kryszkiewicz, H. Rybinski, and K. Cichon. On concise representations of frequent patterns admitting negation. In Advances in Machine Learning II, pages 259-289. Springer, 2010.
14. G. Liu, J. Li, L. Wong, and W. Hsu. Positive borders or negative borders: How to make lossless generator based representations concise. In Proc. of SIAM Data Mining 2006. SIAM, 2006.
15. H. Mannila and H. Toivonen. Multiple uses of frequent sets and condensed representations. In Proc. of KDD 1996, pages 189-194. AAAI Press, 1996.
16. J. Muhonen and H. Toivonen. Closed non-derivable itemsets. In Proc. of PKDD 2006, volume 4213 of LNCS, pages 601-608. Springer, 2006.
17. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In Proc. of ICDT 1999, volume 1540 of LNCS, pages 398-416. Springer, 1999.
18. N. Pasquier, R. Taouil, Y. Bastide, G. Stumme, and L. Lakhal. Generating a condensed representation for association rules. Journal of Intelligent Information Systems, 24(1):29-60, 2005.
19. A. Soulet and B. Crémilleux. Adequate condensed representations of patterns. Data Mining & Knowledge Discovery, 17(1):94-110, 2008.
20. S. B. Yahia, T. Hamrouni, and E. M. Nguifo. Frequent closed itemset based algorithms: A thorough structural and analytical survey. SIGKDD Explorations, 8(1):93-104, 2006.
21. M. J. Zaki. Mining non-redundant association rules. Data Mining & Knowledge Discovery, 9(3):223-248, 2004.
22. M. J. Zaki and C.-J. Hsiao. Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans. on Knowledge and Data Engineering, 17(4):462-478, 2005.