A Survey on Feature Selection Algorithms

One major component of machine learning is feature analysis which comprises of mainly two processes: feature selection and feature extraction. Due to its applications in several areas including data mining, soft computing and big data analysis, feature selection has got a reasonable importance. This paper presents an introductory concept of feature selection with various inherent approaches. The paper surveys historic developments reported in feature selection with supervised and unsupervised methods. The recent developments with the state of the art in the on-going feature selection algorithms have also been summarized in the paper including their hybridizations. DOI: 10.17762/ijritcc2321-8169.16043

HYBRID METODE BOOSTRAP DAN TEKNIK IMPUTASI PADA METODE C4-5 UNTUK PREDIKSI PENYAKIT GINJAL KRONIS

Missing values is a serious problem that most often found in real data today. The C4.5 method is a popular classification predictive modeling used because of its ease of implementation. However, C4.5 is still weak when testing data that contains large missing. In this study we used a hybrid approach the bootstrap method and k-NN imputation to overcome missing values. The proposed method tested using Chronic Kidney Disease (CKD) data, and evaluated using accuracy and AUC. The results showed that the proposed method was superior in overcoming missing values in CKD. It can be concluded that the proposed method is able to overcome missing values for chronic kidney disease prediction

A Decomposition Algorithm for Learning Bayesian Networks Based on Scoring Function

Learning Bayesian network (BN) structure from data is a typical NP-hard problem. But almost existing algorithms have the very high complexity when the number of variables is large. In order to solve this problem(s), we present an algorithm that integrates with a decomposition-based approach and a scoring-function-based approach for learning BN structures. Firstly, the proposed algorithm decomposes the moral graph of BN into its maximal prime subgraphs. Then it orientates the local edges in each subgraph by the K2-scoring greedy searching. The last step is combining directed subgraphs to obtain final BN structure. The theoretical and experimental results show that our algorithm can efficiently and accurately identify complex network structures from small data set