An enhanced machine learning approach for effective prediction of IgA nephropathy patients with severe proteinuria based on clinical data.

IgA Nephropathy (IgAN) is a disease of the glomeruli that may eventually lead to chronic kidney disease or kidney failure. The signs and symptoms of IgAN nephropathy are usually not specific enough and are similar to those of other glomerular or inflammatory diseases. This makes a correct diagnosis more difficult. This study collected data from a sample of adult patients diagnosed with primary IgAN at the First Affiliated Hospital of Wenzhou Medical University, with proteinuria ≥1 g/d at the time of diagnosis. Based on these samples, we propose a machine learning framework based on weIghted meaN oF vectOrs (INFO). An enhanced COINFO algorithm is proposed by merging INFO, Cauchy Mutation (CM) and Oppositional-based Learning (OBL) strategies. At the same time, COINFO and Support Vector Machine (SVM) were integrated to construct the BCOINFO-SVM framework for IgAN diagnosis and prediction. Initially, the proposed enhanced COINFO is evaluated using the IEEE CEC2017 benchmark problems, with the outcomes demonstrating its efficient optimization capability and accuracy in convergence. Furthermore, the feature selection capability of the proposed method is verified on the public medical datasets. Finally, the auxiliary diagnostic experiment was carried out through IgAN real sample data. The results demonstrate that the proposed BCOINFO-SVM can screen out essential features such as High-Density Lipoprotein (HDL), Uric Acid (UA), Cardiovascular Disease (CVD), Hypertension and Diabetes. Simultaneously, the BCOINFO-SVM model achieves an accuracy of 98.56%, with sensitivity at 96.08% and specificity at 97.73%, making it a potential auxiliary diagnostic model for IgAN.

A regularized stochastic configuration network based on weighted mean of vectors for regression.

The stochastic configuration network (SCN) randomly configures the input weights and biases of hidden layers under a set of inequality constraints to guarantee its universal approximation property. The SCN has demonstrated great potential for fast and efficient data modeling. However, the prediction accuracy and convergence rate of SCN are frequently impacted by the parameter settings of the model. The weighted mean of vectors (INFO) is an innovative swarm intelligence optimization algorithm, with an optimization procedure consisting of three phases: updating rule, vector combining, and a local search. This article aimed at establishing a new regularized SCN based on the weighted mean of vectors (RSCN-INFO) to optimize its parameter selection and network structure. The regularization term that combines the ridge method with the residual error feedback was introduced into the objective function in order to dynamically adjust the training parameters. Meanwhile, INFO was employed to automatically explore an appropriate four-dimensional parameter vector for RSCN. The selected parameters may lead to a compact network architecture with a faster reduction of the network residual error. Simulation results over some benchmark datasets demonstrated that the proposed RSCN-INFO showed superior performance with respect to parameter setting, fast convergence, and network compactness compared with other contrast algorithms.

A modified weighted mean of vectors optimizer for Chronic Kidney disease classification.

Chronic kidney Disease (CKD), also known as chronic renal disease, is an illness that affects the majority of adults and is defined by a progressive decrease in kidney function over time, particularly in those with diabetes and high blood pressure. Metaheuristic (MH) algorithms based machine learning classifiers have become reliable for medical treatment. The weIghted meaN oF vectOrs (INFO) is a recently developed MH but suffers from a fall into local optimal and slow convergence speed. Therefore, to improve INFO, a modified INFO (mINFO) with two enhancement strategies has been developed. The developed variant utilizes the Opposition-Based Learning (OBL) to improve the local search ability to avoid trapping into the local optimum, and the Dynamic Candidate Solution (DCS) is used to overcome the premature convergence problem in INFO and achieve the appropriate balance between exploration and exploitation ability. The performance of the proposed mINFO based on the k-Nearest Neighbor (kNN) classifier is evaluated on the complex CEC'22 test suite and applied to predict Chronic Kidney Disease (CKD) on datasets extracted from UCI. The statistical results revealed the superiority of mINFO compared with several well-known MH algorithms, including the Harris Hawks Optimization (HHO), the Hunger Games Search (HGS) algorithm, the Moth-Flame Optimization (MFO) algorithm, the Whale Optimization Algorithm (WOA), the Sine Cosine Algorithm (SCA), the Gradient-Based Optimizer (GBO), and the original INFO algorithm. According to our knowledge, this paper is the first of its sort to try employing the proposed mINFO for solving the CEC'22 test suite. Furthermore, the experimental results of mINFO-kNN for classifying two CKD datasets demonstrated its superiority with an overall classification accuracy of 93.17% on two CKD datasets over other competitors.