Abstract

There are variety of methods available to solve multi-objective optimization problems, very few utilizes criterion linkage between data objects in the searching phase, to improve final result. This article proposes an evolutionary clustering algorithm for multi-objective optimization. This paper aims to identify more relevant features based on criterion knowledge from the given data sets and also adopts neighborhood learning to improve the diversity and efficacy of the algorithm. This research is an extension of the previous work named neighborhood learning using k-means genetic algorithm (FS-NLMOGA) for multi-objective optimization which maximizes the compactness of the cluster and accuracy of the solution through constrained feature selection. The proposed objective finds the closest feature subset from the selected features of the data sets that also minimizes the cost while maintains the quality of the solution. The resultant cluster were analyzed 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 .

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.