Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Advances in Intelligent Systems
Guest editors: Vassilis Kodogiannisx and Ilias Petrouniasy
Article type: Research Article
Authors: He, Zengyoua; * | Xu, Xiaofeib | Deng, Shengchunb | Huang, Joshua Zhexuec
Affiliations: [a] School of Software, Dalian University of Technology, Dalian, 116620, China | [b] Department of Computer Science and Engineering, Harbin Institute of Technology, P.O. Box 315, Harbin 150001, China | [c] Shenzhen Institute of Advanced Technology, Shenzhen, China | [x] University of Westminster, Westminster, UK | [y] The University of Manchester, Manchester, UK
Correspondence: [*] Corresponding author. E-mail: [email protected].
Abstract: 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.
Keywords: Clustering, categorical data, data stream, data mining
DOI: 10.3233/JCM-2011-0363
Journal: Journal of Computational Methods in Sciences and Engineering, vol. 11, no. 4, pp. 185-192, 2011
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]