@article{NguRig19-ML-IJ,
author = {Nguembang Fadja, Arnaud and Fabrizio Riguzzi},
title = {Lifted Discriminative Learning of Probabilistic Logic Programs},
journal = {Machine Learning},
publisher = {Springer},
copyright = {Springer},
year = {2019},
doi = {10.1007/s10994-018-5750-0},
abstract = {
Probabilistic logic programming (PLP) provides a powerful tool for reason- ing with uncertain relational models. However, learning probabilistic logic programs is expensive due to the high cost of inference. Among the proposals to overcome this problem, one of the most promising is lifted inference. In this paper we consider PLP models that are amenable to lifted inference and present an algorithm for performing parameter and structure learning of these models from positive and negative exam- ples. We discuss parameter learning with EM and LBFGS and structure learning with LIFTCOVER, an algorithm similar to SLIPCOVER. The results of the comparison of LIFTCOVER with SLIPCOVER on 12 datasets show that it can achieve solutions of similar or better quality in a fraction of the time.
},
keywords = { Statistical Relational Learning, Probabilistic Inductive Logic Program- ming, Probabilistic Logic Programming, Lifted Inference, Expectation Maximization
},
scopus = {2-s2.0-85052570852},
volume = {108},
number = {7},
pages = {1111--1135}
}
@article{NguRigBerTru2021-BioDM-IJ,
abstract = {With the increase in the size of genomic datasets describing variability in populations, extracting relevant information becomes increasingly useful as well as complex. Recently, computational methodologies such as Supervised Machine Learning and specifically Convolutional Neural Networks have been proposed to make inferences on demographic and adaptive processes using genomic data. Even though it was already shown to be powerful and efficient in different fields of investigation, Supervised Machine Learning has still to be explored as to unfold its enormous potential in evolutionary genomics.},
author = {Nguembang Fadja, Arnaud and Riguzzi, Fabrizio and Bertorelle, Giorgio and Trucchi, Emiliano},
doi = {10.1186/s13040-021-00280-9},
isbn = {1756-0381},
journal = {BioData Mining},
number = {1},
pages = {51},
title = {Identification of natural selection in genomic data with deep convolutional neural network},
volume = {14},
year = {2021}
}
@article{NguRigLam21-ML-IJ,
author = {Nguembang Fadja, Arnaud and Fabrizio Riguzzi and Evelina Lamma},
title = {Learning Hierarchical Probabilistic Logic Programs},
journal = {Machine Learning},
publisher = {Springer},
copyright = {Springer},
year = {2021},
doi = {10.1007/s10994-021-06016-4},
url = {https://link.springer.com/content/pdf/10.1007/s10994-021-06016-4.pdf},
abstract = {
Probabilistic logic programming (PLP) combines logic programs and probabilities. Due to its expressiveness and simplicity, it has been considered as a powerful tool for learning and reasoning in relational domains characterized by uncertainty. Still, learning the parameter and the structure of general PLP is computationally expensive due to the inference cost. We have recently proposed a restriction of the general PLP language called hierarchical PLP (HPLP) in which clauses and predicates are hierarchically organized. HPLPs can be converted into arithmetic circuits or deep neural networks and inference is much cheaper than for general PLP. In this paper we present algorithms for learning both the parameters and the structure of HPLPs from data. We first present an algorithm, called parameter learning for hierarchical probabilistic logic programs (PHIL) which performs parameter estimation of HPLPs using gradient descent and expectation maximization. We also propose structure learning of hierarchical probabilistic logic programming (SLEAHP), that learns both the structure and the parameters of HPLPs from data. Experiments were performed comparing PHIL and SLEAHP with PLP and Markov Logic Networks state-of-the art systems for parameter and structure learning respectively. PHIL was compared with EMBLEM, ProbLog2 and Tuffy and SLEAHP with SLIPCOVER, PROBFOIL+, MLB-BC, MLN-BT and RDN-B. The experiments on five well known datasets show that our algorithms achieve similar and often better accuracies but in a shorter time.
},
keywords = {Probabilistic Logic Programming, Distribution Semantics, Arithmetic Circuits, Gradient Descent, Back-propagation},
address = {Berlin, Germany},
scopus = {2-s2.0-85107994928},
volume = {110},
number = {7},
pages = {1637--1693},
isbn = {1573-0565}
}
@article{NguFraBizLam2022-MBEC-IJ,
abstract = {Recently, Artificial Intelligence (AI) and Machine Learning (ML) have been successfully applied to many domains of interest including medical diagnosis. Due to the availability of a large quantity of data, it is possible to build reliable AI systems that assist humans in making decisions. The recent Covid-19 pandemic quickly spread over the world causing serious health problems and severe economic and social damage. Computer scientists are actively working together with doctors on different ML models to diagnose Covid-19 patients using Computed Tomography (CT) scans and clinical data. In this work, we propose a neural-symbolic system that predicts if a Covid-19 patient arriving at the hospital will end in a critical condition. The proposed system relies on Deep 3D Convolutional Neural Networks (3D-CNNs) for analyzing lung CT scans of Covid-19 patients, Decision Trees (DTs) for predicting if a Covid-19 patient will eventually pass away by analyzing its clinical data, and a neural system that integrates the previous ones using Hierarchical Probabilistic Logic Programs (HPLPs). Predicting if a Covid-19 patient will end in a critical condition is useful for managing the limited number of intensive care at the hospital. Moreover, knowing early that a Covid-19 patient could end in serious conditions allows doctors to gain early knowledge on patients and provide special treatment to those predicted to finish in critical conditions. The proposed system, entitled Neural HPLP, obtains good performance in terms of area under the receiver operating characteristic and precision curves with values of about 0.96 for both metrics. Therefore, with Neural HPLP, it is possible not only to efficiently predict if Covid-19 patients will end in severe conditions but also possible to provide an explanation of the prediction. This makes Neural HPLP explainable, interpretable, and reliable.},
author = {Fadja, Arnaud Nguembang and Fraccaroli, Michele and Bizzarri, Alice and Mazzuchelli, Giulia and Lamma, Evelina},
date = {2022/10/06},
date-added = {2022-10-06 16:02:08 +0200},
date-modified = {2022-10-06 16:02:08 +0200},
doi = {10.1007/s11517-022-02674-1},
id = {Fadja2022},
isbn = {1741-0444},
journal = {Medical \& Biological Engineering \& Computing},
title = {Neural-Symbolic Ensemble Learning for early-stage prediction of critical state of Covid-19 patients},
url = {https://doi.org/10.1007/s11517-022-02674-1},
year = {2022},
bdsk-url-1 = {https://doi.org/10.1007/s11517-022-02674-1}
}
@article{Rig23-JCS-IJ,
article_type = {journal},
title = {Machine Learning Approaches for the Prediction of Gas Turbine Transients},
author = {Fadja, Arnaud Nguembang and Cota, Giuseppe and Bertasi, Francesco and Riguzzi, Fabrizio and Losi, Enzo and Manservigi, Lucrezia and Venturini, Mauro and Bechini, Giovanni},
volume = {20},
number = {5},
year = {2024},
month = {Feb},
pages = {495-510},
doi = {10.3844/jcssp.2024.495.510},
url = {https://thescipub.com/abstract/jcssp.2024.495.510},
abstract = {Gas Turbine (GT) emergency shutdowns can lead to energy production interruption and may also reduce the lifespan of a turbine. In order to remain competitive in the market, it is necessary to improve the reliability and availability of GTs by developing predictive maintenance systems that are able to predict future conditions of GTs within a certain time. Predicting such situations not only helps to take corrective measures to avoid service unavailability but also eases the process of maintenance and considerably reduces maintenance costs. Huge amounts of sensor data are collected from (GTs) making monitoring impossible for human operators even with the help of computers. Machine learning techniques could provide support for handling large amounts of sensor data and building decision models for predicting GT future conditions. The paper presents an application of machine learning based on decision trees and k-nearest neighbors for predicting the rotational speed of gas turbines. The aim is to distinguish steady states (e.g., GT operation at normal conditions) from transients (e.g., GT trip or shutdown). The different steps of a machine learning pipeline, starting from data extraction to model testing are implemented and analyzed. Experiments are performed by applying decision trees, extremely randomized trees, and k-nearest neighbors to sensor data collected from GTs located in different countries. The trained models were able to predict steady state and transient with more than 93% accuracy. This research advances predictive maintenance methods and suggests exploring advanced machine learning algorithms, real-time data integration, and explainable AI techniques to enhance gas turbine behavior understanding and develop more adaptable maintenance systems for industrial applications.},
journal = {Journal of Computer Science},
publisher = {Science Publications}
}
This file was generated by bibtex2html 1.98.