An incremental clustering algorithm based on rough reduction for data stream

DOI10.3969/J.ISSN.0258-2724.2009.05.002MaRDI QIDQ3054836zbMATH OpenFDO

Authors

Publication date 5 November 2010

Full work available at URL https://doi.org/10.3969/J.ISSN.0258-2724.2009.05.002

zbMATH Keywords

clusteringdata miningdata streamrough reduction

Mathematics Subject Classification ID

Database theory (68P15) Pattern recognition, speech recognition (68T10)

Recommendations

• An incremental irregular grid algorithm for clustering data streams
• Grid-based clustering over an evolving data stream
• scientific article; zbMATH DE number 5811661
• Arbitrary shape cluster algorithm for clustering data stream
• Optimal algorithm of data streams clustering on sliding window model

Cited in

(5)

• Cluster data streams with noisy variables
• An evolving data stream clustering algorithm based on the shared nearest neighbor density
• Data stream clustering based on grid coupling
• scientific article; zbMATH DE number 2197673 (Why is no real title available?)
• An incremental irregular grid algorithm for clustering data streams

This page was built for publication: An incremental clustering algorithm based on rough reduction for data stream

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3054836)