Identification of diagnostic biomarkers of rheumatoid arthritis based on machine learning-assisted comprehensive bioinformatics and its correlation with immune cells

Background

Rheumatoid arthritis (RA) is a chronic systemic autoimmune disease characterized by inflammatory cell infiltration, which can lead to chronic disability, joint destruction and loss of function. At present, the pathogenesis of RA is still unclear. The purpose of this study is to explore the potential biomarkers and immune molecular mechanisms of rheumatoid arthritis through machine learning-assisted bioinformatics analysis, in order to provide reference for the early diagnosis and treatment of RA disease.

Methods

RA gene chips were screened from the public gene GEO database, and batch correction of different groups of RA gene chips was performed using Strawberry Perl. DEGs were obtained using the limma package of R software, and functional enrichment analysis such as gene ontology (GO), Kyoto Encyclopedia of Genes and Genomes (KEGG), disease ontology (DO), and gene set (GSEA) were performed. Three machine learning methods, least absolute shrinkage and selection operator regression (LASSO), support vector machine recursive feature elimination (SVM-RFE) and random forest tree (Random Forest), were used to identify potential biomarkers of RA. The validation group data set was used to verify and further confirm its expression and diagnostic value. In addition, CIBERSORT algorithm was used to evaluate the infiltration of immune cells in RA and control samples, and the correlation between confirmed RA diagnostic biomarkers and immune cells was analyzed.

Results

Through feature screening, 79 key DEGs were obtained, mainly involving virus response, Parkinson's pathway, dermatitis and cell junction components. A total of 29 hub genes were screened by LASSO regression, 34 hub genes were screened by SVM-RFE, and 39 hub genes were screened by Random Forest. Combined with the three algorithms, a total of 12 hub genes were obtained. Through the expression and diagnostic value verification in the validation group data set, 7 genes that can be used as diagnostic biomarkers for RA were preliminarily confirmed. At the same time, the correlation analysis of immune cells found that γδT cells, CD4+ memory activated T cells, activated dendritic cells and other immune cells were positively correlated with multiple RA diagnostic biomarkers, CD4+ naive T cells, regulatory T cells and other immune cells were negatively correlated with multiple RA diagnostic biomarkers.

Conclusions

The results of novel characteristic gene analysis of RA showed that KYNU, EVI2A, CD52, C1QB, BATF, AIM2 and NDC80 had good diagnostic and clinical value for the diagnosis of RA, and were closely related to immune cells. Therefore, these seven DEGs may become new diagnostic markers and immunotherapy markers for RA.

Abnormal Brachial Plexus Differentiation from Routine Magnetic Resonance Imaging: An AI-based Approach

Automatic abnormality identification of brachial plexus (BP) from normal magnetic resonance imaging to localize and identify a neurologic injury in clinical practice (MRI) is still a novel topic in brachial plexopathy. This study developed and evaluated an approach to differentiate abnormal BP with artificial intelligence (AI) over three commonly used MRI sequences, i.e. T1, FLUID sensitive and post-gadolinium sequences. A BP dataset was collected by radiological experts and a semi-supervised artificial intelligence method was used to segment the BP (based on nnU-net). Hereafter, a radiomics method was utilized to extract 107 shape and texture features from these ROIs. From various machine learning methods, we selected six widely recognized classifiers for training our Brachial plexus (BP) models and assessing their efficacy. To optimize these models, we introduced a dynamic feature selection approach aimed at discarding redundant and less informative features. Our experimental findings demonstrated that, in the context of identifying abnormal BP cases, shape features displayed heightened sensitivity compared to texture features. Notably, both the Logistic classifier and Bagging classifier outperformed other methods in our study. These evaluations illuminated the exceptional performance of our model trained on FLUID-sensitive sequences, which notably exceeded the results of both T1 and post-gadolinium sequences. Crucially, our analysis highlighted that both its classification accuracies and AUC score (area under the curve of receiver operating characteristics) over FLUID-sensitive sequence exceeded 90%. This outcome served as a robust experimental validation, affirming the substantial potential and strong feasibility of integrating AI into clinical practice.

Identification of endocrine-disrupting chemicals targeting key DCM-associated genes via bioinformatics and machine learning

Dilated cardiomyopathy (DCM) is a primary cause of heart failure (HF), with the incidence of HF increasing consistently in recent years. DCM pathogenesis involves a combination of inherited predisposition and environmental factors. Endocrine-disrupting chemicals (EDCs) are exogenous chemicals that interfere with endogenous hormone action and are capable of targeting various organs, including the heart. However, the impact of these disruptors on heart disease through their effects on genes remains underexplored. In this study, we aimed to explore key DCM-related genes using machine learning (ML) and the construction of a predictive model. Using the Gene Expression Omnibus (GEO) database, we screened differentially expressed genes (DEGs) and performed enrichment analyses of Gene Ontology (GO) and Kyoto Encyclopedia of Genes and Genomes (KEGG) pathways related to DCM. Through ML techniques combining maximum relevance minimum redundancy (mRMR) and least absolute shrinkage and selection operator (LASSO) logistic regression, we identified key genes for predicting DCM (IL1RL1, SEZ6L, SFRP4, COL22A1, RNASE2, HB). Based on these key genes, 79 EDCs with the potential to affect DCM were identified, among which 4 (3,4-dichloroaniline, fenitrothion, pyrene, and isoproturon) have not been previously associated with DCM. These findings establish a novel relationship between the EDCs mediated by key genes and the development of DCM.

A novel method for detection of pancreatic Ductal Adenocarcinoma using explainable machine learning

BACKGROUND AND OBJECTIVE

Pancreatic Ductal Adenocarcinoma (PDAC) is a form of pancreatic cancer that is one of the primary causes of cancer-related deaths globally, with less than 10 % of the five years survival rate. The prognosis of pancreatic cancer has remained poor in the last four decades, mainly due to the lack of early diagnostic mechanisms. This study proposes a novel method for detecting PDAC using explainable and supervised machine learning from Raman spectroscopic signals.

