메뉴 건너뛰기




Volumn 1, Issue , 2009, Pages 491-495

A fast subspace partition clustering algorithm for high dimensional data streams

Author keywords

CD tree lattice structure; Clustering; Data mining; Data streams; Subspace partition

Indexed keywords

ARBITRARY SHAPE; CLUSTERING DATA; CLUSTERING QUALITY; DATA STREAM; DATA STREAM CLUSTERING; DATA STREAM MINING; HIGH DIMENSIONAL DATA; LATTICE STRUCTURES; MICRO-CLUSTERS; OFFLINE; ONLINE COMPONENTS; PARTITION CLUSTERING; RESEARCH PROBLEMS;

EID: 77949572517     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICICISYS.2009.5357796     Document Type: Conference Paper
Times cited : (4)

References (9)


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