Skip to main content
SpringerLink
Log in

D-ACSM: a technique for dynamically assigning and adjusting cluster patterns for IoT data analysis

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

With rapid advancements in wireless communications and sensor technologies, the Internet of Things (IoT) has advanced dramatically in past years. In IoT, the data created by a large number of sensors are extremely intricate, diverse, and enormous, and it is unprocessed. These may have underlying patterns that are not visible that must be discovered to do large-scale data analysis. Several clustering algorithms have been developed and proved effective in data analysis in recent decades; however, they are intentionally designed for dealing with static data and infeasible for processing huge data in IoT environments. As a result, this research proposes a Density-based Adaptive Cluster Split and Merge (D-ACSM) technique for dynamically assigning and changing cluster patterns for IoT data processing to solve this challenge. For successful cluster analysis, the local density and minimum distance between dynamic data objects were first measured. In addition, the D-ACSM technique used Cluster Splitting and Merging (CSM) to alter cluster patterns between surrounding dynamic data objects. In addition, the suggested D-ACSM technique’s results were evaluated using four IoT benchmarked datasets that varied in the number of arriving data objects. Finally, the proposed D-ACSM technique improves the results of the performance metrics by 4%, 5%, 3%, and 6% on the BWS-AS dataset, CRAWDAD dataset, Minute_Weather dataset, and LinkedSensorData dataset, respectively, when compared to the AC-ICSM, IMMFC, and IAPNA techniques used for cluster analysis in all data chunks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Chen Y, Xiaoliang H, Fan W, Shen L, Zhang Z, Liu X, Jixiang D, Li H, Chen Y, Li H (2020) Fast density peak clustering for large scale data based on kNN. Knowl-Based Syst 187:104824

    Article  Google Scholar 

  2. Puschmann D, Barnaghi P, Tafazolli R (2017) Adaptive clustering for dynamic IoT data streams. IEEE Internet Things J 4(1):64–74

    Article  Google Scholar 

  3. Hassan BA, Rashid TA (2021) A multidisciplinary ensemble algorithm for clustering heterogeneous datasets. Neural Comput Appl 33:1–24

    Google Scholar 

  4. Zhao Z, Barijough KM, Gerstlauer A (2018) DeepThings: Distributed Adaptive Deep Learning Inference on Resource-Constrained IoT Edge Clusters. IEEE Trans Comput Aided Des Integr Circuits Syst 37(11):2348–2359

    Article  Google Scholar 

  5. Wang W, Zhang M (2020) Tensor deep learning model for heterogeneous data fusion in internet of things. IEEE Trans Emerg Top Comput Intell 4(1):32–41

    Article  Google Scholar 

  6. Weng Y, Zhang N, Yang X (2019) Improved density peak clustering based on information entropy for ancient character images. IEEE Access 7:81691–81700

    Article  Google Scholar 

  7. Gu L, Zeng D, Guo S, Xiang Y, Hu J (2016) A general communication cost optimization framework for big data stream processing in geo-distributed data centers. IEEE Trans Comput 65(1):19–29

    Article  MathSciNet  Google Scholar 

  8. Abualigah L, Gandomi AH, Elaziz MA, Hamad HA, Omari M, Alshinwan M, Khasawneh AM (2021) Advances in meta-heuristic optimization algorithms in big data text clustering. Electronics 10(2):101

    Article  Google Scholar 

  9. Whitmore A, Agarwal A, Xu L (2014) The internet of things-a survey of topics and trends. Inf Syst Front 17(2):261–274

    Article  Google Scholar 

  10. Yin Y, Long L, Deng X (2020) Dynamic data mining of sensor data. IEEE Access 8:41637–41648

    Article  Google Scholar 

  11. Sivadi Balakrishna M, Thirumaran RP, Solanki VK (2019) An efficient incremental clustering-based improved K-Medoids for IoT multivariate data cluster analysis. Peer-to-Peer Netw Appl 13(4):1152–1175

    Article  Google Scholar 

  12. N. Sahoo, J. Callan, R. Krishnan, G. Duncan, and R. Padman, (2006) Incremental Hierarchical Clustering Of Text Documents. In: Proceedings 15th International Conference Information Knowledge Management, 2006, pp. 357–366

  13. Sun L, Guo C (2014) Incremental affinity propagation clustering based on message passing. IEEE Trans Knowl Data Eng 26(11):2731–2744

    Article  Google Scholar 

  14. Vijaya PA, Murty MN, Subramanian DK (2004) Leaders–Subleaders: An efficient hierarchical clustering algorithm for large data sets. Pattern Recognit Lett 25(4):505–513

    Article  Google Scholar 

  15. Bakr AM, Ghanem NM, Ismail MA (2015) Efficient incremental density-based algorithm for clustering large datasets. Alexandria Eng J 54(4):1147–1154

    Article  Google Scholar 

  16. Rodriguez A, Laio A (2014) Clustering by fast search and find of density peaks. Science 344(6191):1492–1496

    Article  Google Scholar 

  17. X Zhang, C Furtlehner, and M Sebag, (2008) Frugal and Online Affinity Propagation. In: Proceedings. Conference Francophone sur l’Apprentissage (CAP), 2008. [Online]. Available: https://hal.inria.fr/inria-00287381

  18. Wang Y, Chen L, Mei J-P (2014) Incremental fuzzy clustering with multiple medoids for large data. IEEE Trans Fuzzy Syst 22(6):1557–1568

    Article  Google Scholar 

  19. Liu S, Zhou B, Huang D, Shen L (2017) Clustering mixed data by fast search and find of density peaks. Math Probl Eng Hindawi 2017:1–7

    Google Scholar 

  20. Zhuo L, Li K, Liao B, Li H, Wei X, Li K (2019) HCFS: a density peak based clustering algorithm employing a hierarchical strategy. IEEE Access 7:74612–74624

    Article  Google Scholar 

  21. Boeva V, Angelova M, Tsiporkova E (2019) A split-merge evolutionary clustering algorithm. Proc ICAART 2019:337–346

    Google Scholar 

  22. Veselka, Boeva, Milena Angelova, Vishnu Manasa Devagiri, and Elena Tsiporkova. "Bipartite Split-Merge Evolutionary Clustering." In: International Conference on Agents and Artificial Intelligence, pp. 204–223. Springer, Cham, 2019

  23. Mohotti WA, Nayak R (2021) Discovering cluster evolution patterns with the Cluster Association-aware matrix factorization. Knowl Inf Syst 63(6):1397–1428. https://doi.org/10.1007/s10115-021-01561-9

    Article  Google Scholar 

  24. Aliniya Z, Mirroshandel SA (2019) A novel combinatorial merge-split approach for automatic clustering using imperialist competitive algorithm. Expert Syst Appl 117:243–266. https://doi.org/10.1016/j.eswa.2018.09.050

    Article  Google Scholar 

  25. Wang Y, Chen L, Mei J (2014) Incremental fuzzy clustering with multiple medoids for large data. IEEE Trans Fuzzy Syst 22(6):1557–1568

    Article  Google Scholar 

  26. https://data.world/cityofchicago/beach-weather-stations-automated-sensors/workspace/file?filename=beach-weather-stations-automated-sensors-1.csv

  27. MA Alswailim, HS Hassanein, M Zulkernine, CRAWDAD dataset queensu/crowd_temperature (v. 2015 11 20): derived from roma/taxi (v. 2014 07 17), downloaded from https://crawdad.org/queensu/crowd_temperature/20151120, https://doi.org/10.15783/C7CG65, Nov 2015

  28. https://www.kaggle.com/julianjose/minute-weather

  29. http://wiki.knoesis.org/index.php/LinkedSensorData

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Vignan’s Foundation for Science, Technology & Research, Deemed to be University, Vadlamudi, Guntur, AP, India

    Sivadi Balakrishna

Authors
  1. Sivadi Balakrishna
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sivadi Balakrishna.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Balakrishna, S. D-ACSM: a technique for dynamically assigning and adjusting cluster patterns for IoT data analysis. J Supercomput 78, 12873–12897 (2022). https://doi.org/10.1007/s11227-022-04427-1

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-022-04427-1

Keywords

Search

Navigation