METHODS

An insightful feature set consisting of statistical, peak, and extended empirical mode decomposition features is selected using the support vector machine recursive feature elimination method integrated with a correlation bias reduction. Explicable features successfully identified mutations in Kirsten rat sarcoma viral oncogene homolog (KRAS) and tumor suppressor protein53 (TP53) in the fingerprint region for the first time in the literature. PDAC and normal pancreas are classified using K-nearest neighbor, linear discriminant analysis, and support vector machine classifiers.

RESULTS

This study achieved a classification accuracy of 98.5% using a nonlinear support vector machine. Our proposed method reduced test time by 28.5 % and saved 85.6 % memory utilization, which reduces complexity significantly and is more accurate than the state-of-the-art method. The generalization of the proposed method is assessed by fifteen-fold cross-validation, and its performance is evaluated using accuracy, specificity, sensitivity, and receiver operating characteristic curves.

CONCLUSIONS

In this study, we proposed a method to detect and define the fingerprint region for PDAC using explainable machine learning. This simple, accurate, and efficient method for PDAC detection in mice could be generalized to examine human pancreatic cancer and provide a basis for precise chemotherapy for early cancer treatment.

Maximum margin and global criterion based-recursive feature selection

In this research paper, we aim to investigate and address the limitations of recursive feature elimination (RFE) and its variants in high-dimensional feature selection tasks. We identify two main challenges associated with these methods. Firstly, the feature ranking criterion utilized in these approaches is inconsistent with the maximum-margin theory. Secondly, the computation of the criterion is performed locally, lacking the ability to measure the importance of features globally. To overcome these challenges, we propose a novel feature ranking criterion called Maximum Margin and Global (MMG) criterion. This criterion utilizes the classification margin to determine the importance of features and computes it globally, enabling a more accurate assessment of feature importance. Moreover, we introduce an optimal feature subset evaluation algorithm that leverages the MMG criterion to determine the best subset of features. To enhance the efficiency of the proposed algorithms, we provide two alpha seeding strategies that significantly reduce computational costs while maintaining high accuracy. These strategies offer a practical means to expedite the feature selection process. Through extensive experiments conducted on ten benchmark datasets, we demonstrate that our proposed algorithms outperform current state-of-the-art methods. Additionally, the alpha seeding strategies yield significant speedups, further enhancing the efficiency of the feature selection process.

A Unified Multi-Class Feature Selection Framework for Microarray Data

In feature selection research, simultaneous multi-class feature selection technologies are popular because they simultaneously select informative features for all classes. Recursive feature elimination (RFE) methods are state-of-the-art binary feature selection algorithms. However, extending existing RFE algorithms to multi-class tasks may increase the computational cost and lead to performance degradation. With this motivation, we introduce a unified multi-class feature selection (UFS) framework for randomization-based neural networks to address these challenges. First, we propose a new multi-class feature ranking criterion using the output weights of neural networks. The heuristic underlying this criterion is that "the importance of a feature should be related to the magnitude of the output weights of a neural network". Subsequently, the UFS framework utilizes the original features to construct a training model based on a randomization-based neural network, ranks these features by the criterion of the norm of the output weights, and recursively removes a feature with the lowest ranking score. Extensive experiments on 15 real-world datasets suggest that our proposed framework outperforms state-of-the-art algorithms. The code of UFS is available at https://github.com/SVMrelated/UFS.git.

Revealing the diagnostic value and immune infiltration of senescence-related genes in endometriosis: a combined single-cell and machine learning analysis

Introduction: Endometriosis is a prevalent and recurrent medical condition associated with symptoms such as pelvic discomfort, dysmenorrhea, and reproductive challenges. Furthermore, it has the potential to progress into a malignant state, significantly impacting the quality of life for affected individuals. Despite its significance, there is currently a lack of precise and non-invasive diagnostic techniques for this condition. Methods: In this study, we leveraged microarray datasets and employed a multifaceted approach. We conducted differential gene analysis, implemented weighted gene co-expression network analysis (WGCNA), and utilized machine learning algorithms, including random forest, support vector machine, and LASSO analysis, to comprehensively explore senescence-related genes (SRGs) associated with endometriosis. Discussion: Our comprehensive analysis, which also encompassed profiling of immune cell infiltration and single-cell analysis, highlights the therapeutic potential of this gene assemblage as promising targets for alleviating endometriosis. Furthermore, the integration of these biomarkers into diagnostic protocols promises to enhance diagnostic precision, offering a more effective diagnostic journey for future endometriosis patients in clinical settings. Results: Our meticulous investigation led to the identification of a cluster of genes, namely BAK1, LMNA, and FLT1, which emerged as potential discerning biomarkers for endometriosis. These biomarkers were subsequently utilized to construct an artificial neural network classifier model and were graphically represented in the form of a Nomogram.

Identification of key lipid metabolism-related genes in Alzheimer's disease

BACKGROUND

Alzheimer's disease (AD) represents profound degenerative conditions of the brain that cause significant deterioration in memory and cognitive function. Despite extensive research on the significant contribution of lipid metabolism to AD progression, the precise mechanisms remain incompletely understood. Hence, this study aimed to identify key differentially expressed lipid metabolism-related genes (DELMRGs) in AD progression.

METHODS

Comprehensive analyses were performed to determine key DELMRGs in AD compared to controls in GSE122063 dataset from Gene Expression Omnibus. Additionally, the ssGSEA algorithm was utilized for estimating immune cell levels. Subsequently, correlations between key DELMRGs and each immune cell were calculated specifically in AD samples. The key DELMRGs expression levels were validated via two external datasets. Furthermore, gene set enrichment analysis (GSEA) was utilized for deriving associated pathways of key DELMRGs. Additionally, miRNA-TF regulatory networks of the key DELMRGs were constructed using the miRDB, NetworkAnalyst 3.0, and Cytoscape software. Finally, based on key DELMRGs, AD samples were further segmented into two subclusters via consensus clustering, and immune cell patterns and pathway differences between the two subclusters were examined.

