Direct local pattern sampling by efficient two-step random procedures

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

Volumn , Issue , 2011, Pages 582-590

  Boley, Mario ^a   Lucchese, Claudio ^b   Paurat, Daniel ^a   Gärtner, Thomas ^a  

^a UNIVERSITY OF BONN   (Germany)

^b ISTI CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING;

DIRECT METHOD; FREQUENT SET MINING; ITEMSET; LOCAL PATTERNS; OPTIMAL TIME COMPLEXITY; OPTIMISTICS; PATTERN DISCOVERY; PATTERN SAMPLINGS; SAMPLING ALGORITHM; SUBGROUP DISCOVERY;

LEARNING ALGORITHMS;

EID: 80052653056     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2020408.2020500     Document Type: Conference Paper

References (28)

1. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In Advances in Knowl. Disc. and Data Min., pp. 307-328. 1996.
2. M. Al Hasan and M. J. Zaki. Output space sampling for graph patterns. PVLDB, 2(1):730-741, 2009.
3. S. D. Bay and M. J. Pazzani. Detecting group differences: Mining contrast sets. Data Min. Knowl. Discov., 5(3):213-246, 2001.
4. R. Bayardo, B. Goethals, and M. J. Zaki, editors. Proc. IEEE ICDM Workshop on Frequent Itemset Mining Implementations, 2004, vol. 126 of CEUR Workshop Proc..
5. S. Bistarelli and F. Bonchi. Soft constraint based pattern mining. Data and Knowl. Engineering, 62(1):118-137, 2007. (Pubitemid 46603196)
6. M. Boley, T. Gärtner, and H. Grosskreutz. Formal concept sampling for counting and threshold-free local pattern mining. In Proc. SIAM Int. Conf. on Data Mining (SDM 2010), pp. 177-188, 2010.
7. M. Boley and H. Grosskreutz. Approximating the number of frequent sets in dense data. Knowl. Inf. Syst., 21(1):65-89, 2009.
8. V. Chaoji, M. A. Hasan, S. Salem, J. Besson, and M. J. Zaki. Origami: A novel and e-ective approach for mining representative orthogonal graph patterns. Stat. Anal. Data Min., 1(2):67-84, 2008.
9. H. Cheng, X. Yan, J. Han, and C.-W. Hsu. Discriminative frequent pattern analysis for effective classification. In Proc. 23rd Int. Conf. on Data Engineering (ICDE 2007), pp. 716-725, 2007. (Pubitemid 47422075)
10. H. Cheng, X. Yan, J. Han, and P. S. Yu. Direct discriminative pattern mining for effective classification. In Proc. 24th Int. Conf. on Data Engineering (ICDE 2008), pp. 169-178, 2008.
11. J. Demsar. Statistical comparisons of classifiers over multiple data sets. J. of Mach. Learn. Res., 7:1-30, 2006. (Pubitemid 43022939)
12. G. Dong and J. Li. Effcient mining of emerging patterns: Discovering trends and differences. In Proc. 5th ACM SIGKDD Int. Conf. on Knowl. Disc. and Data Mining (KDD'99), pp. 43-52. ACM, 1999.
13. W. Fan, K. Zhang, H. Cheng, J. Gao, X. Yan, J. Han, P. S. Yu, and O. Verscheure. Direct mining of discriminative and essential frequent patterns via model-based search tree. In Proc. 14th Int. Conf. on Knowl. Disc. and Data Mining (KDD'08), pp. 230-238, 2008.
14. A. Frank and A. Asuncion. UCI machine learning repository, 2010.
15. F. Geerts, B. Goethals, and T. Mielikäinen. Tiling databases. In Proc. 7th Int. Disc. Science Conf., vol. 3245 of LNCS, pp. 278-289. Springer, 2004. (Pubitemid 39745469)
16. L. A. Goldberg. Effcient algorithms for listing combinatorial structures. Cambridge University Press, New York, NY, USA, 1993.
17. H. Grosskreutz, S. Rüping, and S. Wrobel. Tight optimistic estimates for fast subgroup discovery. In Proc. European Conf. on Machine Learning and Knowl. Disc. in Databases (ECML/PKDD 2008), Part I, vol. 5211 of LNCS, pp. 440-456, 2008.
18. D. Gunopulos, H. Mannila, and S. Saluja. Discovering all most specific sentences by randomized algorithms. In Proc. 6th Int. Conf. of Database Theory (ICDT'97), vol. 1186 of LNCS, pp. 215-229, 1997. (Pubitemid 127013755)
19. J. Han, J. Pei, Y. Yin, and R. Mao. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min. Knowl. Discov., 8(1):53-87, 2004. (Pubitemid 39019971)
20. D. J. Hand. Pattern detection and discovery. In Proc. ESF Workshop on Pattern Detection and Disc., vol. 2447 of LNCS, pp. 1-12. Springer, 2002.
21. R. M. Karp, M. Luby, and N. Madras. Monte-carlo approximation algorithms for enumeration problems. J. Algorithms, 10(3):429-448, 1989.
22. A. J. Knobbe, B. Crémilleux, J. Furnkranz, and M. Scholz. From local patterns to global models: the lego approach to data mining. In From Local Patterns to Global Models: Proc. ECML/PKDD 2008 Workshop (LEGO'08), 2008.
23. S. Morishita and J. Sese. Traversing itemset lattice with statistical metric pruning. In Proc. 19th ACM SIGMOD-SIGACT-SIGART Symp. on Principles of Database Systems (PODS), pp. 226-236, 2000.
24. A. Pietracaprina and F. Vandin. Effcient incremental mining of top-k frequent closed itemsets. In Proc. 10th Int. Disc. Science Conf. (DS 2007), pp. 275-280, 2007.
25. T. Scheffer and S. Wrobel. Finding the most interesting patterns in a database quickly by using sequential sampling. J. of Mach. Learn. Res., 3:833-862, 2002.
26. T. Uno, T. Asai, Y. Uchida, and H. Arimura. An effcient algorithm for enumerating closed patterns in transaction databases. In Proc. 7th Int. Disc. Science Conf. (DS 2004), vol. 3245 of LNCS, pp. 16-31. Springer, 2004. (Pubitemid 39745449)
27. S. Wrobel. An algorithm for multi-relational discovery of subgroups. In Proc. 1st Euro. Symp. on Principles of Data Mining and Knowl. Disc. (PKDD'97), vol. 1263 of LNCS, pp. 78-87. Springer, 1997. (Pubitemid 127097494)
28. M. J. Zaki, S. Parthasarathy, W. Li, and M. Ogihara. Evaluation of sampling for data mining of association rules. In Proc. 7th Workshop on Research Issues in Data Engineering (RIDE), 1997.