Empowering Density-based Micro-clusters In Dynamic Data Stream Clustering

Authors

  • Asha P. V.  M. Tech Scholar, M Tech Scholar, Department of Computer Science and Engineering, Government Engineering College, Idukki, Kerala, India
  • Anju Sukumar  Assistant Professor, Department of Computer Science and Engineering, Government Engineering College, Idukki, Kerala, India

DOI:

https://doi.org//10.32628/IJSRSET207147

Keywords:

Data Mining, Data Stream, Clustering.

Abstract

Data stream is a continuous sequence of data generated from various sources and continuously transferred from source to target. Streaming data needs to be processed without having access to all of the data. Some of the sources generating data streams are social networks, geospatial services, weather monitoring, e-commerce purchases, etc. Data stream mining is the process of acquiring knowledge structures from the continuously arriving data. Clustering is an unsupervised machine learning technique that can be used to extract knowledge patterns from the data stream. The mining of streaming data is challenging because the data is in huge amounts and arriving continuously. So the traditional algorithms are not suitable for mining data streams. Data stream mining requires fast processing algorithms using a single scan and a limited amount of memory. The micro clustering has a good role in this. In itself, density based micro clustering has its own unique place in data stream mining. This paper presents a survey on different data clustering algorithms, realizes and empowers the use of density-based micro clusters.

References

  1. H. Azzag, N. Monmarche, M. Slimane, and G. Venturini, “AntTree: A new model for clustering with arti?cial ants,” in Proc. IEEE Conf. Evol. Comput., vol. 4. Canberra, ACT, Australia, 2003, pp. 2642–2647
  2. Charu C. Aggarwal, T. J. Watson Resch. Ctr.Jiawei Han, Jianyong Wang, UIUC, Philip S. Yu, T. J. Watson Resch. Ctr., “A Framework for Clustering Evolving Data Streams,” Proceedings of the 29th VLDB Conference, Berlin, Germany, 2003.
  3. Thomas A. Runkler Siemens AG Corporate Technology, Information, and Communications, 81730 Munich, Germany, “ Ant Colony Optimization of Clustering Models,” in INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, VOL. 20, 1233–1251, 2005.
  4. F. Cao, M. Ester, W. Qian, and A. Zhou, “Density-based clustering over an evolving data stream with noise,” in Proc. SIAM Int. Conf. D ata Min., vol. 6, 2006, pp. 328–339.
  5. Luning Xia Jiwu Jing, “An Ensemble Density-based Clustering Method,” Information Security State Key Laboratory, Graduate University of Chinese Academy of Science, Beijing 100049, P. R. China,2007.
  6. P. Kranen, I. Assent, C. Baldauf, and T. Seidl, “The ClusTree: Indexing micro-clusters for any time stream mining,” Knowl. Inf. Syst., vol. 29, no. 2, pp. 249–272, 2011.
  7. R. D. Baruah and P. Angelov, “DEC: Dynamically evolving clustering and its application to structure identi?cation of evolving fuzzy models,” IEEE Trans. Cybern., vol. 44, no. 9, pp. 1619–1631, Sep. 2014.
  8. Nesrine Masmoudi, Hanane Azzag, Mustapha Lebbah, Cyrille Bertelle, Maher Ben Jemaa, “How to Use Ants for Data Stream Clustering,” in Proc. IEEE Conf. Evol. Comput., vol. 4. Canberra, ACT, Australia2015.
  9. Conor Fahy and Shengxiang Yang, “Dynamic Stream Clustering Using Ants,” Published in UKCI 2016.
  10. Conor Fahy, Shengxiang Yang, Senior Member, IEEE, and Mario Gongora, “Ant Colony Stream Clustering: A Fast Density Clustering Algorithm for Dynamic Data Streams,” in IEEE TRANSACTIONS ON CYBERNETICS, VOL. 49, NO. 6, JUNE 2019.

Downloads

Published

2020-02-29

Issue

Section

Research Articles

How to Cite

[1]
Asha P. V., Anju Sukumar, " Empowering Density-based Micro-clusters In Dynamic Data Stream Clustering, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 7, Issue 1, pp.259-265, January-February-2020. Available at doi : https://doi.org/10.32628/IJSRSET207147