메뉴 건너뛰기




Volumn 2838, Issue , 2003, Pages 23-34

Efficient statistical pruning of association rules

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL METHODS; DATA MINING; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; REDUNDANCY; SET THEORY; STATISTICAL METHODS; ASSOCIATION RULES; DATABASE SYSTEMS; HEURISTIC ALGORITHMS;

EID: 9444290798     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-39804-2_5     Document Type: Conference Paper
Times cited : (3)

References (21)
  • 3
    • 0001677717 scopus 로고
    • Controlling the false discovery rate: A practical and powerful approach to multiple testing
    • Y. Benjamini and Y. Hochberg. Controlling the false discovery rate: a practical and powerful approach to multiple testing. Journal of the Royal Statistical Society, Series B, 57(1):389-300, 1995.
    • (1995) Journal of the Royal Statistical Society, Series B , vol.57 , Issue.1 , pp. 389-1300
    • Benjamini, Y.1    Hochberg, Y.2
  • 7
    • 0003113325 scopus 로고
    • Finding interesting rules from large sets of discovered association rules
    • M. Klemettinen et al. Finding interesting rules from large sets of discovered association rules. In CIKM 1994), pages 401-407, 1994.
    • (1994) CIKM 1994 , pp. 401-407
    • Klemettinen, M.1
  • 8
    • 84867817851 scopus 로고    scopus 로고
    • Mining minimal non-redundant association rules using frequent closed itemsets
    • Y Bastide et al. Mining minimal non-redundant association rules using frequent closed itemsets. Lecture Notes in Computer Science, 1861:972, 2000.
    • (2000) Lecture Notes in Computer Science , vol.1861 , pp. 972
    • Bastide, Y.1
  • 9
    • 78149351437 scopus 로고    scopus 로고
    • Efficiently mining maximal frequent itemsets
    • K. Gouda and M.J. Zaki. Efficiently mining maximal frequent itemsets. In ICDM, pages 163-170, 2001.
    • (2001) ICDM , pp. 163-170
    • Gouda, K.1    Zaki, M.J.2
  • 14
    • 0142191637 scopus 로고    scopus 로고
    • Pruning and summarizing the discovered associations
    • Bing Liu, Wynne Hsu, and Yiming Ma. Pruning and summarizing the discovered associations. In Knowledge Discovery and Data Mining, pages 125-134, 1999.
    • (1999) Knowledge Discovery and Data Mining , pp. 125-134
    • Liu, B.1    Hsu, W.2    Ma, Y.3
  • 15
    • 0003848792 scopus 로고    scopus 로고
    • Beyond independence: Probabilistic models for query approximation on binary transaction data
    • UC Irvine
    • Dmitry Pavlov, Heikki Mannila, and Padhraic Smyth. Beyond independence: Probabilistic models for query approximation on binary transaction data. Technical Report UCI-ICS TR-01-09, UC Irvine, 2001.
    • (2001) Technical Report , vol.UCI-ICS TR-01-09
    • Pavlov, D.1    Mannila, H.2    Smyth, P.3
  • 17
    • 0031161999 scopus 로고    scopus 로고
    • Beyond market baskets: Generalizing association rules to correlations
    • C. Silverstein S. Brin, R. Motwani. Beyond market baskets: Generalizing association rules to correlations. In SIGMOD Conference, pages 265-276, 1997.
    • (1997) SIGMOD Conference , pp. 265-276
    • Silverstein, C.1    Brin, S.2    Motwani, R.3
  • 18
    • 84957705284 scopus 로고    scopus 로고
    • Coincidence detection: A fast method for discovering higher-order correlations in multidimensional data
    • E. Steeg, D. A. Robinson, and E. Willis, Coincidence detection: A fast method for discovering higher-order correlations in multidimensional data. In KDD 1998, pages 112-120, 1998.
    • (1998) KDD 1998 , pp. 112-120
    • Steeg, E.1    Robinson, D.A.2    Willis, E.3
  • 19
    • 0242625291 scopus 로고    scopus 로고
    • Selecting the right interestingness measure for association patterns
    • P. Tan, V. Kumar, and J. Srivastava. Selecting the right interestingness measure for association patterns. In ACM SIGKDD, 2002.
    • (2002) ACM SIGKDD
    • Tan, P.1    Kumar, V.2    Srivastava, J.3
  • 20
    • 0027557863 scopus 로고
    • An accurate computation of the hypergeometric distribution function
    • T. Wu. An accurate computation of the hypergeometric distribution function. ACM Transactions on Mathematical Software (TOMS), 19(1):33-43, 1993.
    • (1993) ACM Transactions on Mathematical Software (TOMS) , vol.19 , Issue.1 , pp. 33-43
    • Wu, T.1
  • 21
    • 0034592942 scopus 로고    scopus 로고
    • Generating non-redundant association rules
    • M. Zaki. Generating non-redundant association rules. In KDD 2000, pages 34-43, 2000.
    • (2000) KDD 2000 , pp. 34-43
    • Zaki, M.1


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