RESULTS

Seventy up-regulated and 100 down-regulated DELMRGs were identified. Subsequently, three key DELMRGs (DLD, PLPP2, and PLAAT4) were determined utilizing three algorithms [(i) LASSO, (ii) SVM-RFE, and (iii) random forest]. Specifically, PLPP2 and PLAAT4 were up-regulated, while DLD exhibited downregulation in AD cerebral cortex tissue. This was validated in two separate external datasets (GSE132903 and GSE33000). The AD group exhibited significantly altered immune cell composition compared to controls. In addition, GSEA identified various pathways commonly associated with three key DELMRGs. Moreover, the regulatory network of miRNA-TF for key DELMRGs was established. Finally, significant differences in immune cell levels and several pathways were identified between the two subclusters.

CONCLUSION

This study identified DLD, PLPP2, and PLAAT4 as key DELMRGs in AD progression, providing novel insights for AD prevention/treatment.

An Efficient Feature Selection Algorithm for Gene Families Using NMF and ReliefF

Gene families, which are parts of a genome's information storage hierarchy, play a significant role in the development and diversity of multicellular organisms. Several studies have focused on the characteristics of gene families, such as function, homology, or phenotype. However, statistical and correlation analyses on the distribution of gene family members in the genome have yet to be conducted. Here, a novel framework incorporating gene family analysis and genome selection based on NMF-ReliefF is reported. Specifically, the proposed method starts by obtaining gene families from the TreeFam database and determining the number of gene families within the feature matrix. Then, NMF-ReliefF is used to select features from the gene feature matrix, which is a new feature selection algorithm that overcomes the inefficiencies of traditional methods. Finally, a support vector machine is utilized to classify the acquired features. The results show that the framework achieved an accuracy of 89.1% and an AUC of 0.919 on the insect genome test set. We also employed four microarray gene data sets to evaluate the performance of the NMF-ReliefF algorithm. The outcomes show that the proposed method may strike a delicate balance between robustness and discrimination. Additionally, the proposed method's categorization is superior to state-of-the-art feature selection approaches.

Deciphering the endometrial immune landscape of RIF during the window of implantation from cellular senescence by integrated bioinformatics analysis and machine learning

Recurrent implantation failure (RIF) is an extremely thorny issue in in-vitro fertilization (IVF)-embryo transfer (ET). However, its intricate etiology and pathological mechanisms are still unclear. Nowadays, there has been extensive interest in cellular senescence in RIF, and its involvement in endometrial immune characteristics during the window of implantation (WOI) has captured scholars' growing concerns. Therefore, this study aims to probe into the pathological mechanism of RIF from cellular senescence and investigate the correlation between cellular senescence and endometrial immune characteristics during WOI based on bioinformatics combined with machine learning strategy, so as to elucidate the underlying pathological mechanisms of RIF and to explore novel treatment strategies for RIF. Firstly, the gene sets of GSE26787 and GSE111974 from the Gene Expression Omnibus (GEO) database were included for the weighted gene correlation network analysis (WGCNA), from which we concluded that the genes of the core module were closely related to cell fate decision and immune regulation. Subsequently, we identified 25 cellular senescence-associated differentially expressed genes (DEGs) in RIF by intersecting DEGs with cellular senescence-associated genes from the Cell Senescence (CellAge) database. Moreover, functional enrichment analysis was conducted to further reveal the specific molecular mechanisms by which these molecules regulate cellular senescence and immune pathways. Then, eight signature genes were determined by the machine learning method of support vector machine-recursive feature elimination (SVM-RFE), random forest (RF), and artificial neural network (ANN), comprising LATS1, EHF, DUSP16, ADCK5, PATZ1, DEK, MAP2K1, and ETS2, which were also validated in the testing gene set (GSE106602). Furthermore, distinct immune microenvironment abnormalities in the RIF endometrium during WOI were comprehensively explored and validated in GSE106602, including infiltrating immunocytes, immune function, and the expression profiling of human leukocyte antigen (HLA) genes and immune checkpoint genes. Moreover, the correlation between the eight signature genes with the endometrial immune landscape of RIF was also evaluated. After that, two distinct subtypes with significantly distinct immune infiltration characteristics were identified by consensus clustering analysis based on the eight signature genes. Finally, a "KEGG pathway-RIF signature genes-immune landscape" association network was constructed to intuitively uncover their connection. In conclusion, this study demonstrated that cellular senescence might play a pushing role in the pathological mechanism of RIF, which might be closely related to its impact on the immune microenvironment during the WOI phase. The exploration of the molecular mechanism of cellular senescence in RIF is expected to bring new breakthroughs for disease diagnosis and treatment strategies.

An intelligent neuromarketing system for predicting consumers' future choice from electroencephalography signals

Neuromarketing utilizes Brain-Computer Interface (BCI) technologies to provide insight into consumers responses on marketing stimuli. In order to achieve insight information, marketers spend about $400 billion annually on marketing, promotion, and advertisement using traditional marketing research tools. In addition, these tools like personal depth interviews, surveys, focus group discussions, etc. are expensive and frequently criticized for failing to extract actual consumer preferences. Neuromarketing, on the other hand, promises to overcome such constraints. In this work, an EEG-based neuromarketing framework is employed for predicting consumer future choice (affective attitude) while they view E-commerce products. After preprocessing, three types of features, namely, time, frequency, and time-frequency domain features are extracted. Then, wrapper-based Support Vector Machine-Recursive Feature Elimination (SVM-RFE) along with correlation bias reduction is used for feature selection. Lastly, we use SVM for categorizing positive affective attitude and negative affective attitude. Experiments show that the frontal cortex achieves the best accuracy of 98.67±2.98, 98±3.22, and 98.67±3.52 for 5-fold, 10-fold, and leave-one-subject-out (LOSO) respectively. In addition, among all the channels, F_z achieves best accuracy 90±7.81, 90.67±9.53, and 92.67±7.03 for 5-fold, 10-fold, and LOSO respectively. Subsequently, this work opens the door for implementing such a neuromarketing framework using consumer-grade devices in a real-life setting for marketers. As a result, it is evident that EEG-based neuromarketing technologies can assist brands and enterprises in forecasting future consumer preferences accurately. Hence, it will pave the way for the creation of an intelligent marketing assistive system for neuromarketing applications in future.

