Browse
Submit Data
Databases
API
Help

Dataset Information

22 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

X-Entropy: A Parallelized Kernel Density Estimator with Automated Bandwidth Selection to Calculate Entropy.

ABSTRACT: X-Entropy is a Python package used to calculate the entropy of a given distribution, in this case, based on the distribution of dihedral angles. The dihedral entropy facilitates an alignment-independent measure of local protein flexibility. The key feature of our approach is a Gaussian kernel density estimation (KDE) using a plug-in bandwidth selection, which is fully implemented in a C++ backend and parallelized with OpenMP. We further provide a Python frontend, with predefined wrapper functions for classical coordinate-based dihedral entropy calculations, using a 1D approximation. This makes the package very straightforward to include in any Python-based analysis workflow. Furthermore, the frontend allows full access to the C++ backend, so that the KDE can be used on any binnable one-dimensional input data. In this application note, we discuss implementation and usage details and illustrate potential applications. In particular, we benchmark the performance of our module in calculating the entropy of samples drawn from a Gaussian distribution and the analytical solution thereof. Further, we analyze the computational performance of this module compared to well-established python libraries that perform KDE analyses. X-Entropy is available free of charge on GitHub (https://github.com/liedllab/X-Entropy).

SUBMITTER: Kraml J

PROVIDER: S-EPMC8154256 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

PeaKDEck: a kernel density estimator-based peak calling program for DNaseI-seq data.

Project description:Hypersensitivity to DNaseI digestion is a hallmark of open chromatin, and DNaseI-seq allows the genome-wide identification of regions of open chromatin. Interpreting these data is challenging, largely because of inherent variation in signal-to-noise ratio between datasets. We have developed PeaKDEck, a peak calling program that distinguishes signal from noise by randomly sampling read densities and using kernel density estimation to generate a dataset-specific probability distribution of random background signal. PeaKDEck uses this probability distribution to select an appropriate read density threshold for peak calling in each dataset. We benchmark PeaKDEck using published ENCODE DNaseI-seq data and other peak calling programs, and demonstrate superior performance in low signal-to-noise ratio datasets.

| S-EPMC3998130 | biostudies-literature

Quantifying physiological stability in the general ward using continuous vital signs monitoring: the circadian kernel density estimator.

Project description:Technological advances seen in recent years have introduced the possibility of changing the way hospitalized patients are monitored by abolishing the traditional track-and-trigger systems and implementing continuous monitoring using wearable biosensors. However, this new monitoring paradigm raise demand for novel ways of analyzing the data streams in real time. The aim of this study was to design a stability index using kernel density estimation (KDE) fitted to observations of physiological stability incorporating the patients' circadian rhythm. Continuous vital sign data was obtained from two observational studies with 491 postoperative patients and 200 patients with acute exacerbation of chronic obstructive pulmonary disease. We defined physiological stability as the last 24 h prior to discharge. We evaluated the model against periods of eight hours prior to events defined either as severe adverse events (SAE) or as a total score in the early warning score (EWS) protocol of ≥ 6, ≥ 8, or ≥ 10. The results found good discriminative properties between stable physiology and EWS-events (area under the receiver operating characteristics curve (AUROC): 0.772-0.993), but lower for the SAEs (AUROC: 0.594-0.611). The time of early warning for the EWS events were 2.8-5.5 h and 2.5 h for the SAEs. The results showed that for severe deviations in the vital signs, the circadian KDE model can alert multiple hours prior to deviations being noticed by the staff. Furthermore, the model shows good generalizability to another cohort and could be a simple way of continuously assessing patient deterioration in the general ward.

| S-EPMC10651555 | biostudies-literature

Identification of the associations between genes and quantitative traits using entropy-based kernel density estimation.

Project description:Genetic associations have been quantified using a number of statistical measures. Entropy-based mutual information may be one of the more direct ways of estimating the association, in the sense that it does not depend on the parametrization. For this purpose, both the entropy and conditional entropy of the phenotype distribution should be obtained. Quantitative traits, however, do not usually allow an exact evaluation of entropy. The estimation of entropy needs a probability density function, which can be approximated by kernel density estimation. We have investigated the proper sequence of procedures for combining the kernel density estimation and entropy estimation with a probability density function in order to calculate mutual information. Genotypes and their interactions were constructed to set the conditions for conditional entropy. Extensive simulation data created using three types of generating functions were analyzed using two different kernels as well as two types of multifactor dimensionality reduction and another probability density approximation method called m-spacing. The statistical power in terms of correct detection rates was compared. Using kernels was found to be most useful when the trait distributions were more complex than simple normal or gamma distributions. A full-scale genomic dataset was explored to identify associations using the 2-h oral glucose tolerance test results and γ-glutamyl transpeptidase levels as phenotypes. Clearly distinguishable single-nucleotide polymorphisms (SNPs) and interacting SNP pairs associated with these phenotypes were found and listed with empirical p-values.

| S-EPMC9299569 | biostudies-literature

How Important is the Choice of Bandwidth in Kernel Equating?

Project description:Kernel equating uses kernel smoothing techniques to continuize the discrete score distributions when equating test scores from an assessment test. The degree of smoothness of the continuous approximations is determined by the bandwidth. Four bandwidth selection methods are currently available for kernel equating, but no thorough comparison has been made between these methods. The overall aim is to compare these four methods together with two additional methods based on cross-validation in a simulation study. Both equivalent and non-equivalent group designs are used and the number of test takers, test length, and score distributions are all varied. The results show that sample size and test length are important factors for equating accuracy and precision. However, all bandwidth selection methods perform similarly with regards to the mean squared error and the differences in terms of equated scores are small, suggesting that the choice of bandwidth is not critical. The different bandwidth selection methods are also illustrated using real testing data from a college admissions test. Practical implications of the results from the simulation study and the empirical study are discussed.

| S-EPMC8640352 | biostudies-literature

A kernel nonparametric quantile estimator for right-censored competing risks data.

Project description:In medical and epidemiological studies, it is often interest to study time-to-event distributions under competing risks that involve two or more failure types. Nonparametric analysis of competing risks is typically focused on the cumulative incidence function or nonparametric quantile function. However, the existing estimators may be very unstable due to their unsmoothness. In this paper, we propose a kernel nonparametric quantile estimator for right-censored competing risks data, which is a smoothed version of Peng and Fine's nonparametric quantile estimator. We establish the Bahadur representation of the proposed estimator. The convergence rate of the remainder term for the proposed estimator is substantially faster than Peng and Fine's quantile estimator. The pointwise confidence intervals and simultaneous confidence bands of the quantile functions are also derived. Simulation studies illustrate the good performance of the proposed estimator. The methodology is demonstrated with two applications of the Supreme Court Judge data and AIDSSI data.

| S-EPMC9038055 | biostudies-literature

Contingent kernel density estimation.

Project description:Kernel density estimation is a widely used method for estimating a distribution based on a sample of points drawn from that distribution. Generally, in practice some form of error contaminates the sample of observed points. Such error can be the result of imprecise measurements or observation bias. Often this error is negligible and may be disregarded in analysis. In cases where the error is non-negligible, estimation methods should be adjusted to reduce resulting bias. Several modifications of kernel density estimation have been developed to address specific forms of errors. One form of error that has not yet been addressed is the case where observations are nominally placed at the centers of areas from which the points are assumed to have been drawn, where these areas are of varying sizes. In this scenario, the bias arises because the size of the error can vary among points and some subset of points can be known to have smaller error than another subset or the form of the error may change among points. This paper proposes a "contingent kernel density estimation" technique to address this form of error. This new technique adjusts the standard kernel on a point-by-point basis in an adaptive response to changing structure and magnitude of error. In this paper, equations for our contingent kernel technique are derived, the technique is validated using numerical simulations, and an example using the geographic locations of social networking users is worked to demonstrate the utility of the method.

| S-EPMC3286465 | biostudies-literature

Classification of heterogeneous microarray data by maximum entropy kernel.

Project description:BACKGROUND: There is a large amount of microarray data accumulating in public databases, providing various data waiting to be analyzed jointly. Powerful kernel-based methods are commonly used in microarray analyses with support vector machines (SVMs) to approach a wide range of classification problems. However, the standard vectorial data kernel family (linear, RBF, etc.) that takes vectorial data as input, often fails in prediction if the data come from different platforms or laboratories, due to the low gene overlaps or consistencies between the different datasets. RESULTS: We introduce a new type of kernel called maximum entropy (ME) kernel, which has no pre-defined function but is generated by kernel entropy maximization with sample distance matrices as constraints, into the field of SVM classification of microarray data. We assessed the performance of the ME kernel with three different data: heterogeneous kidney carcinoma, noise-introduced leukemia, and heterogeneous oral cavity carcinoma metastasis data. The results clearly show that the ME kernel is very robust for heterogeneous data containing missing values and high-noise, and gives higher prediction accuracies than the standard kernels, namely, linear, polynomial and RBF. CONCLUSION: The results demonstrate its utility in effectively analyzing promiscuous microarray data of rare specimens, e.g., minor diseases or species, that present difficulty in compiling homogeneous data in a single laboratory.

| S-EPMC1994960 | biostudies-literature

Kernel Entropy Component Analysis with Nongreedy L1-Norm Maximization.

Project description:Kernel entropy component analysis (KECA) is a newly proposed dimensionality reduction (DR) method, which has showed superiority in many pattern analysis issues previously solved by principal component analysis (PCA). The optimized KECA (OKECA) is a state-of-the-art variant of KECA and can return projections retaining more expressive power than KECA. However, OKECA is sensitive to outliers and accused of its high computational complexities due to its inherent properties of L2-norm. To handle these two problems, we develop a new extension to KECA, namely, KECA-L1, for DR or feature extraction. KECA-L1 aims to find a more robust kernel decomposition matrix such that the extracted features retain information potential as much as possible, which is measured by L1-norm. Accordingly, we design a nongreedy iterative algorithm which has much faster convergence than OKECA's. Moreover, a general semisupervised classifier is developed for KECA-based methods and employed into the data classification. Extensive experiments on data classification and software defect prediction demonstrate that our new method is superior to most existing KECA- and PCA-based approaches. Code has been also made publicly available.

| S-EPMC6204191 | biostudies-literature

Automated and parallelized spike collision tests to identify spike signal projections.

Project description:The spike collision test is a highly reliable technique to identify the axonal projection of a neuron recorded electrophysiologically for investigating functional spike information among brain areas. It is potentially applicable to more neuronal projections by combining multi-channel recording with optogenetic stimulation. Yet, it remains inefficient and laborious because an experimenter must visually select spikes in every channel and manually repeat spike collision tests for each neuron serially. Here, we automated spike collision tests for all channels in parallel (Multi-Linc analysis) in a multi-channel real-time processing system. The rat cortical neurons identified with this technique displayed physiological spike features consistent with excitatory projection neurons. Their antidromic spikes were similar in shape but slightly larger in amplitude compared with spontaneous spikes. In addition, we demonstrated simultaneous identification of reciprocal or bifurcating projections among cortical areas. Thus, our Multi-Linc analysis will be a powerful approach to elucidate interareal spike communication.

| S-EPMC9490030 | biostudies-literature

Entropy-Induced Self-Assembly of Colloidal Crystals with High Reflectivity and Narrow Reflection Bandwidth.

Project description:Cracks and defects, which could result in lower reflectivity and larger full width at half maximum (FWHM), are the major obstacles for obtaining highly ordered structures of colloidal crystals (CCs). The high-quality CCs with high reflectivity (more than 90%) and 9.2 nm narrow FWHM have been successfully fabricated using a fixed proportion of a soft matter system composed of silica particles (SPs), polyethylene glycol diacrylate (PEGDA), and ethanol. The influences of refractivity difference, volume fractions, and particle dimension on FWHM were illuminated. Firstly, we clarified the influences of the planar interface and the bending interface on the self-assembly. The CCs had been successfully fabricated on the planar interface and presented unfavorable results on the bending interface. Secondly, a hard sphere system consisting of SPs, PEGDA, and ethanol was established, and the entropy-driven phase transition mechanism of a polydisperse system was expounded. The FWHM and reflectivity of CCs showed an increasing trend with increasing temperature. Consequently, high-quality CCs were obtained by adjusting temperatures (ordered structure formed at 90 °C and solidified at 0 °C) based on the surface phase rule of the system. We acquired a profound understanding of the principle and process of self-assembly, which is significant for preparation and application of CCs such as optical filters.

| S-EPMC7514662 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data