메뉴 건너뛰기




Volumn , Issue , 2003, Pages 259-266

MaPle: A fast algorithm for maximal pattern-based clustering

Author keywords

[No Author keywords available]

Indexed keywords


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

References (13)
  • 1
    • 0347718066 scopus 로고    scopus 로고
    • Fast algorithms for projected clustering
    • C.C. Aggarwal et al. Fast algorithms for projected clustering. In SIGMOD'99.
    • SIGMOD'99
    • Aggarwal, C.C.1
  • 2
    • 0039253822 scopus 로고    scopus 로고
    • Finding generalized projected clusters in high dimensional spaces
    • C.C. Aggarwal and P.S. Yu. Finding generalized projected clusters in high dimensional spaces. In SIGMOD'00.
    • SIGMOD'00
    • Aggarwal, C.C.1    Yu, P.S.2
  • 3
    • 0032090765 scopus 로고    scopus 로고
    • Automatic subspace clustering of high dimensional data for data mining applications
    • R. Agrawal et al. Automatic subspace clustering of high dimensional data for data mining applications. In SIGMOD' 98.
    • SIGMOD' 98
    • Agrawal, R.1
  • 4
    • 0027621699 scopus 로고    scopus 로고
    • Mining association rules between sets of items in large databases
    • R. Agrawal et al. Mining association rules between sets of items in large databases. In SIGMOD'93.
    • SIGMOD'93
    • Agrawal, R.1
  • 5
    • 0002221136 scopus 로고    scopus 로고
    • Fast algorithms for mining association rules
    • R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB'94.
    • VLDB'94
    • Agrawal, R.1    Srikant, R.2
  • 6
    • 0002086686 scopus 로고    scopus 로고
    • When is "nearest neighbor" meaningful?
    • K. S. Beyer et al. When is "nearest neighbor" meaningful? In ICDT'99.
    • ICDT'99
    • Beyer, K.S.1
  • 7
    • 0002646822 scopus 로고    scopus 로고
    • Entropy-based subspace clustering for mining numerical data
    • C. H. Cheng et al. Entropy-based subspace clustering for mining numerical data. In KDD'99.
    • KDD'99
    • Cheng, C.H.1
  • 9
    • 0039253846 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation
    • J. Han et al. Mining frequent patterns without candidate generation. In SIGMOD'00.
    • SIGMOD'00
    • Han, J.1
  • 10
    • 78149297228 scopus 로고    scopus 로고
    • Semantic compression and pattern extraction with fascicles
    • H. V. Jagadish et al. Semantic compression and pattern extraction with fascicles. In VLDB'99.
    • VLDB'99
    • Jagadish, H.V.1
  • 12
    • 32344453239 scopus 로고    scopus 로고
    • Clustering by pattern similarity in large data sets
    • H. Wang et al. Clustering by pattern similarity in large data sets. In SIGMOD'02.
    • SIGMOD'02
    • Wang, H.1
  • 13
    • 0036211103 scopus 로고    scopus 로고
    • δ-cluster: Capturing subspace correlation in a large data set
    • J. Yang et al. δ-cluster: Capturing subspace correlation in a large data set. In ICDE'02.
    • ICDE'02
    • Yang, J.1


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