메뉴 건너뛰기




Volumn , Issue , 2007, Pages 727-732

Incremental subspace clustering over multiple data streams

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; DATA STREAMING; DIRECTED ACYCLIC GRAPH; INCREMENTAL CLUSTERING; INTERNATIONAL CONFERENCES; MULTIPLE DATA STREAMS; MULTIPLE STREAMS; PRUNING TECHNIQUES; RE-CLUSTERING; REAL DATA SETS; SEARCH SPACES; SLIDING WINDOWS; STREAM DATA; SUB SPACES; SUBSPACE CLUSTERING; TIME POINTS;

EID: 49749129993     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2007.100     Document Type: Conference Paper
Times cited : (11)

References (10)
  • 6
    • 0242387333 scopus 로고    scopus 로고
    • Mafia: Efficient and scalable subspace clustering for very large data sets
    • Technical Report CPDC-TR-9906-010, Northwestern University, June
    • S. Goil, H. Nagesh, and A. Choudhary. Mafia: Efficient and scalable subspace clustering for very large data sets. Technical Report CPDC-TR-9906-010, Northwestern University, June 1999.
    • (1999)
    • Goil, S.1    Nagesh, H.2    Choudhary, A.3


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