Comparison of Parallel Distributed Metaheuristic Optimization Algorithms in Computing Reducts

被引:0
作者
Noor, Fazal [1 ]
机构
[1] Islamic Univ Madina, Fac Comp & Informat Syst, Madinah, Saudi Arabia
来源
INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY | 2020年 / 20卷 / 08期
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Optimization algorithms have been applied in many fields. This paper presents performance of Genetics Algorithm and Runner-Roots Algorithm in computation of Reducts. An important area of research in Data Mining is knowledge discovery. Massive amounts of data exists in the health industry and problem is to sift through it, removing redundancy and at the same time retaining enough information to base decisions upon. As the amounts of data is huge, it is required use parallel distributed optimization methods for efficient search and PC Clusters for fast computations. The results indicate the huge benefits of parallel distributed systems to be utilized in such applications.
引用
收藏
页码:214 / 218
页数:5
相关论文
共 8 条
[1]  
Grbovic J. P., 2007, J CLUSTER COMPUTING, V10
[2]  
Komorowski J., Rough Sets: A Tutorial
[3]  
Lacy CF., 2008, Drug Information Handbook, V17th
[4]  
Leko A., 2008, IEEE S PAR DISTR PRO, P1
[5]  
Merrikh-Bayat, RUNNER ROOT ALGORITH
[6]   ROUGH SETS [J].
PAWLAK, Z .
INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1982, 11 (05) :341-356
[7]  
Rahman MM, 2005, LECT NOTES COMPUT SC, V3776, P714
[8]  
WrOblewski J., 1995, I COMPUTER SCI REPOR