Clustering Categorical Data Streams

Details Clustering Categorical Data Streams Clustering Categorical Data Streams

2004-12-13

arxiv.org/abs/cs/0412058v1

Computer Science

Databases

23 pages. To Appear in Journal of Computational Methods on Science and Engineering(JCMSE)

Scientific paper

The data stream model has been defined for new classes of applications involving massive data being generated at a fast pace. Web click stream analysis and detection of network intrusions are two examples. Cluster analysis on data streams becomes more difficult, because the data objects in a data stream must be accessed in order and can be read only once or few times with limited resources. Recently, a few clustering algorithms have been developed for analyzing numeric data streams. However, to our knowledge to date, no algorithm exists for clustering categorical data streams. In this paper, we propose an efficient clustering algorithm for analyzing categorical data streams. It has been proved that the proposed algorithm uses small memory footprints. We provide empirical analysis on the performance of the algorithm in clustering both synthetic and real data streams

Affiliated with

Also associated with

No associations

Rating

Clustering Categorical Data Streams does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Clustering Categorical Data Streams, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clustering Categorical Data Streams will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-115345