Abstract

Classification is a process of grouping or placing data into appropriate categories or classes based on specificattributes or features to predict labels or classes of new data based on patternsobserved from previously trained data. Implementing this process uses classification algorithms such asNaïve Bayes, Support Vector Machine,and Random Forest. However, the classification algorithm cannotclassify data optimally due to the challenges in dealing with variousdata sets. Not all available featureswillmake a solidcontribution to the label of the data class, often in the form of noise or interference. For this reason, it is necessary to carry out a feature selection process. Currently, many feature selection processes have been carried out using correlation values from chi-square and gain-information, but the accuracy of the resultsis often still not good enough. This is because the chi-square and gain-information values are fixed. So,the selection of features is minimaland is not based on the previous learning process or what is known as heuristics. For this reason, in this research,several auxiliary algorithms are introduced to improve the performance of the classification algorithm, namely the meta-heuristic algorithm. Meta-heuristic algorithms are search techniques used to solve complexoptimization problems, and these algorithms can help provide reasonable solutions in a shorter time thanexact methods. In its operation, the metaheuristic algorithm optimizes the feature selection process,which will later be processed using the classification algorithm.Three (3) meta-heuristics were implemented, namely Genetic Algorithm, Particle Swarm Optimization, and Cuckoo Search Algorithm; the experiment was conducted, and the results were collected and analyzed. The result shows that combining Naive Bayes and Genetic Algorithmgives the best performance regarding higher accuracy improvementat +23.77%.

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.