Feature Selection And Clustering By Multi-objective Optimization

Journal of Advances in Computer Research

شناسنامه علمی شماره، دوره 8، شماره 3 - شماره پیاپی 29، آبان 2017، صفحه 69-77   

نویسندگان

Seyedeh Mohtaram Daryabari¹؛ Farhad Ramezani^{* 2}

¹Master Student at Department of Computer Science, University College of Rouzbahan, Sari, Iran

²Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran

چکیده

In this paper, feature selection and clustering is formulated simultaneously by using evolutional multi-objective algorithm. Archived multi-objective NSGA-II is hybridized with k-medoids algorithm to use global searching capabilities of GA with local searching capabilities of k-medoids for suitable centers of clusters and selecting suitable subset of features identifying the correct partitioning. Number of clusters should be determined as an input parameter by user. After determining number of clusters, archive string be generate randomly. In every solution of archived, center of clusters and features is determined. Objective functions are inter-cluster distance, intra-cluster distance and number of feature selection. Three objective functions are optimized simultaneously for partitioning and feature selection. Crossover and mutation operators are modified to solve the problem. In order to selecting final solution from pareto front, are modified to solve the problem is calculated. The Proposed algorithm were compared with other three clustering algorithms on seven UCI standard datasets and could improve results averagely 0.09 percent compared to FeaClusMoo, 0.28 percent compared to VGAPS-Clustering and 0.49 percent compared to K-means.

کلیدواژه‌ها

Clustering؛ Data Mining؛ feature selection؛ Multi-objective optimization؛ NSGA-II