An efficient algorithm for dense regions discovery from large-scale data streams

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We introduce the notion of dense region as distinct and meaningful patterns from given data. Efficient and effective algorithms for identifying such regions are presented. Next, we discuss extensions of the algorithms for handling data streams. Finally, experiments on largescale data streams such as clickstreams are given which confirm that the usefulness of our algorithms.

Cite

CITATION STYLE

APA

Yip, A. M., Wu, E. H., Ng, M. K., & Chan, T. F. (2004). An efficient algorithm for dense regions discovery from large-scale data streams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3056, pp. 116–120). Springer Verlag. https://doi.org/10.1007/978-3-540-24775-3_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free