8 August 2018 in International Journal of Intelligent Systems and Applications
Computational Intelligence (CI) is an as of emerging area in addressing complex real world problems. The WOA has taken its root from the collective intelligent foraging behavior of humpback whales (Megaptera Novaeangliae). The standard WOA is suffers from the selection of best agent while whales searching and encircling prey. This research paper deals with the multi-swarm cooperative strategies for finding the best agents which balances the two phase's exploration and exploitation. The performance of invoked Multi-Swarm cooperative strategies into standard WOA i.e, MsWOA is first benchmarked on a set of 23 standard mathematical benchmark function problems which includes 7 Uni-Modal, 6 Multi-modal and 10 fixed dimension multimodal functions. The obtained graphical and statistical results have been portrayed along with the previously established techniques. The obtained results depicts that the proposed cooperative strategies for WOA outperforms in solving optimization problems of standard benchmark functions. This paper also studies the numerical efficiency of proposed techniques on the problem of data clustering where 10 real data clustering problems have been taken from data repository https://archive.ics.uci.edu.data. Statistical results for the obtained cluster centroids, intra-cluster distances and inter-cluster distances confirms that the cooperative strategies for best whale agent selection improves the performance WOA for function optimization problems as well as data clustering problems.
1 January 2018 in International Journal of Software Science and Computational Intelligence
This article describes how clustering is an attractive and major task in data mining in which particular set of objects are grouped according to their similarities based on some criteria. Among the numerous algorithms, k-Means is the best and efficient in address clustering problems. Any expert system is said to be good, only if it returns the optimal data clusters. The challenge of optimal clustering lies in finding the optimal number of clusters and identifying all the data groups correctly which is a NP-hard problem. Recently a new optimization algorithm TOA was developed to address these problems. However, the standard TOA is too often trapped at the local optima and premature convergence. To overcome this, this article proposes CTOA. The main objective of embedding chaotic maps into standard TOA is to compute and automatically adapt the internal parameters. The proposed CTOA is first benchmarked on standard mathematical functions and later applied to 10 data clustering problems. The obtained graphical and statistical results along with comparisons illustrate the capabilities of CTOA regarding accuracy and robustness