Mutational Slime Mould Algorithm for Gene Selection

A large volume of high-dimensional genetic data has been produced in modern medicine and biology fields. Data-driven decision-making is particularly crucial to clinical practice and relevant procedures. However, high-dimensional data in these fields increase the processing complexity and scale. Identifying representative genes and reducing the data's dimensions is often challenging. The purpose of gene selection is to eliminate irrelevant or redundant features to reduce the computational cost and improve classification accuracy. The wrapper gene selection model is based on a feature set, which can reduce the number of features and improve classification accuracy. This paper proposes a wrapper gene selection method based on the slime mould algorithm (SMA) to solve this problem. SMA is a new algorithm with a lot of application space in the feature selection field. This paper improves the original SMA by combining the Cauchy mutation mechanism with the crossover mutation strategy based on differential evolution (DE). Then, the transfer function converts the continuous optimizer into a binary version to solve the gene selection problem. Firstly, the continuous version of the method, ISMA, is tested on 33 classical continuous optimization problems. Then, the effect of the discrete version, or BISMA, was thoroughly studied by comparing it with other gene selection methods on 14 gene expression datasets. Experimental results show that the continuous version of the algorithm achieves an optimal balance between local exploitation and global search capabilities, and the discrete version of the algorithm has the highest accuracy when selecting the least number of genes.

A novel hybrid approach for feature selection enhancement: COVID-19 case study

Feature selection is a promising Artificial Intelligence technique for screening, analysing, predicting, and tracking current COVID-19 patients and likely future patients. Significant applications are developed to track data of confirmed, recovered, and death cases. In this work, we propose a new feature selection method based on a new way of hybridization between filter and wrapper methods. The proposed approach is expected to achieve high classification accuracy with a small feature subset. Specifically, the main contribution of this work is a four steps-based approach organized as follows: First, we remove consecutively duplicate and constant features. Then, we select the highest-ranked feature with Mutual Information. In the last step, we run the 'Backward Feature Elimination' algorithm to delete features from the active subset until a stopping criterion based on the degradation of classification performance is met. We applied the proposed approach to a COVID-19 dataset to test its ability to find the relevant feature for characterizing the disease, such as new cases infected with the virus, people vaccinated, and the number of deaths, to better assess the situation. For evaluation purposes, experiments are conducted at the first stage on the COVID-19 dataset, then on six benchmark datasets that have a high dimensional and large size. The method performance is tracked and measured on these datasets and a comparison with many approaches is provided.

KLF9 and EPYC acting as feature genes for osteoarthritis and their association with immune infiltration

Background

Osteoarthritis, a common degenerative disease of articular cartilage, is characterized by degeneration of articular cartilage, changes in subchondral bone structure, and formation of osteophytes, with main clinical manifestations including increasingly serious swelling, pain, stiffness, deformity, and mobility deficits of the knee joints. With the advent of the big data era, the processing of mass data has evolved into a hot topic and gained a solid foundation from the steadily developed and improved machine learning algorithms. Aiming to provide a reference for the diagnosis and treatment of osteoarthritis, this paper using machine learning identifies the key feature genes of osteoarthritis and explores its relationship with immune infiltration, thereby revealing its pathogenesis at the molecular level.

Methods

From the GEO database, GSE55235 and GSE55457 data were derived as training sets and GSE98918 data as a validation set. Differential gene expressions of the training sets were analyzed, and the LASSO regression model and support vector machine model were established by applying machine learning algorithms. Moreover, their intersection genes were regarded as feature genes, the receiver operator characteristic (ROC) curve was drawn, and the results were verified using the validation set. In addition, the expression spectrum of osteoarthritis was analyzed by immunocyte infiltration and the co-expression correlation between feature genes and immunocytes was construed.

Conclusion

EPYC and KLF9 can be viewed as feature genes for osteoarthritis. The silencing of EPYC and the overexpression of KLF9 are associated with the occurrence of osteoarthritis and immunocyte infiltration.

Analysis of Enterprise Social Responsibility to Employee Psychological Satisfaction Based on Discriminant Least Square Regression

Employee psychological satisfaction is the satisfaction of perception of environmental factors at the psychological and physiological levels, that is, the employees' subjective response to the work situation. How to enhance employee loyalty and psychological satisfaction has always been a hot issue in theoretical and practical research. With the development of artificial intelligence (AI), many AI methods are widely used to find important factors which have significant influences on the psychological satisfaction of employees. Feature selection methods as one kind of AI models can select discriminant features which have high correlation with the outcome. In this study, we first construct 19 factors from enterprise social responsibility. Then we use a discriminant least square regression model to select most relative factors associating with employee psychological satisfaction. Our experimental results show that the psychological satisfaction of employees is very related to salary, security, welfare, occupational health, and fairness. In addition, we find that discriminant least square regression performs better than the comparison feature selection methods we select, and the selected factors are more in line with our perceptions and expectations.

A Novel Recursive Gene Selection Method Based on Least Square Kernel Extreme Learning Machine

This paper presents a recursive feature elimination (RFE) mechanism to select the most informative genes with a least square kernel extreme learning machine (LSKELM) classifier. Describing the generalization ability of LSKELM in a way that is related to small norm of weights, we propose a ranking criterion to evaluate the importance of genes by the norm of weights obtained by LSKELM. The proposed method is called LSKELM-RFE which first employs the original genes to build a LSKELM classifier, and then ranks the genes according to their importance given by the norm of output weights of LSKELM and finally removes a "least important" gene. Benefiting from the random mapping mechanism of the extreme learning machine (ELM) kernel, there are no parameter of LSKELM-RFE needs to be manually tuned. A comparative study among our proposed algorithm and other two famous RFE algorithms has shown that LSKELM-RFE outperforms other RFE algorithms in both the computational cost and generalization ability.

