메뉴 건너뛰기




Volumn , Issue , 2006, Pages 1162-1166

TOP-COP: Mining TOP-K strongly correlated pairs in large databases

Author keywords

[No Author keywords available]

Indexed keywords

CORRELATION THRESHOLD; DATA SETS; PEARSON'S CORRELATION COEFFICIENT;

EID: 44649196985     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2006.161     Document Type: Conference Paper
Times cited : (25)

References (18)
  • 1
    • 0027621699 scopus 로고
    • Mining association rules between sets of items in large databases
    • R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In ACM SIGMOD, pages 207-216, 1993.
    • (1993) ACM SIGMOD , pp. 207-216
    • Agrawal, R.1    Imielinski, T.2    Swami, A.3
  • 4
    • 0031161999 scopus 로고    scopus 로고
    • Beyond market baskets: Generalizing association rules to correlations
    • S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules to correlations. In ACM SIGMOD, pages 265-276, 1997.
    • (1997) ACM SIGMOD , pp. 265-276
    • Brin, S.1    Motwani, R.2    Silverstein, C.3
  • 6
    • 0035789655 scopus 로고    scopus 로고
    • Empirical bayes screening for multi-item associations
    • W. DuMouchel and D. Pregibon. Empirical bayes screening for multi-item associations. In KDD, pages 67-76, 2001.
    • (2001) KDD , pp. 67-76
    • DuMouchel, W.1    Pregibon, D.2
  • 7
    • 3142708793 scopus 로고    scopus 로고
    • Cords: Automatic discovery of correlations and soft functional dependencies
    • I. F. Ilyas, V. Markl, P. J. Haas, P. Brown, and A. Abolnaga. Cords: Automatic discovery of correlations and soft functional dependencies. In ACM SIGMOD, 2004.
    • (2004) ACM SIGMOD
    • Ilyas, I.F.1    Markl, V.2    Haas, P.J.3    Brown, P.4    Abolnaga, A.5
  • 8
    • 13644257591 scopus 로고    scopus 로고
    • The computational complexity of high-dimensional correlation search
    • C. Jermaine. The computational complexity of high-dimensional correlation search. In ICDM, 2001.
    • (2001) ICDM
    • Jermaine, C.1
  • 9
    • 61349173123 scopus 로고    scopus 로고
    • Playing hide-and-seek with correlations
    • C. Jermaine. Playing hide-and-seek with correlations. In ACM SIGKDD, 2003.
    • (2003) ACM SIGKDD
    • Jermaine, C.1
  • 12
    • 0012281281 scopus 로고    scopus 로고
    • Mining association rules with multiple minimum supports
    • B. Liu, W. Hsu, and Y. Ma. Mining association rules with multiple minimum supports. In ACM SIGKDD, 1999.
    • (1999) ACM SIGKDD
    • Liu, B.1    Hsu, W.2    Ma, Y.3
  • 15
    • 34748853476 scopus 로고    scopus 로고
    • Mining confident rules without support requirement
    • K. Wang, Y. He, D. Cheung, and Y. Chin. Mining confident rules without support requirement. In ACM CIKM, 2001.
    • (2001) ACM CIKM
    • Wang, K.1    He, Y.2    Cheung, D.3    Chin, Y.4
  • 18
    • 12244275963 scopus 로고    scopus 로고
    • Exploiting a support-based upper bound of pearson's correlation coefficient for efficiently identifying strongly correlated pairs
    • H. Xiong, S. Shekhar, P Tan, and V. Kumar. Exploiting a support-based upper bound of pearson's correlation coefficient for efficiently identifying strongly correlated pairs. In ACM SIGKDD, pages 334-343, 2004.
    • (2004) ACM SIGKDD , pp. 334-343
    • Xiong, H.1    Shekhar, S.2    Tan, P.3    Kumar, V.4


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