Abstract

An effective clustering algorithm called PWStream for probabilistic data stream over sliding window is developed in this paper. The algorithm uses exponential histogram of cluster feature to store the summary information of the most recently arrived tuples, and outdated information is deleted within a certain guaranteed range of error. For the uncertain tuples in data stream, the concepts of strong cluster, transitional cluster and weak cluster are proposed in the PWStream. With these concepts, an effective strategy of choosing cluster based on distance and existence probability is designed, which can find more strong clusters. Theoretical analysis and comprehensive experimental results demonstrate that the proposed method is of high quality and fast processing rate.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.