BCI-Based Consumers' Choice Prediction From EEG Signals: An Intelligent Neuromarketing Framework

Neuromarketing relies on Brain Computer Interface (BCI) technology to gain insight into how customers react to marketing stimuli. Marketers spend about $750 billion annually on traditional marketing camping. They use traditional marketing research procedures such as Personal Depth Interviews, Surveys, Focused Group Discussions, and so on, which are frequently criticized for failing to extract true consumer preferences. On the other hand, Neuromarketing promises to overcome such constraints. This work proposes a machine learning framework for predicting consumers' purchase intention (PI) and affective attitude (AA) from analyzing EEG signals. In this work, EEG signals are collected from 20 healthy participants while administering three advertising stimuli settings: product, endorsement, and promotion. After preprocessing, features are extracted in three domains (time, frequency, and time-frequency). Then, after selecting features using wrapper-based methods Recursive Feature Elimination, Support Vector Machine is used for categorizing positive and negative (AA and PI). The experimental results show that proposed framework achieves an accuracy of 84 and 87.00% for PI and AA ensuring the simulation of real-life results. In addition, AA and PI signals show N200 and N400 components when people tend to take decision after visualizing static advertisement. Moreover, negative AA signals shows more dispersion than positive AA signals. Furthermore, this work paves the way for implementing such a neuromarketing framework using consumer-grade EEG devices in a real-life setting. Therefore, it is evident that BCI-based neuromarketing technology can help brands and businesses effectively predict future consumer preferences. Hence, EEG-based neuromarketing technologies can assist brands and enterprizes in accurately forecasting future consumer preferences.

Data-Driven Parameter Selection and Modeling for Concrete Carbonation

Concrete carbonation is known as a stochastic process. Its uncertainties mainly result from parameters that are not considered in prediction models. Parameter selection, therefore, is important. In this paper, based on 8204 sets of data, statistical methods and machine learning techniques were applied to choose appropriate influence factors in terms of three aspects: (1) the correlation between factors and concrete carbonation; (2) factors’ influence on the uncertainties of carbonation depth; and (3) the correlation between factors. Both single parameters and parameter groups were evaluated quantitatively. The results showed that compressive strength had the highest correlation with carbonation depth and that using the aggregate–cement ratio as the parameter significantly reduced the dispersion of carbonation depth to a low level. Machine learning models manifested that selected parameter groups had a large potential in improving the performance of models with fewer parameters. This paper also developed machine learning carbonation models and simplified them to propose a practical model. The results showed that this concise model had a high accuracy on both accelerated and natural carbonation test datasets. For natural carbonation datasets, the mean absolute error of the practical model was 1.56 mm.

A hybrid feature selection algorithm and its application in bioinformatics

Feature selection is an independent technology for high-dimensional datasets that has been widely applied in a variety of fields. With the vast expansion of information, such as bioinformatics data, there has been an urgent need to investigate more effective and accurate methods involving feature selection in recent decades. Here, we proposed the hybrid MMPSO method, by combining the feature ranking method and the heuristic search method, to obtain an optimal subset that can be used for higher classification accuracy. In this study, ten datasets obtained from the UCI Machine Learning Repository were analyzed to demonstrate the superiority of our method. The MMPSO algorithm outperformed other algorithms in terms of classification accuracy while utilizing the same number of features. Then we applied the method to a biological dataset containing gene expression information about liver hepatocellular carcinoma (LIHC) samples obtained from The Cancer Genome Atlas (TCGA) and Genotype-Tissue Expression (GTEx). On the basis of the MMPSO algorithm, we identified a 18-gene signature that performed well in distinguishing normal samples from tumours. Nine of the 18 differentially expressed genes were significantly up-regulated in LIHC tumour samples, and the area under curves (AUC) of the combination seven genes (ADRA2B, ERAP2, NPC1L1, PLVAP, POMC, PYROXD2, TRIM29) in classifying tumours with normal samples was greater than 0.99. Six genes (ADRA2B, PYROXD2, CACHD1, FKBP1B, PRKD1 and RPL7AP6) were significantly correlated with survival time. The MMPSO algorithm can be used to effectively extract features from a high-dimensional dataset, which will provide new clues for identifying biomarkers or therapeutic targets from biological data and more perspectives in tumor research.

Multiple weak supervision for short text classification

For short text classification, insufficient labeled data, data sparsity, and imbalanced classification have become three major challenges. For this, we proposed multiple weak supervision, which can label unlabeled data automatically. Different from prior work, the proposed method can generate probabilistic labels through conditional independent model. What’s more, experiments were conducted to verify the effectiveness of multiple weak supervision. According to experimental results on public dadasets, real datasets and synthetic datasets, unlabeled imbalanced short text classification problem can be solved effectively by multiple weak supervision. Notably, without reducing precision, recall, and F1-score can be improved by adding distant supervision clustering, which can be used to meet different application needs.

Use of relevancy and complementary information for discriminatory gene selection from high-dimensional gene expression data

With the advent of high-throughput technologies, life sciences are generating a huge amount of varied biomolecular data. Global gene expression profiles provide a snapshot of all the genes that are transcribed in a cell or in a tissue under a particular condition. The high-dimensionality of such gene expression data (i.e., very large number of features/genes analyzed with relatively much less number of samples) makes it difficult to identify the key genes (biomarkers) that are truly attributing to a particular phenotype or condition, (such as cancer), de novo. For identifying the key genes from gene expression data, among the existing literature, mutual information (MI) is one of the most successful criteria. However, the correction of MI for finite sample is not taken into account in this regard. It is also important to incorporate dynamic discretization of genes for more relevant gene selection, although this is not considered in the available methods. Besides, it is usually suggested in current studies to remove redundant genes which is particularly inappropriate for biological data, as a group of genes may connect to each other for downstreaming proteins. Thus, despite being redundant, it is needed to add the genes which provide additional useful information for the disease. Addressing these issues, we proposed Mutual information based Gene Selection method (MGS) for selecting informative genes. Moreover, to rank these selected genes, we extended MGS and propose two ranking methods on the selected genes, such as MGS_f—based on frequency and MGS_rf—based on Random Forest. The proposed method not only obtained better classification rates on gene expression datasets derived from different gene expression studies compared to recently reported methods but also detected the key genes relevant to pathways with a causal relationship to the disease, which indicate that it will also able to find the responsible genes for an unknown disease data.

