Finding robust itemsets under subsampling

ACM Transactions on Database Systems

Volumn 39, Issue 3, 2014, Pages

  Tatti, Nikolaj ^a,b,c   Moerchen, Fabian ^d,g   Calders, Toon ^e,f  

^a AALTO UNIVERSITY   (Finland)

^b UNIVERSITY OF LEUVEN   (Belgium)

^c UNIVERSITY OF ANTWERP   (Belgium)

^d SIEMENS CORPORATE RESEARCH   (United States)

^e UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^f EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^g AMAZON   (United States)

Author keywords

Closed itemsets; Free itemsets; Non derivable itemsets; Pattern reduction; Robust itemsets; Totally shattered itemsets

Indexed keywords

CLOSED ITEMSETS; ITEM SETS; PATTERN REDUCTIONS;

EID: 84907931600     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/2656261     Document Type: Article

References (36)

1. R. Agrawal, T. Imielinski, and A. N. Swami. 1993. Mining association rules between sets of items in large databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'93). 207-216.
2. A. Asuncion and D. Newman. 2007. UCI machine learning repository, http://mlearn.ics.uci.edu/MLRepository.html.
3. J.-R Boulicaut, A. Bykowski, and C. Rigotti. 2000. Approximation of frequency queries by means of free-sets. In Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery (PKDD'00). 75-85.
4. J.-R Boulicaut, A. Bykowski, and C. Rigotti. 2003. Free-sets: A condensed representation of boolean data for the approximation of frequency queries. Data Mining Knowl. Discov. 7, 1, 5-22.
5. S. Brin, R. Motwani, and C. Silverstein. 1997. Beyond market baskets: Generalizing association rules to correlations. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'97). 265-276.
6. B. Bringmann and A. Zimmermann. 2009. One in a million: Picking the right patterns. Knowl. Inf. Syst. 18, 1, 61-81.
7. T. Calders and B. Goethals. 2007. Non-derivable itemset mining. Data Mining Knowl. Discov. 14, 1, 171-206.
8. T. Calders, B. Goethals, and M. Mampaey. 2007. Mining itemsets in the presence of missing values. In Proceedings of the ACM Symposium on Applied Computing (SAC'07). 404-408.
9. T. Calders, C. Rigotti, and J.-F. Boulicaut. 2006. A survey on condensed representations for frequent sets. In Proceedings of the European Conference on Constraint-Based Mining and Inductive Databases. 64-80.
10. H. Cheng, X. Yan, J. Han, and C. Hsu. 2007. Discriminative frequent pattern analysis for effective classification. In Proceedings of the 23rd IEEE International Conference on Data Engineering (ICDE'07). 716-725.
11. H. Cheng, P. S. Yu, and J. Han. 2006. AC-close: Efficiently mining approximate closed itemsets by core pattern recovery. In Proceedings of the 6th International Conference on Data Mining (ICDM'06). 839-844.
12. F. Coenen. 2003. The lucs-kdd discretised/normalised arm and carm data library, https://cgi.csc.liv.ac.uk/~frans/KDD/Software/LUCS-KDD-DN/OLDversion/lucs-kdd-DN.html.
13. T. de Bie. 2011. Maximum entropy models and subjective interestingness: An application to tiles in binary databases. Data Mining Knowl. Discov. 23, 3, 407-446.
14. A. Gallo, T. de Bie, andN. Cristianini. 2007. Mini: Mining informative non-redundant itemsets. In Proceedings of the 11th Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'07). 438-445.
15. F. Geerts, B. Goethals, and T. Mielikäinen. 2004. Tiling databases. In Discovery Science. Springer, 278-289.
16. G. Ghoshal and A.-L. Barabási. 2011. Ranking stability and super-stable nodes in complex networks. Nature Comm. 2.
17. A. Gionis, H. Marinila, T. Mielikäinen, and P. Tsaparas. 2007. Assessing data mining results via swap randomization. ACM Trans. Knowl. Discov. Data 1, 3.
18. B. Goethals and M. Zaki. 2003. FIMF03, frequent itemset mining implementations. In Proceedings of the 3rd International Conference on Data Ming Workshops on Frequent Itemset Mining Implementations (FIMI'03). 1-13.
19. R. Gupta, G. Fang, B. Field, M. Steinbach, and V. Kumar. 2008. Quantitative evaluation of approximate frequent pattern mining algorithms. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'08). 301-309.
20. S. Hanhijärvi, M. Ojala, N. Vuokko, K. Puolamäki, N. Tatti, and H. Mannila. 2009. Tell me something I don't know: Randomization strategies for iterative data mining. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'09). 379-388.
21. J. Hipp, U. Güntzer, and G. Nakhaeizadeh. 2000. Algorithms for association rule mining-A general survey and comparison. SIGKDD Explor. 2, 1, 58-64.
22. C. Lucchese, S. Orlando, and R. Perego. 2010. Mining top-k patterns from binary datasets in presence of noise. In Proceedings of the SIAM International Conference on Data Mining (SDM'10).
23. T. Mielikäinen. 2005. Transaction databases, frequent itemsets, and their condensed representations. In Proceedings of the 4th International Conference on Knowledge Discovery in Inductive Databases (KDID'05). 139-164.
24. G. Misra, B. Golshan, and E. Terzi. 2012. A framework for evaluating the smoothness of data-mining results. In Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases (ECMLIPKDD'12). 660-675.
25. F. Moerchen, M. Thies, and A. Ultsch. 2010. Efficient mining of all margin-closed itemsets with applications in temporal knowledge discovery and classification by compression. Knowl. Inf. Syst. 29, 1, 55-80.
26. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. 1999. Discovering frequent closed itemsets for association rules. In Proceedings of the 7th International Conference on Database Theory (ICDT99). 398-416.
27. J. Pei, J. Han, and L. V. S. Lakshmanan. 2001. Mining frequent itemsets with convertible constraints. In Proceedings of the International Conference on Data Engineering (ICDE'01). 433-442.
28. K. Smets and J. Vreeken. 2011. The odd one out: Identifying and characterising anomalies. In Proceedings of the SIAM International Conference on Data Mining (SDM'11).
29. N. Tatti. 2008. Maximum entropy based significance of itemsets. Knowl. Inf. Syst. 17, 1, 57-77.
30. N. Tatti and F Moerchen. 2011. Finding robust itemsets under subsampling. In Proceedings of the 11th IEEE International Conference on Data Mining (ICDM'11). 705-714.
31. T. Uno and H. Arimura. 2007. An efficient polynomial delay algorithm for pseudo frequent itemset mining. In Discovery Science. Springer, 219-230.
32. J. Vreeken, M. van Leeuwen, and A. Siebes. 2011. Krimp: Mining itemsets that compress. Data Mining Knowl. Discov. 23, 1, 169-214.
33. K. Wang, C. Xu, and B. Liu. 1999. Clustering transactions using large items. In Proceedings of the 11th International Conference on Information and Knowledge Management (CIKM'99). 483-490.
34. G. I. Webb. 2007. Discovering significant patterns. Mach. Learn. 68, 1, 1-33.
35. D. Xin, J. Han, X. Yan, and H. Cheng. 2005. Mining compressed frequent-pattern sets. In Proceedings of the 31st International Conference on Very Large Data Bases (VLDB'05). 709-720.
36. Y Zhao and G. Karypis. 2002. Evaluation of hierarchical clustering algorithms for document datasets. In Proceedings of the 11th International Conference on Information and Knowledge Management (CIKM'02). 515-524.