메뉴 건너뛰기




Volumn , Issue , 2005, Pages 355-356

CLICKS: Mining subspace clusters in categorical data via K-partite maximal cliques

Author keywords

[No Author keywords available]

Indexed keywords

CLICKS; K-PARTITE; SUBSPACE CLUSTERS;

EID: 28444449780     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2005.33     Document Type: Conference Paper
Times cited : (43)

References (4)
  • 1
    • 0002161595 scopus 로고    scopus 로고
    • CACTUS: Clustering categorical data using summaries
    • V. Ganti, J. Gehrke, and R. Ramakrishnan. CACTUS: Clustering categorical data using summaries. SIGKDD, 1999.
    • (1999) SIGKDD
    • Ganti, V.1    Gehrke, J.2    Ramakrishnan, R.3
  • 2
    • 0002318328 scopus 로고    scopus 로고
    • Clustering categorical data: An approach based on dynamical systems
    • D. Gibson, J. Kleinberg, and P. Raghavan. Clustering categorical data: An approach based on dynamical systems. VLDB, 1998.
    • (1998) VLDB
    • Gibson, D.1    Kleinberg, J.2    Raghavan, P.3
  • 3
    • 0032652570 scopus 로고    scopus 로고
    • Rock: A robust clustering algorithm for categorical attributes
    • S. Guha, R. Rastogi, and K. Shim. Rock: A robust clustering algorithm for categorical attributes. ICDE, 1999.
    • (1999) ICDE
    • Guha, S.1    Rastogi, R.2    Shim, K.3
  • 4
    • 38149073016 scopus 로고    scopus 로고
    • CLICK: Clustering categorical data using k-partite maximal cliques
    • CS Dept., RPI
    • M. Peters and M. J. Zaki. CLICK: Clustering categorical data using k-partite maximal cliques. TR 04-11, CS Dept., RPI, 2004.
    • (2004) TR , vol.4 , Issue.11
    • Peters, M.1    Zaki, M.J.2


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