A novel feature selection algorithm based on damping oscillation theory

Feature selection is an important task in big data analysis and information retrieval processing. It reduces the number of features by removing noise, extraneous data. In this paper, one feature subset selection algorithm based on damping oscillation theory and support vector machine classifier is proposed. This algorithm is called the Maximum Kendall coefficient Maximum Euclidean Distance Improved Gray Wolf Optimization algorithm (MKMDIGWO). In MKMDIGWO, first, a filter model based on Kendall coefficient and Euclidean distance is proposed, which is used to measure the correlation and redundancy of the candidate feature subset. Second, the wrapper model is an improved grey wolf optimization algorithm, in which its position update formula has been improved in order to achieve optimal results. Third, the filter model and the wrapper model are dynamically adjusted by the damping oscillation theory to achieve the effect of finding an optimal feature subset. Therefore, MKMDIGWO achieves both the efficiency of the filter model and the high precision of the wrapper model. Experimental results on five UCI public data sets and two microarray data sets have demonstrated the higher classification accuracy of the MKMDIGWO algorithm than that of other four state-of-the-art algorithms. The maximum ACC value of the MKMDIGWO algorithm is at least 0.5% higher than other algorithms on 10 data sets.

Integrating Multilevel Functional Characteristics Reveals Aberrant Neural Patterns during Audiovisual Emotional Processing in Depression

Emotion dysregulation is one of the core features of major depressive disorder (MDD). However, most studies in depression have focused on unimodal emotion processing, whereas emotional perception in daily life is highly dependent on multimodal sensory inputs. Here, we proposed a novel multilevel discriminative framework to identify the altered neural patterns in processing audiovisual emotion in MDD. Seventy-four participants underwent an audiovisual emotional task functional magnetic resonance imaging scanning. Three levels of whole-brain functional features were extracted for each subject, including the task-evoked activation, task-modulated connectivity, combined activation and connectivity. Support vector machine classification and prediction models were built to identify MDD from controls and evaluate clinical relevance. We revealed that complex neural networks including the emotion regulation network (prefrontal areas and limbic-subcortical regions) and the multisensory integration network (lateral temporal cortex and motor areas) had the discriminative power. Moreover, by integrating comprehensive information of local and interactive processes, multilevel models could lead to a substantial increase in classification accuracy and depression severity prediction. Together, we highlight the high representational capacity of machine learning algorithms to characterize the complex network abnormalities associated with emotional regulation and multisensory integration in MDD. These findings provide novel evidence for the neural mechanisms underlying multimodal emotion dysregulation of depression.

An improved DNA-binding hot spot residues prediction method by exploring interfacial neighbor properties

Background

DNA-binding hot spots are dominant and fundamental residues that contribute most of the binding free energy yet accounting for a small portion of protein–DNA interfaces. As experimental methods for identifying hot spots are time-consuming and costly, high-efficiency computational approaches are emerging as alternative pathways to experimental methods.

Results

Herein, we present a new computational method, termed inpPDH, for hot spot prediction. To improve the prediction performance, we extract hybrid features which incorporate traditional features and new interfacial neighbor properties. To remove redundant and irrelevant features, feature selection is employed using a two-step feature selection strategy. Finally, a subset of 7 optimal features are chosen to construct the predictor using support vector machine. The results on the benchmark dataset show that this proposed method yields significantly better prediction accuracy than those previously published methods in the literature. Moreover, a user-friendly web server for inpPDH is well established and is freely available at http://bioinfo.ahu.edu.cn/inpPDH.

Conclusions

We have developed an accurate improved prediction model, inpPDH, for hot spot residues in protein–DNA binding interfaces by given the structure of a protein–DNA complex. Moreover, we identify a comprehensive and useful feature subset including the proposed interfacial neighbor features that has an important strength for identifying hot spot residues. Our results indicate that these features are more effective than the conventional features considered previously, and that the combination of interfacial neighbor features and traditional features may support the creation of a discriminative feature set for efficient prediction of hot spot residues in protein–DNA complexes.

Supplementary information

Supplementary information accompanies this paper at 10.1186/s12859-020-03871-1.

Identifying Drug Resistant miRNAs Using Entropy Based Ranking

MicroRNAs play an important role in controlling drug sensitivity and resistance in cancer. Identification of responsible miRNAs for drug resistance can enhance the effectiveness of treatment. A new set theoretic entropy measure (SPEM) is defined to determine the relevance and level of confidence of miRNAs in deciding their drug resistant nature. Here, a pattern is represented by a pair of values. One of them implies the degree of its belongingness (fuzzy membership) to a class and the other represents the actual class of origin (crisp membership). A measure, called granular probability, is defined that determines the confidence level of having a particular pair of membership values. The granules used to compute the said probability are formed by a histogram based method where each bin of a histogram is considered as one granule. The width and number of the bins are automatically determined by the algorithm. The set thus defined, comprising a pair of membership values and the confidence level for having them, is used for the computation of SPEM and thereby identifying the drug resistant miRNAs. The efficiency of SPEM is demonstrated extensively on six data sets. While the achieved F-score in classifying sensitive and resistant samples ranges between 0.31 & 0.50 using all the miRNAs by SVM classifier, the same score varies from 0.67 to 0.94 using only the top 1 percent drug resistant miRNAs. Superiority of the proposed method as compared to some existing ones is established in terms of F-score. The significance of the top 1 percent miRNAs in corresponding cancer is also verified by the different articles based on biological investigations. Source code of SPEM is available at http://www.jayanta.droppages.com/SPEM.html.

