Multi-Objective Optimization to Identify High Quality Clusters with Close Referential Point using Evolutionary Clustering Techniques
DOI:
https://doi.org/10.51983/ajcst-2018.7.3.1894Keywords:
Multi-Objective Optimization, Reference Point Learning, Evolutionary Clustering, Feature Selection, High Quality Data ClustersAbstract
Most of the real-world optimization problems have multiple objectives to deal with. Satisfying one objective at a time may lead to the huge deviation in other. This paper uses criterion knowledge ranking algorithm solving multi-objective optimization problems. The aim of this research paper is to solve a multi-objective optimization algorithm with close reference point learning method to identify high quality data clusters. A Simple crossover measure is used to quantify the diversity of the whole set, by considering all patterns as a complete entity. In this paper, the task of identifying high quality data clusters using close reference points is proposed to solve multi-objective optimization problem using evolutionary clustering techniques. The proposed algorithm finds the closest feature from the selected features of the data sets that also minimizes the cost while maintains the quality of the solution by producing better convergence. The resultant clusters were analysed and validated using cluster validity indexes. The proposed algorithm is tested with several UCI real-life data sets. The experimental results substantiates that the algorithm is efficient and robust.
References
H. R. Cheshmehgaz, H. Haron, and A. Sharifi, "The review of multiple evolutionary searches and multi-objective evolutionary algorithm," Artificial Intelligence, pp. 1-33, 2013.
O. Schutze, M. Laumanns, C. A. C. Collo and E. G. Talbi, "Computing gap-free Pareto front approximations with stochastic search algorithms," Evolu. Compt., vol. 18, no. 1, pp. 65-96, 2010.
Sk. M. Islam, S. Das, S. Ghosh, S. Roy and P. N. Suganthan, "An adaptive differential evolution algorithm with novel mutation and crossover strategies for global numerical optimization," IEEE Trans. SMC., vol. 12, no. 2, pp. 282-500, 2012.
Y. Wu, L. Le, Q. Liu, E. Chen, N. Jing Yuan, G. Guo, and X. Xie, "Relevance meets coverage: A unified framework to generate diversified recommendations," ACM Trans. Intell. Syst. Technol., vol. 7, no. 3, pp. 39.1-39.30, 2016.
J. Yin, Z. Zheng, L. Cao, Y. Song, and W. Wei, "Efficiently mining top-k high utility sequential patterns," in IEEE International Conference on Data Mining, pp. 1259–1264, 2013.
M. Zihayat and A. An, "Mining top-k high utility patterns over data streams," Inf. Sci., vol. 285, no. 20, pp. 138–161, 2014.
H. Ryang and U. Yun, "Top-k high utility pattern mining with effective threshold raising strategies," Knowl.-Based Syst., vol. 76, pp. 109–126, 2015.
S. Vincent Tseng, Chengwei Wu, Philippe Fournierviger, and Philip S. Yu, "Efficient algorithms for mining top-k high utility itemsets," IEEE Trans. Knowl. Data Eng., vol. 28, no. 1, pp. 54–67, 2016.
M. Hammar, A. Isaacs, and T. Ray, "A Pareto corner search evolutionary algorithm and dimensionality reduction in many-objective optimization problem," IEEE Trans. Evolu. Compt., vol. 15, no. 4, pp. 539-556, 2011.
M. Anusha and J. G. R. Sathiaseelan, "An Improved K-Means Genetic Algorithm for Multi-objective Optimization," International Journal of Applied Engineering Research, pp. 228-231, 2015.
M. Anusha and J. G. R. Sathiaseelan, "An Empirical Study on Multi-Objective Genetic Algorithms using Clustering Techniques," International Journal of Advanced Intelligence Paradigms, vol. 8, no. 3, pp. 343-354, UK, 2016.
M. Anusha and J. G. R .Sathiaseelan, "Feature Selection using K-Means Genetic Algorithm for Multi-objective Optimization," Procedia Computer Science, vol. 57, pp. 1074-1080. Elsevier B.V., Netherlands, 2015.
M. Anusha and J. G. R. Sathiaseelan, "An Enhanced K-means Genetic Algorithms for Optimal Clustering," IEEE International Conference on Computational Intelligence and Computing Research (ICCIC), pp. 580-584, 2014.
Zihayat Morteza and Aijun An, "Mining top-k high utility patterns over data streams," Inf. Sci., vol. 285, no. 20, pp. 138–161, 2014.
Ryang Heungmo and Yun Unil, "Top-k high utility pattern mining with effective threshold raising strategies," Knowl.-Based Syst., vol. 76, pp. 109–126, 2015.
Yi Yang, Da Yan, Huanhuan Wu, James Cheng, Shuigeng Zhou, John C. S. Lui, "Diversified temporal subgraph pattern mining," in Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1965–1974, 2016.
Vincent S. Tseng, Cheng-Wei Wu, Bai-En Shie, Philip S. Yu, "UP-growth: an efficient algorithm for high utility itemset mining," in Proceedings of ACM SIGKDD Conference on Knowledge Discovery and Data Mining, ACM, pp. 253–262, 2010.
S. Kannimuthu and K. Premalatha, "Discovery of high utility itemsets using genetic algorithm with ranked mutation," Appl. Artif. Intell., vol. 28, no. 4, pp. 337–359, 2014.
Jerry Chun-Wei Lin, Lu Yang, Philippe Fournier-Viger, Tzung-Pei Hong, Miroslav Voznak, "A binary PSO approach to mine high-utility itemsets," Soft Comput., vol. 21, pp. 5103–5121, 2017.
Jimmy Mingtai Wu, Justin Zhan, Jerry Chunwei Lin, "An ACO-based approach to mine high-utility itemsets," Knowl.-Based Syst., vol. 116, pp. 102–113, 2017.
M. Anusha and J. G. R. Sathiaseelan, "Evolutionary Clustering Algorithm using Criterion-Knowledge-Ranking for Multi-objective Optimization," Wireless Personal Communication, Springer, vol. 94, pp. 2009-2030, Springer, USA, 2017.
M. Anusha and J. G. R. Sathiaseelan, "An Improved K-Means Genetic Algorithm for Multi-objective Optimization," International Journal of Applied Engineering Research, pp. 228-231, 2015.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2018 The Research Publication
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
