메뉴 건너뛰기




Volumn , Issue , 2005, Pages 10-17

Online hierarchical clustering in a data warehouse environment

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DATA STRUCTURES; DATA WAREHOUSES; HIERARCHICAL SYSTEMS; ONLINE SYSTEMS;

EID: 34547265927     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2005.111     Document Type: Conference Paper
Times cited : (13)

References (15)
  • 2
    • 0038205905 scopus 로고    scopus 로고
    • Requirements for Clustering Data, Streams
    • D. Barbara. "Requirements for Clustering Data, Streams". SIGKDD Explorations, 3:23-27, 2002.
    • (2002) SIGKDD Explorations , vol.3 , pp. 23-27
    • Barbara, D.1
  • 3
    • 0001802606 scopus 로고    scopus 로고
    • The X-Tree: An Index Structure for High-Dimensional Data
    • S. Berchtold, D. A. Keim, and H.-P. Kriegel. "The X-Tree: An Index Structure for High-Dimensional Data". In Proc. VLDB, 1996.
    • (1996) Proc. VLDB
    • Berchtold, S.1    Keim, D.A.2    Kriegel, H.-P.3
  • 4
    • 0034819223 scopus 로고    scopus 로고
    • Data, Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering
    • M. M. Breunig, H.-P. Kriegel, P. Kröger, and J. Sander. "Data, Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering". In Proc. ACM SIGMOD, 2001.
    • (2001) Proc. ACM SIGMOD
    • Breunig, M.M.1    Kriegel, H.-P.2    Kröger, P.3    Sander, J.4
  • 5
    • 33750128331 scopus 로고    scopus 로고
    • An Incremental Hierarchical Data Clustering Algorithm Based on Gravity Theory
    • C. Chen, S. Hwang, and Y. Oyang. "An Incremental Hierarchical Data Clustering Algorithm Based on Gravity Theory". In Proc. PAKDD, 2002.
    • (2002) Proc. PAKDD
    • Chen, C.1    Hwang, S.2    Oyang, Y.3
  • 6
    • 0001765146 scopus 로고
    • CLINK: An Efficient Algorithm for the Complete Link Cluster Method
    • D. Defays. "CLINK: An Efficient Algorithm for the Complete Link Cluster Method". The Computer Journal, 20(4):364-366, 1977.
    • (1977) The Computer Journal , vol.20 , Issue.4 , pp. 364-366
    • Defays, D.1
  • 9
    • 26444485130 scopus 로고    scopus 로고
    • Incremental OPTICS: Efficient Computation of Updates in a Hierarchical Cluster Ordering
    • H.-P. Kriegel, P. Kröger, and I. Gotlibovich. "Incremental OPTICS: Efficient Computation of Updates in a Hierarchical Cluster Ordering". In Proc. DaWaK, 2003.
    • (2003) Proc. DaWaK
    • Kriegel, H.-P.1    Kröger, P.2    Gotlibovich, I.3
  • 10
    • 3142780768 scopus 로고    scopus 로고
    • Incremental and Effective Data Summerization for Dynamic Hierarchical Clustering
    • S. Nassar, J. Sander, and C. Cheng. "Incremental and Effective Data Summerization for Dynamic Hierarchical Clustering". In Proc. ACM SIGMOD, 2004.
    • (2004) Proc. ACM SIGMOD
    • Nassar, S.1    Sander, J.2    Cheng, C.3
  • 11
    • 0033891156 scopus 로고    scopus 로고
    • Extracting Delta for Incremental Data Warehouse Maintenance
    • P. Ram and L. Do. "Extracting Delta for Incremental Data Warehouse Maintenance". In Proc. ICDE, pages 220-229, 2000.
    • (2000) Proc. ICDE , pp. 220-229
    • Ram, P.1    Do, L.2
  • 12
    • 13844262083 scopus 로고    scopus 로고
    • Automatic Extraction of Clusters from Hierarchical Clustering Representations
    • J. Sander, X. Qin, Z. Lu, N. Niu, and A. Kovarsky. "Automatic Extraction of Clusters from Hierarchical Clustering Representations". In Proc. PAKDD, 2003.
    • (2003) Proc. PAKDD
    • Sander, J.1    Qin, X.2    Lu, Z.3    Niu, N.4    Kovarsky, A.5
  • 13
    • 0002663098 scopus 로고
    • SLINK: An Optimally Efficient Algorithm for the Single-Link Cluster Method
    • R. Sibson. "SLINK: An Optimally Efficient Algorithm for the Single-Link Cluster Method". The Computer Journal, 16(1):30-34, 1973.
    • (1973) The Computer Journal , vol.16 , Issue.1 , pp. 30-34
    • Sibson, R.1
  • 14
    • 33746063319 scopus 로고    scopus 로고
    • An Incremental Approach to Building a. Cluster Hierarchy
    • D. H. Widyantoro, T. R. Ioerger, and J. Yen. "An Incremental Approach to Building a. Cluster Hierarchy". In Proc. ICDM, pages 705-708, 2002.
    • (2002) Proc. ICDM , pp. 705-708
    • Widyantoro, D.H.1    Ioerger, T.R.2    Yen, J.3
  • 15
    • 85012191696 scopus 로고    scopus 로고
    • Data Bubbles for Non-Vector Data: Speeding-up Hierarchical Clustering in Arbitrary Metric Spaces
    • J. Zhou and J. Sander. "Data Bubbles for Non-Vector Data: Speeding-up Hierarchical Clustering in Arbitrary Metric Spaces". In Proc. VLDB, 2003.
    • (2003) Proc. VLDB
    • Zhou, J.1    Sander, J.2


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