A machine learning method based on the genetic and world competitive contests algorithms for selecting genes or features in biological applications

Gene/feature selection is an essential preprocessing step for creating models using machine learning techniques. It also plays a critical role in different biological applications such as the identification of biomarkers. Although many feature/gene selection algorithms and methods have been introduced, they may suffer from problems such as parameter tuning or low level of performance. To tackle such limitations, in this study, a universal wrapper approach is introduced based on our introduced optimization algorithm and the genetic algorithm (GA). In the proposed approach, candidate solutions have variable lengths, and a support vector machine scores them. To show the usefulness of the method, thirteen classification and regression-based datasets with different properties were chosen from various biological scopes, including drug discovery, cancer diagnostics, clinical applications, etc. Our findings confirmed that the proposed method outperforms most of the other currently used approaches and can also free the users from difficulties related to the tuning of various parameters. As a result, users may optimize their biological applications such as obtaining a biomarker diagnostic kit with the minimum number of genes and maximum separability power.

Comprehensive classification models based on amygdala radiomic features for Alzheimer's disease and mild cognitive impairment

The amygdala is an important part of the medial temporal lobe and plays a pivotal role in the emotional and cognitive function. The aim of this study was to build and validate comprehensive classification models based on amygdala radiomic features for Alzheimer's disease (AD) and amnestic mild cognitive impairment (aMCI). For the amygdala, 3360 radiomic features were extracted from 97 AD patients, 53 aMCI patients and 45 normal controls (NCs) on the three-dimensional T1-weighted magnetization-prepared rapid gradient echo (MPRAGE) images. We used maximum relevance and minimum redundancy (mRMR) and least absolute shrinkage and selection operator (LASSO) to select the features. Multivariable logistic regression analysis was performed to build three classification models (AD-NC group, AD-aMCI group, and aMCI-NC group). Finally, internal validation was assessed. After two steps of feature selection, there were 5 radiomic features remained in the AD-NC group, 16 features remained in the AD-aMCI group and the aMCI-NC group, respectively. The proposed logistic classification analysis based on amygdala radiomic features achieves an accuracy of 0.90 and an area under the ROC curve (AUC) of 0.93 for AD vs. NC classification, an accuracy of 0.81 and an AUC of 0.84 for AD vs. aMCI classification, and an accuracy of 0.75 and an AUC of 0.80 for aMCI vs. NC classification. Amygdala radiomic features might be early biomarkers for detecting microstructural brain tissue changes during the AD and aMCI course. Logistic classification analysis demonstrated the promising classification performances for clinical applications among AD, aMCI and NC groups.

A fuzzy gaussian rank aggregation ensemble feature selection method for microarray data

In Microarray Data, it is complicated to achieve more classification accuracy due to the presence of high dimensions, irrelevant and noisy data. And also It had more gene expression data and fewer samples. To increase the classification accuracy and the processing speed of the model, an optimal number of features need to extract, this can be achieved by applying the feature selection method. In this paper, we propose a hybrid ensemble feature selection method. The proposed method has two phases, filter and wrapper phase in filter phase ensemble technique is used for aggregating the feature ranks of the Relief, minimum redundancy Maximum Relevance (mRMR), and Feature Correlation (FC) filter feature selection methods. This paper uses the Fuzzy Gaussian membership function ordering for aggregating the ranks. In wrapper phase, Improved Binary Particle Swarm Optimization (IBPSO) is used for selecting the optimal features, and the RBF Kernel-based Support Vector Machine (SVM) classifier is used as an evaluator. The performance of the proposed model are compared with state of art feature selection methods using five benchmark datasets. For evaluation various performance metrics such as Accuracy, Recall, Precision, and F1-Score are used. Furthermore, the experimental results show that the performance of the proposed method outperforms the other feature selection methods.

Statistical Approach for Biologically Relevant Gene Selection from High-Throughput Gene Expression Data

Selection of biologically relevant genes from high-dimensional expression data is a key research problem in gene expression genomics. Most of the available gene selection methods are either based on relevancy or redundancy measure, which are usually adjudged through post selection classification accuracy. Through these methods the ranking of genes was conducted on a single high-dimensional expression data, which led to the selection of spuriously associated and redundant genes. Hence, we developed a statistical approach through combining a support vector machine with Maximum Relevance and Minimum Redundancy under a sound statistical setup for the selection of biologically relevant genes. Here, the genes were selected through statistical significance values and computed using a nonparametric test statistic under a bootstrap-based subject sampling model. Further, a systematic and rigorous evaluation of the proposed approach with nine existing competitive methods was carried on six different real crop gene expression datasets. This performance analysis was carried out under three comparison settings, i.e., subject classification, biological relevant criteria based on quantitative trait loci and gene ontology. Our analytical results showed that the proposed approach selects genes which are more biologically relevant as compared to the existing methods. Moreover, the proposed approach was also found to be better with respect to the competitive existing methods. The proposed statistical approach provides a framework for combining filter and wrapper methods of gene selection.

Sparse evolutionary deep learning with over one million artificial neurons on commodity hardware

