By Topic

A high-dimensional data stream clustering algorithm based on damped window and pruning list tree

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hong Jiang ; Computer Center, East China Normal University, Shanghai, China ; Qingsong Yu ; Dongxiu Wang

In order to effectively reduce the memory consumption, a synopsis data structure, PL-Tree, is proposed, which can store the summary information of data streams and help to quickly output the clustering results when any clustering is requested at any time. Then, PLStream, an efficient high-dimensional data stream clustering algorithm based on PL-Tree and damped window is presented. Simulation and comparison experiments demonstrate that compared with the classic CELL TREE algorithm, PLStream has better performance in execution efficiency, spatial scalability and clustering effect.

Published in:

2011 4th International Conference on Biomedical Engineering and Informatics (BMEI)  (Volume:4 )

Date of Conference:

15-17 Oct. 2011