메뉴 건너뛰기




Volumn 17, Issue 3, 2006, Pages 379-387

Arbitrary shape cluster algorithm for clustering data stream

Author keywords

Clustering; Data mining; Data stream

Indexed keywords

ALGORITHMS; DATA PROCESSING; DATABASE SYSTEMS; DENSITY (OPTICAL); MONTE CARLO METHODS;

EID: 33646727422     PISSN: 10009825     EISSN: None     Source Type: Journal    
DOI: 10.1360/jos170379     Document Type: Article
Times cited : (34)

References (9)
  • 1
    • 2442617843 scopus 로고    scopus 로고
    • Issues in data stream management
    • Golab L, Özsu MT. Issues in data stream management. SIGMOD Record, 2003, 32(2): 5-14.
    • (2003) SIGMOD Record , vol.32 , Issue.2 , pp. 5-14
    • Golab, L.1    Özsu, M.T.2
  • 3
    • 0038205905 scopus 로고    scopus 로고
    • Requirements for clustering data streams
    • Barbará D. Requirements for clustering data streams. ACM SIGKDD Explorations Newsletter, 2003, 3(2): 23-27.
    • (2003) ACM SIGKDD Explorations Newsletter , vol.3 , Issue.2 , pp. 23-27
    • Barbará, D.1
  • 4
    • 85012236181 scopus 로고    scopus 로고
    • A framework for clustering evolving data streams
    • Aggarwal C, Han J, Wang J, Yu PS. A framework for clustering evolving data streams. In: VLDB 2003. 2003. 81-92.
    • (2003) VLDB 2003 , pp. 81-92
    • Aggarwal, C.1    Han, J.2    Wang, J.3    Yu, P.S.4
  • 7
    • 0030157145 scopus 로고    scopus 로고
    • BIRCH: An efficient data clustering method for very large databases
    • Zhang T, Ramakrishnan R, Livny M. BIRCH: An efficient data clustering method for very large databases. In: SIGMOD'96. 1996. 103-114.
    • (1996) SIGMOD'96 , pp. 103-114
    • Zhang, T.1    Ramakrishnan, R.2    Livny, M.3
  • 9
    • 2442443820 scopus 로고    scopus 로고
    • Approximate frequency counts over data streams
    • Manku GS, Motwani R. Approximate frequency counts over data streams. In: VLDB 2002. 2002. 346-357.
    • (2002) VLDB 2002 , pp. 346-357
    • Manku, G.S.1    Motwani, R.2


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