Artificial neural networks (ANNs) have emerged as hot topics in the research community. Despite the success of ANNs, it is challenging to train and deploy modern ANNs on commodity hardware due to the ever-increasing model size and the unprecedented growth in the data volumes. Particularly for microarray data, the very high dimensionality and the small number of samples make it difficult for machine learning techniques to handle. Furthermore, specialized hardware such as graphics processing unit (GPU) is expensive. Sparse neural networks are the leading approaches to address these challenges. However, off-the-shelf sparsity-inducing techniques either operate from a pretrained model or enforce the sparse structure via binary masks. The training efficiency of sparse neural networks cannot be obtained practically. In this paper, we introduce a technique allowing us to train truly sparse neural networks with fixed parameter count throughout training. Our experimental results demonstrate that our method can be applied directly to handle high-dimensional data, while achieving higher accuracy than the traditional two-phase approaches. Moreover, we have been able to create truly sparse multilayer perceptron models with over one million neurons and to train them on a typical laptop without GPU (https://github.com/dcmocanu/sparse-evolutionary-artificial-neural-networks/tree/master/SET-MLP-Sparse-Python-Data-Structures), this being way beyond what is possible with any state-of-the-art technique.

Hybrid-Recursive Feature Elimination for Efficient Feature Selection

As datasets continue to increase in size, it is important to select the optimal feature subset from the original dataset to obtain the best performance in machine learning tasks. Highly dimensional datasets that have an excessive number of features can cause low performance in such tasks. Overfitting is a typical problem. In addition, datasets that are of high dimensionality can create shortages in space and require high computing power, and models fitted to such datasets can produce low classification accuracies. Thus, it is necessary to select a representative subset of features by utilizing an efficient selection method. Many feature selection methods have been proposed, including recursive feature elimination. In this paper, a hybrid-recursive feature elimination method is presented which combines the feature-importance-based recursive feature elimination methods of the support vector machine, random forest, and generalized boosted regression algorithms. From the experiments, we confirm that the performance of the proposed method is superior to that of the three single recursive feature elimination methods.

G-DipC: An Improved Feature Representation Method for Short Sequences to Predict the Type of Cargo in Cell-Penetrating Peptides

Cell-penetrating peptides (CPPs) are functional short peptides with high carrying capacity. CPP sequences with targeting functions for the highly efficient delivery of drugs to target cells. In this paper, which is focused on the prediction of the cargo category of CPPs, a biocomputational model is constructed to efficiently distinguish the category of cargo carried by CPPs as macromolecular carriers among the seven known deliverable cargo categories. Based on dipeptide composition (DipC), an improved feature representation method, general dipeptide composition (G-DipC) is proposed for short peptide sequences and can effectively increase the abundance of features represented. Then linear discriminant analysis (LDA) is applied to mine some important low-dimensional features of G-DipC and a predictive model is built with the XGBoost algorithm. Experimental results with five-fold cross validation show that G-DipC improves accuracy by 25 and 5 percent compared with amino acid composition (AAC) and DipC, respectively. G-DipC is even found to be better than tripeptide composition (TipC). Thus, the proposed model provides a novel resource for the study of cell-penetrating peptides, and the improved dipeptide composition G-DipC can be widely adapted to determine the feature representation of other biological sequences.

Sequence-based Detection of DNA-binding Proteins using Multiple-view Features Allied with Feature Selection

DNA-binding proteins play essential roles in many molecular functions and gene regulation. Therefore, it becomes highly desirable to develop effective computational techniques for detecting DNA-binding proteins. In this paper, we proposed a new method, iDBP-DEP, which performs DNA-binding prediction by using the discriminative feature derived from multi-view feature sources including evolutionary profile, dipeptide composition, and physicochemical properties with feature selection. We evaluated iDBP-DEP on two benchmark datasets, i. e., PDB1075 and PDB594 by rigorous Jackknife test. Compared with the state-of-the-art sequence-based DNA-binding predictors, the proposed iDBP-DEP achieved 1.8 % and 3.0 % improvements of accuracy (Acc) and Mathew's Correlation Coefficient (MCC), respectively, on PDB1075 dataset; 7.4 % and 14.8 % improvements of Acc and MCC, respectively, on PDB594. The independent validation test with PDB186 show that the proposed method achieved the best performances on Acc (80.1 %) and MCC (0.684), which further demonstrated the robustness of iDBP-DEP for the detection of DNA-binding proteins. Datasets and codes used in this study are freely available at https://githup.com/Zll-codeside/iDBP-DEP.

Artificial Intelligence and Machine Learning: A New Disruptive Force in Orthopaedics

Orthopaedics as a surgical discipline requires a combination of good clinical acumen, good surgical skill, a reasonable physical strength and most of all, good understanding of technology. The last few decades have seen rapid adoption of new technologies into orthopaedic practice, power tools, new implants, CAD-CAM design, 3-D printing, additive manufacturing just to name a few. The new disruption in orthopaedics in the current time and era is undoubtedly the advent of artificial intelligence and robotics. As these technologies take root and innovative applications continue to be incorporated into the main-stream orthopedics, as we know it today, it is imperative to look at and understand the basics of artificial intelligence and what work is being done in the field today. This article takes the form of a loosely structured narrative review and will introduce the reader to key concepts in the field of artificial intelligence as well as some of the directions in application of the same in orthopaedics. Some of the recent work has been summarised and we present our viewpoint at the conclusion as to why we must consider artificial intelligence as a disrupting positive influence on orthopaedic surgery.

A disease-related gene mining method based on weakly supervised learning model

BACKGROUND

Predicting disease-related genes is helpful for understanding the disease pathology and the molecular mechanisms during the disease progression. However, traditional methods are not suitable for screening genes related to the disease development, because there are some samples with weak label information in the disease dataset and a small number of genes are known disease-related genes.

RESULTS

We designed a disease-related gene mining method based on the weakly supervised learning model in this paper. The method is separated into two steps. Firstly, the differentially expressed genes are screened based on the weakly supervised learning model. In the model, the strong and weak label information at different stages of the disease progression is fully utilized. The obtained differentially expressed gene set is stable and complete after the algorithm converges. Then, we screen disease-related genes in the obtained differentially expressed gene set using transductive support vector machine based on the difference kernel function. The difference kernel function can map the input space of the original Huntington's disease gene expression dataset to the difference space. The relation between the two genes can be evaluated more accurately in the difference space and the known disease-related gene information can be used effectively.

CONCLUSIONS

The experimental results show that the disease-related gene mining method based on the weakly supervised learning model can effectively improve the precision of the disease-related gene prediction compared with other excellent methods.