메뉴 건너뛰기




Volumn 4099 LNAI, Issue , 2006, Pages 251-260

Mining multi-dimensional frequent patterns without data cube construction

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN RECOGNITION; TREES (MATHEMATICS);

EID: 33749571164     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11801603_28     Document Type: Conference Paper
Times cited : (4)

References (14)
  • 1
    • 0003585297 scopus 로고    scopus 로고
    • Micheline Chamber, Morgan Kaufmann, Hardcover, ISBN 1558604898
    • Data Mining: Concepts and Techniques. Jiawei Han, Micheline Chamber, Morgan Kaufmann, Hardcover, ISBN 1558604898
    • Data Mining: Concepts and Techniques
    • Han, J.1
  • 2
    • 0002857487 scopus 로고    scopus 로고
    • Metarule-guided mining of multi-dimensional association rules using data cubes
    • Kamber, J. Han, and J.Y. Chiang. Metarule-guided mining of multi-dimensional association rules using data cubes. KKD'97.
    • KKD'97
    • Kamber1    Han, J.2    Chiang, J.Y.3
  • 4
    • 0002877253 scopus 로고
    • Discovery, analysis, and presentation of strong rules
    • G. Piatetski-Shapiro. Discovery, analysis, and presentation of strong rules. In Knowledge Discovery in Databases, pages 229-248, 1991.
    • (1991) Knowledge Discovery in Databases , pp. 229-248
    • Piatetski-Shapiro, G.1
  • 5
    • 0027621699 scopus 로고
    • Mining association rules between sets of items in large databases
    • Rakesh Agrawal, et.al Mining association rules between sets of items in large databases. In Proc. of the ACM SIGMOD 1993
    • (1993) Proc. of the ACM SIGMOD
    • Agrawal, R.1
  • 6
    • 0039253846 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation
    • Han, J., Pei, J., and Yin, Y. Mining Frequent Patterns without Candidate Generation. SIGMOD, 1-12. 2000.
    • (2000) SIGMOD , pp. 1-12
    • Han, J.1    Pei, J.2    Yin, Y.3
  • 7
    • 0001853449 scopus 로고    scopus 로고
    • Quasi-cubes: Exploiting approximation in multidimensional databases
    • D. Barbara and M. Sullivan. Quasi-cubes: Exploiting approximation in multidimensional databases. SIGMOD Record, 26:12-17, 1997.
    • (1997) SIGMOD Record , vol.26 , pp. 12-17
    • Barbara, D.1    Sullivan, M.2
  • 8
    • 0002442366 scopus 로고    scopus 로고
    • On the computation of multidimensional aggregates
    • Mumbai, Sept.
    • S. Agarwal, et. al. On the computation of multidimensional aggregates. In Proc. 22nd VLDB, pages 506-521, Mumbai, Sept. 1996.
    • (1996) Proc. 22nd VLDB , pp. 506-521
    • Agarwal, S.1
  • 10
    • 51649101824 scopus 로고    scopus 로고
    • High-dimensional OLAP: A minimal cubing approach
    • Xiaolei Li, Jiawei Han, and Hector Gonzalez. High-Dimensional OLAP: A Minimal Cubing Approach. In VLDB'04.
    • VLDB'04
    • Li, X.1    Han, J.2    Gonzalez, H.3
  • 11
    • 0002738566 scopus 로고    scopus 로고
    • Knowledge discovery in databases: An attribute-oriented approach
    • J. Han, Y. Cai, and N. Gereone. Knowledge discovery in databases: An attribute-oriented approach. VLDB 95, pages 547-559
    • VLDB 95 , pp. 547-559
    • Han, J.1    Cai, Y.2    Gereone, N.3
  • 14
    • 84941149109 scopus 로고    scopus 로고
    • http://cs.scu.edu.cn/~lichuan/lichuan.rar


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