A lower bound on the sample size needed to perform a significant frequent pattern mining task

Pattern Recognition Letters

Volumn 30, Issue 11, 2009, Pages 960-967

  Jacquemont, Stéphanie ^a   Jacquenet, François ^a   Sebban, Marc ^a  

^a UNIVERSITÉ JEAN MONNET   (France)

Author keywords

Frequent pattern mining; Lower bound

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS;

CHERNOFF BOUNDS; DATA SET SIZE; FREQUENT PATTERN MINING; INDEPENDENT CONTROL; LOWER BOUNDS; SAMPLING-BASED METHOD; STATISTICAL SIGNIFICANCE; UNDERLYING DISTRIBUTION;

DATA MINING;

EID: 67649112027     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2009.05.002     Document Type: Article

References (34)

1. Agrawal, R., Srikant, R., 1994. Fast algorithms for mining association rules in large databases. In: Proc. 20th Internat. Conf. Very Large Data Bases. Morgan Kaufmann, pp. 487-499.
2. Ayres, J., Flannick, J., Gehrke, J., Yiu, T., 2002. Sequential pattern mining using a bitmap representation. In: Proc. 8th Internat. Conf. on Knowledge Discovery and Data Mining. ACM Press, pp. 429-435.
3. Benjamini Y., and Hochberg Y. Controlling the false discovery rate: A new and powerful approach to multiple testing. J. Roy. Stat. Soc. B 57 (1995) 289-300
4. Ceglar A., and Roddick J.F. Association mining. ACM Comput. Surv. 38 2 (2006)
5. Chakrabarti D., and Faloutsos C. Graph mining: Laws, generators, and algorithms. ACM Comput. Surv. 38 1 (2006)
6. Chaoji V., Hasan M.A., Salem S., and Zaki M.J. An integrated, generic approach to pattern mining: Data mining template library. Data Min. Knowledge Disc. 17 3 (2008) 457-495
7. Chi Y., Muntz R.R., Nijssen S., and Kok J.N. Frequent subtree mining: An overview. Fundam. Inform. 66 1-2 (2005) 161-198
8. Garofalakis M., Rastogi R., and Shim K. Mining sequential patterns with regular expression constraints. IEEE Trans. Knowledge Data Eng. 14 3 (2002) 530-552
9. Gavin G., Gelly S., Guermeur Y., Lallich S., Mary J., Sebag M., and Teytaud O. Type 1 and type 2 errors for multiple simultaneous hypothesis testing. PASCAL Theor. Challenge (2007) 29-47.
10. Getoor L., and Diehl C.P. Link mining: A survey. SIGKDD Explor. 7 2 (2005) 3-12
11. Gionis A., Mannila H., Mielikäinen T., and Tsaparas P. Assessing data mining results via swap randomization. Trans. Knowledge Disc. Data 1 3 (2007)
12. Goethals B., and Zaki M.J. Advances in frequent itemset mining implementations: Report on fimi'03. SIGKDD Explor. 6 1 (2004) 109-117
13. Han J., Altman R.B., Kumar V., Mannila H., and Pregibon D. Emerging scientific applications in data mining. Commun. ACM 45 8 (2002) 54-58
14. Han J., Cheng H., Xin D., and Yan X. Frequent pattern mining: Current status and future directions. Data Min. Knowledge Disc. 15 1 (2007) 55-86
15. Hingston, P., 2002. Using finite state automata for sequence mining. In: Proc. 25th Australasian Conf. on Computer Science. Australian Computer Society, Inc., pp. 105-110.
16. Hintsanen P., and Toivonen H. Finding reliable subgraphs from large probabilistic graphs. Data Min. Knowledge Disc. 17 1 (2008) 3-23
17. Holm S. A simple sequentially rejective multiple test procedure. Scand. J. Stat. 6 (1979) 65-70
18. Jiang D., and Pei J. Mining frequent cross-graph quasi-cliques. ACM Trans. Knowledge Disc. Data 2 4 (2009) 1-42
19. Laur P.-A., Nock R., Symphor J.-E., and Poncelet P. Mining evolving data streams for frequent patterns. Pattern Recogn. 40 2 (2007) 492-503
20. Laur P.-A., Symphor J.-E., Nock R., and Poncelet P. Statistical supports for mining sequential patterns and improving the incremental update process on data streams. Intell. Data Anal. 11 1 (2007) 29-47
21. Lee S.D., Cheung D.W., and Kao B. Is sampling useful in data mining? A case in the maintenance of discovered association rules. Data Min. Knowledge Disc. 2 3 (1998) 233-262
22. Mannila, H., Toivonen, H., Verkamo, A.I., 1994. Efficient Algorithms for Discovering Association Rules. In: KDD Workshop, pp. 181-192.
23. Mannila H., Toivonen H., and Verkamo A.I. Discovery of frequent episodes in event sequences. Data Min. Knowledge Disc. 1 3 (1997) 259-289
24. Megiddo, N., Srikant, R. 1998. Discovering predictive association rules. In: Proc. the 4th Internat. Conf. on Knowledge Discovery and Data Mining, pp. 274-278.
25. Pei, J., Han, J., Wang, W., 2002. Mining sequential patterns with constraints in large databases. In: Proc. 11th Internat. Conf. on Information and Knowledge Management, ACM Press, pp. 18-25.
26. Raissi C., and Poncelet P. Sampling for sequential pattern mining: From static databases to data streams. IEEE Internat. Conf. Data Min. (2007) 631-636
27. Reber A.S. Implicit learning of artificial grammars. J. Verb. Learn. Verb. Behav. 6 (1967) 855-863
28. Shaffer J.P. Multiple hypothesis-testing. Annu. Rev. Psychol. 46 (1995) 561-584
29. Termier A., Rousset M.-C., Sebag M., Ohara K., Washio T., and Motoda H. Dryadeparent, an efficient and robust closed attribute tree mining algorithm. IEEE Trans. Knowledge Data Eng. 20 3 (2008) 300-320
30. Toivonen, H., 1996. Sampling large databases for association rules. In: Proc. 22th Internat. Conf. on Very Large Data Bases. Morgan Kaufmann, pp. 134-145.
31. Webb G.I. Discovering significant patterns. Machine Learn. 68 1 (2007) 1-33
32. Zaki, M., 2000. Sequence mining in categorical domains: Incorporating constraints. In: Proc. 9th Internat Conf. on Information and Knowledge Management, ACM Press, 2000, pp. 422-429.
33. Zaki M.J. Efficiently mining frequent embedded unordered trees. Fundam. Inform. 66 1-2 (2005) 33-52
34. Zaki, M., Parthasarathy, S., Li, W., Ogihara, M., 1997. Evaluation of sampling for data mining of association rules. In: 7th Internat. Workshop Research Issues in Data Engineering. pp. 42-50.