메뉴 건너뛰기




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

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

Author keywords

Frequent pattern mining; Lower bound

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS;

EID: 67649112027     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2009.05.002     Document Type: Article
Times cited : (7)

References (34)
  • 1
    • 0001882616 scopus 로고
    • Fast algorithms for mining association rules in large databases
    • Morgan Kaufmann, pp
    • 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.
    • (1994) Proc. 20th Internat. Conf. Very Large Data Bases , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 3
    • 0001677717 scopus 로고
    • Controlling the false discovery rate: A new and powerful approach to multiple testing
    • 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
    • (1995) J. Roy. Stat. Soc. B , vol.57 , pp. 289-300
    • Benjamini, Y.1    Hochberg, Y.2
  • 5
    • 33745790274 scopus 로고    scopus 로고
    • Graph mining: Laws, generators, and algorithms
    • Chakrabarti D., and Faloutsos C. Graph mining: Laws, generators, and algorithms. ACM Comput. Surv. 38 1 (2006)
    • (2006) ACM Comput. Surv. , vol.38 , Issue.1
    • Chakrabarti, D.1    Faloutsos, C.2
  • 6
    • 54249105070 scopus 로고    scopus 로고
    • An integrated, generic approach to pattern mining: Data mining template library
    • 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
    • (2008) Data Min. Knowledge Disc. , vol.17 , Issue.3 , pp. 457-495
    • Chaoji, V.1    Hasan, M.A.2    Salem, S.3    Zaki, M.J.4
  • 7
    • 24044517207 scopus 로고    scopus 로고
    • Frequent subtree mining: An overview
    • Chi Y., Muntz R.R., Nijssen S., and Kok J.N. Frequent subtree mining: An overview. Fundam. Inform. 66 1-2 (2005) 161-198
    • (2005) Fundam. Inform. , vol.66 , Issue.1-2 , pp. 161-198
    • Chi, Y.1    Muntz, R.R.2    Nijssen, S.3    Kok, J.N.4
  • 8
    • 0036565016 scopus 로고    scopus 로고
    • Mining sequential patterns with regular expression constraints
    • Garofalakis M., Rastogi R., and Shim K. Mining sequential patterns with regular expression constraints. IEEE Trans. Knowledge Data Eng. 14 3 (2002) 530-552
    • (2002) IEEE Trans. Knowledge Data Eng. , vol.14 , Issue.3 , pp. 530-552
    • Garofalakis, M.1    Rastogi, R.2    Shim, K.3
  • 10
    • 33746689579 scopus 로고    scopus 로고
    • Link mining: A survey
    • Getoor L., and Diehl C.P. Link mining: A survey. SIGKDD Explor. 7 2 (2005) 3-12
    • (2005) SIGKDD Explor. , vol.7 , Issue.2 , pp. 3-12
    • Getoor, L.1    Diehl, C.P.2
  • 12
    • 27544478009 scopus 로고    scopus 로고
    • Advances in frequent itemset mining implementations: Report on fimi'03
    • Goethals B., and Zaki M.J. Advances in frequent itemset mining implementations: Report on fimi'03. SIGKDD Explor. 6 1 (2004) 109-117
    • (2004) SIGKDD Explor. , vol.6 , Issue.1 , pp. 109-117
    • Goethals, B.1    Zaki, M.J.2
  • 14
    • 34547335088 scopus 로고    scopus 로고
    • Frequent pattern mining: Current status and future directions
    • 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
    • (2007) Data Min. Knowledge Disc. , vol.15 , Issue.1 , pp. 55-86
    • Han, J.1    Cheng, H.2    Xin, D.3    Yan, X.4
  • 15
    • 6344230921 scopus 로고    scopus 로고
    • Using finite state automata for sequence mining
    • Australian Computer Society, Inc, pp
    • 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.
    • (2002) Proc. 25th Australasian Conf. on Computer Science , pp. 105-110
    • Hingston, P.1
  • 16
    • 48349139682 scopus 로고    scopus 로고
    • Finding reliable subgraphs from large probabilistic graphs
    • Hintsanen P., and Toivonen H. Finding reliable subgraphs from large probabilistic graphs. Data Min. Knowledge Disc. 17 1 (2008) 3-23
    • (2008) Data Min. Knowledge Disc. , vol.17 , Issue.1 , pp. 3-23
    • Hintsanen, P.1    Toivonen, H.2
  • 17
    • 0002294347 scopus 로고
    • A simple sequentially rejective multiple test procedure
    • Holm S. A simple sequentially rejective multiple test procedure. Scand. J. Stat. 6 (1979) 65-70
    • (1979) Scand. J. Stat. , vol.6 , pp. 65-70
    • Holm, S.1
  • 18
    • 67549083110 scopus 로고    scopus 로고
    • Mining frequent cross-graph quasi-cliques
    • Jiang D., and Pei J. Mining frequent cross-graph quasi-cliques. ACM Trans. Knowledge Disc. Data 2 4 (2009) 1-42
    • (2009) ACM Trans. Knowledge Disc. Data , vol.2 , Issue.4 , pp. 1-42
    • Jiang, D.1    Pei, J.2
  • 19
    • 33751009408 scopus 로고    scopus 로고
    • Mining evolving data streams for frequent patterns
    • 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
    • (2007) Pattern Recogn. , vol.40 , Issue.2 , pp. 492-503
    • Laur, P.-A.1    Nock, R.2    Symphor, J.-E.3    Poncelet, P.4
  • 20
    • 41849109500 scopus 로고    scopus 로고
    • Statistical supports for mining sequential patterns and improving the incremental update process on data streams
    • 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
    • (2007) Intell. Data Anal. , vol.11 , Issue.1 , pp. 29-47
    • Laur, P.-A.1    Symphor, J.-E.2    Nock, R.3    Poncelet, P.4
  • 21
    • 22444451988 scopus 로고    scopus 로고
    • Is sampling useful in data mining? A case in the maintenance of discovered association rules
    • 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
    • (1998) Data Min. Knowledge Disc. , vol.2 , Issue.3 , pp. 233-262
    • Lee, S.D.1    Cheung, D.W.2    Kao, B.3
  • 22
    • 0001280495 scopus 로고
    • Efficient Algorithms for Discovering Association Rules
    • Mannila, H., Toivonen, H., Verkamo, A.I., 1994. Efficient Algorithms for Discovering Association Rules. In: KDD Workshop, pp. 181-192.
    • (1994) KDD Workshop , pp. 181-192
    • Mannila, H.1    Toivonen, H.2    Verkamo, A.I.3
  • 26
    • 49749146362 scopus 로고    scopus 로고
    • Sampling for sequential pattern mining: From static databases to data streams
    • Raissi C., and Poncelet P. Sampling for sequential pattern mining: From static databases to data streams. IEEE Internat. Conf. Data Min. (2007) 631-636
    • (2007) IEEE Internat. Conf. Data Min. , pp. 631-636
    • Raissi, C.1    Poncelet, P.2
  • 27
    • 0000078758 scopus 로고
    • Implicit learning of artificial grammars
    • Reber A.S. Implicit learning of artificial grammars. J. Verb. Learn. Verb. Behav. 6 (1967) 855-863
    • (1967) J. Verb. Learn. Verb. Behav. , vol.6 , pp. 855-863
    • Reber, A.S.1
  • 28
    • 11944262819 scopus 로고
    • Multiple hypothesis-testing
    • Shaffer J.P. Multiple hypothesis-testing. Annu. Rev. Psychol. 46 (1995) 561-584
    • (1995) Annu. Rev. Psychol. , vol.46 , pp. 561-584
    • Shaffer, J.P.1
  • 30
  • 31
    • 34249653461 scopus 로고    scopus 로고
    • Discovering significant patterns
    • Webb G.I. Discovering significant patterns. Machine Learn. 68 1 (2007) 1-33
    • (2007) Machine Learn. , vol.68 , Issue.1 , pp. 1-33
    • Webb, G.I.1
  • 32
  • 33
    • 24044516553 scopus 로고    scopus 로고
    • Efficiently mining frequent embedded unordered trees
    • Zaki M.J. Efficiently mining frequent embedded unordered trees. Fundam. Inform. 66 1-2 (2005) 33-52
    • (2005) Fundam. Inform. , vol.66 , Issue.1-2 , pp. 33-52
    • Zaki, M.J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.