Student Psychology based optimized routing algorithm for big data clustering in IoT with MapReduce framework

被引:5
作者
Shanmugam, Gowri [1 ]
Thanarajan, Tamilvizhi [2 ]
Rajendran, Surendran [3 ]
Murugaraj, Sadish Sendil [4 ]
机构
[1] Sathyabama Inst Sci & Technol, Sch Comp, Chennai, Tamil Nadu, India
[2] Panimalar Engn Coll, Dept Comp Sci & Engn, Chennai 600123, Tamil Nadu, India
[3] Saveetha Inst Med & Tech Sci, Saveetha Sch Engn, Dept Comp Sci & Engn, Chennai, Tamil Nadu, India
[4] Guru Nanak Inst Technol, Dept Emerging Technol, Ibrahipatnam, Telangana, India
关键词
Internet of Things; routing; big data; big data clustering; student psychology based optimization;
D O I
10.3233/JIFS-221391
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Clustering plays a fundamental task in the process of data mining, which remains more demanding due to the ever-increasing dimension of accessible datasets. Big data is considered more populous as it has the ability to handle various sources and formats of data under numerous highly developed technologies. This paper devises a robust and effective optimization-based Internet of Things (IoT) routing technique, named Student Psychology Based Optimization (SPBO) - based routing for the big data clustering. When the routing phase is done, big data clustering is carried out using the Deep Fractional Calculus-Improved Invasive Weed Optimization fuzzy clustering (Deep FC-IIWO fuzzy clustering) approach. Here, the Mapreduce framework is used to minimizing the over fitting issues during big data clustering. The process of feature selection is performed in the mapper phase in order to select the major features using Minkowski distance, whereas the clustering procedure is carried out in the reducer phase by Deep FC-IIWO fuzzy clustering, where the FC-IIWO technique is designed by the hybridization of Improved InvasiveWeed Optimizer (IIWO) and Fractional Calculus (FC). The developed SPBO-based routing approach achieved effective performance in terms of energy, clustering accuracy, jaccard coefficient, rand coefficient, computational time and space complexity of 0.605 J, 0.935, 0.947, 0.954, 2100.6 s and 72KB respectively.
引用
收藏
页码:2051 / 2063
页数:13
相关论文
共 30 条
[1]  
Akcora Cuneyt Gurcan, 2020, UCI Machine Learning Repository
[2]  
[Anonymous], 2018, IEEE 13 IMAGE VIDEO
[3]   A differential invasive weed optimization algorithm for improved global numerical optimization [J].
Basak, Aniruddha ;
Maity, Dipankar ;
Das, Swagatam .
APPLIED MATHEMATICS AND COMPUTATION, 2013, 219 (12) :6645-6668
[4]  
Bathla Gourav, 2018, INT J ELECT COMPUTER, V8, P2088
[5]  
Bhaladhare Pawan R., 2014, ADV COMPUTER ENG
[6]   An Edge-Cloud-Aided High-Order Possibilistic c-Means Algorithm for Big Data Clustering [J].
Bu, Fanyu ;
Zhang, Qingchen ;
Yang, Laurence T. ;
Yu, Hang .
IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2020, 28 (12) :3100-3109
[7]   An intelligent scheme for big data recovery in Internet of Things based on Multi-Attribute assistance and Extremely randomized trees [J].
Cheng, Hongju ;
Shi, Yushi ;
Wu, Leihuo ;
Guo, Yingya ;
Xiong, Naixue .
INFORMATION SCIENCES, 2021, 557 :66-83
[8]   Student psychology based optimization algorithm: A new population based optimization algorithm for solving optimization problems [J].
Das, Bikash ;
Mukherjee, V. ;
Das, Debapriya .
ADVANCES IN ENGINEERING SOFTWARE, 2020, 146
[9]   Deep Fuzzy Clustering-A Representation Learning Approach [J].
Feng, Qiying ;
Chen, Long ;
Chen, C. L. Philip ;
Guo, Li .
IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2020, 28 (07) :1420-1433
[10]  
Fisher RA, 1988, UCI Machine Learning Repository