An efficient incremental clustering based improved K-Medoids for IoT multivariate data cluster analysis

被引:0
作者
Sivadi Balakrishna
M. Thirumaran
R. Padmanaban
Vijender Kumar Solanki
机构
[1] Pondicherry Engineering College,Department of Computer Science and Engineering
[2] CMR Institute of Technology,Department of Computer Science and Engineering
来源
Peer-to-Peer Networking and Applications | 2020年 / 13卷
关键词
Clustering; Internet of things (IoT); Sensor data; K-medoids;
D O I
暂无
中图分类号
学科分类号
摘要
Clustering the data is an efficient way present in data analysis. Most of the clustering techniques are unable to underlying the hidden patterns, since the algorithms are supposed to store the data at a time from the data repository for data analysis. These data objects are infeasible, since the Internet of Things (IoT) dynamic data is too large to process and perform analysis over it. In olden days, the traditional clustering techniques implemented on batch processing systems with static data. In recent days, while considering IoT, Big data, and sensor technologies, the multivariate data is huge and unable to perform analysis with traditional approaches. Therefore, clustering multivariate data with an efficient way is a challenging problem and yielding insignificant clustering results. To overcome these limitations, in this paper, an Efficient Incremental Clustering by Fast Search driven Improved K-Medoids (EICFS-IKM) for IoT data integration and cluster analysis is proposed. The proposed EICFS-IKM contains cluster creating and cluster merging techniques for integrating the current dynamic multivariate data into the existing pattern data for final clustering data. For dynamically updating and modifying the centers of clusters of the new arriving instances, the improved k-medoids is employed. The proposed EICFS-IKM has implemented and experimented on four UCI machine learning data repository datasets, two dynamic industrial datasets, two linked stream datasets and compared with leading approaches namely IAPNA, IMMFC, ICFSKM, and E-ICFSMR and yielding encouraging results with computational time, NMI, purity and clustering accuracy.
引用
收藏
页码:1152 / 1175
页数:23
相关论文
共 101 条
  • [1] Perera C(2014)Sensing As a Service Model for Smart Cities Supported by Internet of Things European Transactions on Emerging Telecommunications Technologies 25 81-93
  • [2] Zaslavsky A(2015)Recent advances in industrial wireless sensor networks toward efficient management in IoT IEEE Access 3 622-637
  • [3] Christen P(2016)Accelerated PSO Swarm Search Feature Selection for Data Stream Mining Big Data IEEE Transactions on Services Computing 9 33-45
  • [4] Georgakopoulos D(2016)A General Communication Cost Optimization Framework for Big Data Stream Processing in Geo-Distributed Data Centers IEEE Transactions on Computers 65 19-29
  • [5] Sheng Z(2014)The internet of things-a survey of topics and trends Inf Syst Front 17 261-274
  • [6] Mahapatra C(2014)Clustering by Fast Search and Find of Density Peaks Science 344 1492-1496
  • [7] Zhu C(2016)Clustering data streams based on shared density between micro-clusters IEEE Transactions on Knowledge & Data Engineering 28 1449-1461
  • [8] Leung VCM(2014)Twitter spammer detection using data stream clustering Inf Sci 260 64-73
  • [9] Fong S(2012)Incremental clustering of news reports Algorithms 5 364-378
  • [10] Wong R(2014)Wah T Y, Saboohi H. “on density-based data streams clustering algorithms: a survey” J Comput Sci Technol 29 116-141