Formal concept sampling for counting and threshold-free local pattern mining

Proceedings of the 10th SIAM International Conference on Data Mining, SDM 2010

Volumn , Issue , 2010, Pages 177-188

  Boley, Mario ^a   Gärtner, Thomas ^a   Grosskreutz, Henrik ^a  

^a FRAUNHOFER IAIS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL CONCEPT ANALYSIS;

DATA MINING SYSTEM; FORMAL CONCEPTS; LOCAL PATTERNS; METROPOLIS-HASTINGS ALGORITHM; NON-REDUNDANT; RUNTIMES;

DATA MINING;

EID: 80052655684     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972801.16     Document Type: Conference Paper

References (27)

1. Foto N. Afrati, Aristides Gionis, and Heikki Mannila. Approximating a collection of frequent sets. In KDD, pages 12-19. ACM, 2004.
2. A. Asuncion and D.J. Newman. UCI machine learning repository, 2007.
3. Yves Bastide, Nicolas Pasquier, Rafik Taouil, Gerd Stumme, and Lotfi Lakhal. Mining minimal non-redundant association rules using frequent closed item-sets. In Computational Logic - CL 2000, pages 972-986. Springer, 2000.
4. Stephen D. Bay and Michael J. Pazzani. Detecting group differences: Mining contrast sets. Data Min. Knowl. Discov., 5(3):213-246, 2001.
5. Mario Boley and Henrik Grosskreutz. A randomized approach for approximating the number of frequent sets. In ICDM, pages 43-52. IEEE Computer Society, 2008.
6. Mario Boley and Henrik Grosskreutz. Non-redundant subgroup discovery using a closure system. In ECML/PKDD (2), pages 179-194. Springer, 2009.
7. Richard Chow, Philippe Golle, and Jessica Staddon. Detecting privacy leaks using corpus-based association rules. In KDD 2008, pages 893-901. ACM, 2008.
8. Martin Dyer, Leslie Ann Goldberg, Catherine Green-hill, and Mark Jerrum. The relative complexity of approximate counting problems. Algorithmica, 38(3):471-500, 2004.
9. Bernhard Ganter and Rudolf Wille. Formal Concept Analysis: Mathematical Foundations. Springer Verlag, 1999.
10. Gemma C. Garriga, Petra Kralj, and Nada Lavrač. Closed sets for labeled data. J. Mach. Learn. Res., 9:559-580, 2008.
11. Floris Geerts, Bart Goethals, and Taneli Mielikäinen. Tiling databases. In DS, pages 278-289, 2004.
12. David Hand. Pattern detection and discovery. In Pattern Detection and Discovery, Volume 2447 of LNAI, pages 1-12. Springer, 2002.
13. Mohammad Al Hasan, Vineet Chaoji, Saeed Salem, Jérémy Besson, and Mohammed Javeed Zaki. Origami: Mining representative orthogonal graph patterns. In ICDM, pages 153-162. IEEE Computer Society, 2007.
14. Mohammad Al Hasan and Mohammed Javeed Zaki. Musk: Uniform sampling of k maximal patterns. In SDM, pages 650-661. SIAM, 2009.
15. W. K. Hastings. Monte carlo sampling methods using markov chains and their applications. Biometrika, 57(1):97-109, 1970.
16. Mark Huber. Perfect simulation with exponential tails on the running time. Random Struct. Alg., 33(1):29-43, 2008.
17. Mark Jerrum and Alistair Sinclair. The Markov chain Monte Carlo method: an approach to approximate counting and integration, pages 482-520. PWS Publishing Co., Boston, MA, USA, 1997.
18. A. Knobbe, B. Crémilleux, J. Fürnkranz, and M. Scholz. From local patterns to global models: the lego approach to data mining. In Proc. of the ECML PKDD 2008 LEGO Workshop, 2008.
19. Matthew V. Mahoney and Philip K. Chan. Learning rules for anomaly detection of hostile network traffic. In ICDM, page 601, Washington, DC, USA, 2003. IEEE Computer Society.
20. Shinichi Morishita and Jun Sese. Traversing itemset lattice with statistical metric pruning. In PODS, pages 226-236. ACM, 2000.
21. Nicolas Pasquier, Rafik Taouil, Yves Bastide, Gerd Stumme, and Lotfi Lakhal. Generating a condensed representation for association rules. Journal of Intelligent Information Systems, 24(1):29-60, January 2005.
22. Dana Randall. Rapidly mixing markov chains with applications in computer science and physics. Computing in Science and Engineering, 8(2):30-41, 2006.
23. Leander Schietgat, Fabrizio Costa, Jan Ramon, and Luc De Raedt. Maximum common subgraph mining: A fast and effective approach towards feature generation. In MLG, 2009.
24. J. Wang, J. Han, Y. Lu, and P. Tzvetkov. Tfp: an efficient algorithm for mining top-k frequent closed itemsets. Knowledge and Data Engineering, IEEE Transactions on, 17(5):652-663, May 2005.
25. Lusheng Wang, Hao Zhao, Guozhu Dong, and Jianping Li. On the complexity of finding emerging patterns. Theoretical Computer Science, 335(1):15-27, 2005.
26. Dong Xin, Jiawei Han, Xifeng Yan, and Hong Cheng. Mining compressed frequent-pattern sets. In VLDB, pages 709-720. VLDB Endowment, 2005.
27. Xifeng Yan, Hong Cheng, Jiawei Han, and Philip S. Yu. Mining significant graph patterns by leap search. In SIGMOD, pages 433-444. ACM, 2008.