메뉴 건너뛰기




Volumn , Issue , 2001, Pages 249-256

The computational complexity of high-dimensional correlation search

Author keywords

[No Author keywords available]

Indexed keywords


EID: 13644257591     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (14)

References (11)
  • 1
    • 0002221136 scopus 로고
    • Fast Algorithms for Mining Association Rules in Large Databases
    • Rakesh Agrawal, Ramakrishnan Srikant: Fast Algorithms for Mining Association Rules in Large Databases. VLDB 1994: 487-499
    • (1994) VLDB , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 3
    • 0031161999 scopus 로고    scopus 로고
    • Beyond Market Baskets: Generalizing Association Rules to Correlations
    • Sergey Brin, Rajeev Motwani, Craig Silverstein: Beyond Market Baskets: Generalizing Association Rules to Correlations. SIGMOD Conference 1997: 265-216
    • SIGMOD Conference 1997 , pp. 265-1216
    • Brin, S.1    Motwani, R.2    Silverstein, C.3
  • 5
    • 85001774838 scopus 로고
    • Accurate Methods for the Statistics of Surprise and Coincidence
    • Ted Dunning: Accurate Methods for the Statistics of Surprise and Coincidence. Computational Linguistics 19(1), 1993
    • (1993) Computational Linguistics , vol.19 , Issue.1
    • Dunning, T.1
  • 6
    • 0029752925 scopus 로고    scopus 로고
    • Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total
    • Jim Gray, Adam Bosworth, Andrew Layman, Hamid Pirahesh: Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total. ICDE 1996: 152-159
    • (1996) ICDE , pp. 152-159
    • Gray, J.1    Bosworth, A.2    Layman, A.3    Pirahesh, H.4


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