Linear space direct pattern sampling using coupling from the past

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

Volumn , Issue , 2012, Pages 69-77

  Boley, Mario ^a   Moens, Sandy ^b   Gärtner, Thomas ^a  

^a UNIVERSITY OF BONN   (Germany)

^b UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

cftp; frequent sets; local patterns; sampling

Indexed keywords

CFTP; COUPLING FROM THE PAST; DATA SETS; FREQUENT SETS; LINEAR SPACES; LOCAL PATTERNS; MEMORY BOTTLENECK; MEMORY REQUIREMENTS; PATTERN COLLECTIONS; PATTERN SPACE; POLYNOMIAL-TIME; PREPROCESSING PHASE; REAL-WORLD DATASETS; SAMPLING METHOD; SAMPLING PROCEDURES;

POLYNOMIAL APPROXIMATION; SAMPLING;

DATA MINING;

EID: 84866041251     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339545     Document Type: Conference Paper

References (19)

1. M. Al Hasan and M. J. Zaki. Output space sampling for graph patterns. PVLDB, 2(1):730-741, 2009.
2. R. Bayardo, B. Goethals, and M. J. Zaki, editors. IEEE ICDM Workshop on Frequent Itemset Mining Implementations, 2004, volume 126 of CEUR Workshop Proceedings. CEUR-WS.org, 2004.
3. M. Boley, T. Gärtner, and H. Grosskreutz. Formal concept sampling for counting and threshold-free local pattern mining. In SDM, pages 177-188, 2010.
4. M. Boley, C. Lucchese, D. Paurat, and T. Gärtner. Direct local pattern sampling by efficient two-step random procedures. In KDD, pages 582-590, 2011.
5. V. Chaoji, M. A. Hasan, S. Salem, J. Besson, and M. J. Zaki. Origami: A novel and effective approach for mining representative orthogonal graph patterns. Stat. Anal. and Data Min., 1(2):67-84, 2008.
6. H. Cheng, X. Yan, J. Han, and C.-W. Hsu. Discriminative frequent pattern analysis for effective classification. In ICDE, pages 716-725, 2007.
7. G. Dong and J. Li. Efficient mining of emerging patterns: Discovering trends and differences. In KDD, pages 43-52. ACM, 1999.
8. A. Frank and A. Asuncion. UCI machine learning repository, 2010.
9. F. Geerts, B. Goethals, and T. Mielikäinen. Tiling databases. In DS, pages 278-289. Springer, 2004.
10. H. Grosskreutz, S. Rüping, and S. Wrobel. Tight optimistic estimates for fast subgroup discovery. In ECML/PKDD, Part I, pages 440-456, 2008.
11. D. J. Hand. Pattern detection and discovery. In ESF Exploratory Workshop on Pattern Detection and Discovery, pages 1-12. Springer, 2002.
12. W. Hastings. Monte carlo sampling methods using markov chains and their applications. Biometrika, 57(1):97-109, 1970.
13. M. Huber. Perfect sampling using bounding chains. Annals of App. Prob., 14(2):734-753, 2004.
14. A. J. Knobbe, B. Crémilleux, J. Fürnkranz, and M. Scholz. From local patterns to global models: the lego approach to data mining. In From Local Patterns to Global Models: Proceedings of the ECML/PKDD 2008 Workshop, 2008.
15. A. Mitchell-Jones. The Atlas of European Mammals. Poyser Natural History. T & AD Poyser.
16. S. Morishita and J. Sese. Traversing itemset lattice with statistical metric pruning. In PODS, pages 226-236, 2000.
17. A. Pietracaprina and F. Vandin. Efficient incremental mining of top-k frequent closed itemsets. In DS, pages 275-280, 2007.
18. J. G. Propp and D. B. Wilson. Exact sampling with coupled markov chains and applications to statistical mechanics. Rand. Struct. Alg., 9(1-2):223-252, 1996.
19. J. Vreeken, M. van Leeuwen, and A. Siebes. Krimp: mining itemsets that compress. Data Min. Knowl. Discov., 23(1):169-214, 2011.