Feature Selection for Colon Cancer Detection Using K-Means Clustering and Modified Harmony Search Algorithm

نویسندگان

چکیده

This paper proposes a feature selection method that is effective in distinguishing colorectal cancer patients from normal individuals using K-means clustering and the modified harmony search algorithm. As genetic cause of originates mutations genes, it important to classify presence or absence through gene information. The proposed methodology consists four steps. First, original data are Z-normalized by preprocessing. Candidate genes then selected Fisher score. Next, one representative each cluster after candidate clustered clustering. Finally, carried out combination created applied classification model verified 5-fold cross-validation. obtained accuracy up 94.36%. Furthermore, on comparing with other methods, we prove performs well classifying cancer. Moreover, believe can be not only but also gene-related diseases.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Data Clustering Algorithm Using Modified Krill Herd Algorithm and K-MEANS

Data clustering is the process of partitioning a set of data objects into meaning clusters or groups. Due to the vast usage of clustering algorithms in many fields, a lot of research is still going on to find the best and efficient clustering algorithm. K-means is simple and easy to implement, but it suffers from initialization of cluster center and hence trapped in local optimum. In this paper...

متن کامل

Modified K-Means Algorithm for Genetic Clustering

The K-Means Clustering Approach is one of main algorithms in the literature of Pattern recognition and Machine Learning. Yet, due to the random selection of cluster centers and the adherence of results to initial cluster centers, the risk of trapping into local optimality ever exists. In this paper, inspired by a genetic algorithm which is based on the K-means method , a new approach is develop...

متن کامل

An Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification

The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...

متن کامل

A Novel Multilayer Data Clustering Framework based on Feature Selection and Modified K-Means Algorithm

With the rapid development of computer science and technology, the data analysis technique has been a hottest research area in the pattern recognition research community. Cluster analysis is an important step in data mining. For clustering, various multi-objective techniques are evolved, which can automatically partition the data. In this paper, we propose a novel multilayer data clustering fra...

متن کامل

An Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification

The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2021

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math9050570