Download 1. A density grid-based clustering algorithm for uncertain data streams

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Nonlinear dimensionality reduction wikipedia , lookup

Nearest-neighbor chain algorithm wikipedia , lookup

K-means clustering wikipedia , lookup

Cluster analysis wikipedia , lookup

Transcript
www.engineeringvillage.com
Detailed results: 1
Downloaded: 1/1/2015
1. A density grid-based clustering algorithm for uncertain data streams
Accession number: 20141817668199
Authors: Tu, Li (1); Cui, Peng (1); Tang, Keming (2)
Author affiliation: (1) Jiangsu Engineering RandD Center for Information Fusion Software, Department of Computer
Science, Jiangyin Polytechnic College, Jiangyin, China; (2) College of Information Science and Technology, Yancheng
Teachers University, Yancheng, China
Source title: Proceedings - 2013 10th Web Information System and Application Conference, WISA 2013
Abbreviated source title: Proc. Web Inf. Syst. Appl. Conf., WISA
Monograph title: Proceedings - 2013 10th Web Information System and Application Conference, WISA 2013
Issue date: 2013
Publication year: 2013
Pages: 347-350
Article number: 6778662
Language: English
Document type: Conference article (CA)
Conference name: 2013 10th Web Information System and Application Conference, WISA 2013
Conference date: November 1, 2013 - November 3, 2013
Conference location: Yangzhou, Jiangsu, China
Conference code: 104623
Sponsor: China Computer Federation; Chinese Computer Federation; IEEE Computer Society; Technical Committee
of Office Automation of
Publisher: IEEE Computer Society
Abstract: This paper proposes a grid-based clustering algorithm Clu-US which is competent to find clusters of nonconvex shapes on uncertain data stream. Clu-US maps the uncertain data tuples to the grid space which could
store and update the summary information of stream. The uncertainty of data is taken into account for calculating
the probability center of a grid. Then, the distance between the probability centers of two adjacent grids is adopted
for measuring whether they are 'close enough' in grids merging process. Furthermore, a dynamic outlier deletion
mechanism is developed to improve clustering performance. The experimental results show that Clu-US outperforms
other algorithms in terms of clustering quality and speed. © 2013 IEEE.
Number of references: 11
Main heading: Clustering algorithms
Controlled terms: Data communication systems - Data mining - Probability - World Wide Web
Uncontrolled terms: clustering - Clustering quality - grid - Grid-based clustering algorithm - Non-convex shapes Uncertain data streams - Uncertain datas - Uncertain streams
Classification code: 716 Telecommunication; Radar, Radio and Television - 717 Optical Communication - 718
Telephone Systems and Related Technologies; Line Communications - 721 Computer Circuits and Logic Elements 723 Computer Software, Data Handling and Applications - 922.1 Probability Theory
DOI: 10.1109/WISA.2013.71
Database: Compendex
Compilation and indexing terms, Copyright 2014 Elsevier Inc.
Data Provider: Engineering Village
Content provided by Engineering Village. Copyright 2015
Page 1 of 1