A High-Dimensional Data Stream Clustering Algorithm Based on Damped Window and Pruning List Tree

摘要：

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 highdimensional 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.

关键词： data streams high-dimensional clustering damped window pruning list tree

作者: Hong Jiang Qingsong Yu Dongxiu Wang

作者单位: Computer Center East China Normal University Shanghai, China

会议类型: 国际会议

会议名称: 2011 4th International Conference on Biomedical Engineering and Informatics(第四届生物医学工程与信息学国际会议 BMEI 2011)

会议地点: 上海

会议语种:英文

页码: 2045-2049

在线出版日期: 2011-10-15（万方平台首次上网日期，不代表论文的发表时间）