BM algorithms for noisy data and implicit regression modelling

We present a case study applying hierarchical Bayesian estimation on high-throughput protein melting-point data measured across the tree of life. We show that the model is able to impute reasonable melting temperatures even in the face of unreasonably noisy data. Additionally, we demonstrate how to use the variance in melting-temperature posterior-distribution estimates to enable principled decision-making in common high-throughput measurement tasks, and contrast the decision-making workflow against simple maximum-likelihood curve-fitting. We conclude with a discussion of the relative merits of each workflow.

Download Full-text

Approximation of noisy data using multivariate splines and finite element methods

Journal of Algorithms & Computational Technology ◽

10.1177/17483026211008405 ◽

2021 ◽

Vol 15 ◽

pp. 174830262110084

Author(s):

Bishnu P Lamichhane ◽

Elizabeth Harris ◽

Quoc Thong Le Gia

Keyword(s):

Finite Element ◽

Differential Operators ◽

Impulsive Noise ◽

Noisy Data ◽

Multivariate Splines ◽

The Finite Element Method ◽

Data Smoothing ◽

Multivariate Spline ◽

Partial Differential Operators ◽

Mixture Of Gaussian

We compare a recently proposed multivariate spline based on mixed partial derivatives with two other standard splines for the scattered data smoothing problem. The splines are defined as the minimiser of a penalised least squares functional. The penalties are based on partial differential operators, and are integrated using the finite element method. We compare three methods to two problems: to remove the mixture of Gaussian and impulsive noise from an image, and to recover a continuous function from a set of noisy observations.

Download Full-text

Prediction of Transcription Factor Binding Sites of SP1 on Human Chromosome1

Applied Sciences ◽

10.3390/app11115123 ◽

2021 ◽

Vol 11 (11) ◽

pp. 5123

Author(s):

Maiada M. Mahmoud ◽

Nahla A. Belal ◽

Aliaa Youssif

Keyword(s):

Transcription Factor ◽

Binding Sites ◽

Messenger Rna ◽

Area Under The Curve ◽

Noisy Data ◽

Transcription Factor Binding Sites ◽

Classification Problem ◽

Transcription Factor Binding ◽

K Nearest Neighbors ◽

Factor Binding

Transcription factors (TFs) are proteins that control the transcription of a gene from DNA to messenger RNA (mRNA). TFs bind to a specific DNA sequence called a binding site. Transcription factor binding sites have not yet been completely identified, and this is considered to be a challenge that could be approached computationally. This challenge is considered to be a classification problem in machine learning. In this paper, the prediction of transcription factor binding sites of SP1 on human chromosome1 is presented using different classification techniques, and a model using voting is proposed. The highest Area Under the Curve (AUC) achieved is 0.97 using K-Nearest Neighbors (KNN), and 0.95 using the proposed voting technique. However, the proposed voting technique is more efficient with noisy data. This study highlights the applicability of the voting technique for the prediction of binding sites, and highlights the outperformance of KNN on this type of data. The study also highlights the significance of using voting.

Download Full-text