Browse
Submit Data
Databases
API
Help

Dataset Information

21 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Identification of Vesicle Transport Proteins via Hypergraph Regularized K-Local Hyperplane Distance Nearest Neighbour Model

ABSTRACT: The prediction of protein function is a common topic in the field of bioinformatics. In recent years, advances in machine learning have inspired a growing number of algorithms for predicting protein function. A large number of parameters and fairly complex neural networks are often used to improve the prediction performance, an approach that is time-consuming and costly. In this study, we leveraged traditional features and machine learning classifiers to boost the performance of vesicle transport protein identification and make the prediction process faster. We adopt the pseudo position-specific scoring matrix (PsePSSM) feature and our proposed new classifier hypergraph regularized k-local hyperplane distance nearest neighbour (HG-HKNN) to classify vesicular transport proteins. We address dataset imbalances with random undersampling. The results show that our strategy has an area under the receiver operating characteristic curve (AUC) of 0.870 and a Matthews correlation coefficient (MCC) of 0.53 on the benchmark dataset, outperforming all state-of-the-art methods on the same dataset, and other metrics of our model are also comparable to existing methods.

SUBMITTER: Fan R

PROVIDER: S-EPMC9326258 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Nearest hyperplane distance neighbor clustering algorithm applied to gene co-expression analysis in Alzheimer's disease.

Project description:Microarray analysis can contribute considerably to the understanding of biologically significant cellular mechanisms that yield novel information regarding co-regulated sets of gene patterns. Clustering is one of the most popular tools for analyzing DNA microarray data. In this paper, we present an unsupervised clustering algorithm based on the K-local hyperplane distance nearest-neighbor classifier (HKNN). We adapted the well-known nearest neighbor clustering algorithm for use with hyperplane distance. The result is a simple and computationally inexpensive unsupervised clustering algorithm that can be applied to high-dimensional data. It has been reported that the NFkB1 gene is progressively over-expressed in moderate-to-severe Alzheimer's disease (AD) cases, and that the NF-kB complex plays a key role in neuroinflammatory responses in AD pathogenesis. In this study, we apply the proposed clustering algorithm to identify co-expression patterns with the NFkB1 in gene expression data from hippocampal tissue samples. Finally, we validate our experiments with biomedical literature search.

| S-EPMC3703613 | biostudies-literature

Nearest-neighbour transition-state analysis for nucleic acid kinetics.

Project description:We used stopped-flow to monitor hypochromicity for 43 oligonucleotide duplexes to study nucleic acid kinetics and extract transition-state parameters for association and dissociation. Reactions were performed in 1.0 M NaCl (for literature comparisons) and 2.2 mM MgCl2 (PCR conditions). Dissociation kinetics depended on sequence, increased exponentially with temperature, and transition-state parameters inversely correlated to thermodynamic parameters (r = -0.99). Association had no consistent enthalpic component, varied little with temperature or sequence, and poorly correlated to thermodynamic parameters (r = 0.28). Average association rates decreased 78% in MgCl2 compared to NaCl while dissociation was relatively insensitive to ionic conditions. A nearest-neighbour kinetic model for dissociation predicted rate constants within 3-fold of literature values (n = 11). However, a nearest-neighbour model for association appeared overparameterized and inadequate for predictions. Kinetic predictions were used to simulate published high-speed (<1 min) melting analysis and extreme (<2 min) PCR experiments. Melting simulations predicted apparent melting temperatures increase on average 2.4°C when temperature ramp rates increased from 0.1 to 32°C/s, compared to 2.8°C reported in the literature. PCR simulations revealed that denaturation kinetics are dependent on the thermocycling profile. Simulations overestimated annealing efficiencies at shorter annealing times and suggested that polymerase interactions contribute to primer-template complex stability at extension temperatures.

| S-EPMC8096236 | biostudies-literature

Love thy neighbour: automatic animal behavioural classification of acceleration data using the K-nearest neighbour algorithm.

Project description:Researchers hoping to elucidate the behaviour of species that aren't readily observed are able to do so using biotelemetry methods. Accelerometers in particular are proving particularly effective and have been used on terrestrial, aquatic and volant species with success. In the past, behavioural modes were detected in accelerometer data through manual inspection, but with developments in technology, modern accelerometers now record at frequencies that make this impractical. In light of this, some researchers have suggested the use of various machine learning approaches as a means to classify accelerometer data automatically. We feel uptake of this approach by the scientific community is inhibited for two reasons; 1) Most machine learning algorithms require selection of summary statistics which obscure the decision mechanisms by which classifications are arrived, and 2) they are difficult to implement without appreciable computational skill. We present a method which allows researchers to classify accelerometer data into behavioural classes automatically using a primitive machine learning algorithm, k-nearest neighbour (KNN). Raw acceleration data may be used in KNN without selection of summary statistics, and it is easily implemented using the freeware program R. The method is evaluated by detecting 5 behavioural modes in 8 species, with examples of quadrupedal, bipedal and volant species. Accuracy and Precision were found to be comparable with other, more complex methods. In order to assist in the application of this method, the script required to run KNN analysis in R is provided. We envisage that the KNN method may be coupled with methods for investigating animal position, such as GPS telemetry or dead-reckoning, in order to implement an integrated approach to movement ecology research.

| S-EPMC3931648 | biostudies-literature

Nearest-neighbour resonating valence bonds in YbMgGaO<sub>4</sub>.

Project description:Since its proposal by Anderson, resonating valence bonds (RVB) formed by a superposition of fluctuating singlet pairs have been a paradigmatic concept in understanding quantum spin liquids. Here, we show that excitations related to singlet breaking on nearest-neighbour bonds describe the high-energy part of the excitation spectrum in YbMgGaO4, the effective spin-1/2 frustrated antiferromagnet on the triangular lattice, as originally considered by Anderson. By a thorough single-crystal inelastic neutron scattering study, we demonstrate that nearest-neighbour RVB excitations account for the bulk of the spectral weight above 0.5?meV. This renders YbMgGaO4 the first experimental system where putative RVB correlations restricted to nearest neighbours are observed, and poses a fundamental question of how complex interactions on the triangular lattice conspire to form this unique many-body state.

| S-EPMC5489678 | biostudies-literature

Anomaly detection based on local nearest neighbor distance descriptor in crowded scenes.

Project description:We propose a novel local nearest neighbor distance (LNND) descriptor for anomaly detection in crowded scenes. Comparing with the commonly used low-level feature descriptors in previous works, LNND descriptor has two major advantages. First, LNND descriptor efficiently incorporates spatial and temporal contextual information around the video event that is important for detecting anomalous interaction among multiple events, while most existing feature descriptors only contain the information of single event. Second, LNND descriptor is a compact representation and its dimensionality is typically much lower than the low-level feature descriptor. Therefore, not only the computation time and storage requirement can be accordingly saved by using LNND descriptor for the anomaly detection method with offline training fashion, but also the negative aspects caused by using high-dimensional feature descriptor can be avoided. We validate the effectiveness of LNND descriptor by conducting extensive experiments on different benchmark datasets. Experimental results show the promising performance of LNND-based method against the state-of-the-art methods. It is worthwhile to notice that the LNND-based approach requires less intermediate processing steps without any subsequent processing such as smoothing but achieves comparable event better performance.

| S-EPMC4106157 | biostudies-other

Nearest-neighbour clusters as a novel technique for assessing group associations.

Project description:When all the individuals in a social group can be easily identified, one of the simplest measures of social interaction that can be recorded is nearest-neighbour identity. Many field studies use sequential scan samples of groups to build up association metrics using these nearest-neighbour identities. Here, I describe a simple technique for identifying clusters of associated individuals within groups that uses nearest-neighbour identity data. Using computer-generated datasets with known associations, I demonstrate that this clustering technique can be used to build data suitable for association metrics, and that it can generate comparable metrics to raw nearest-neighbour data, but with much less initial data. This technique could therefore be of use where it is difficult to generate large datasets. Other situations where the technique would be useful are discussed.

| S-EPMC4448799 | biostudies-literature

Adaptive nonparametric regression with the <i>K</i>-nearest neighbour fused lasso.

Project description:The fused lasso, also known as total-variation denoising, is a locally adaptive function estimator over a regular grid of design points. In this article, we extend the fused lasso to settings in which the points do not occur on a regular grid, leading to a method for nonparametric regression. This approach, which we call the [Formula: see text]-nearest-neighbours fused lasso, involves computing the [Formula: see text]-nearest-neighbours graph of the design points and then performing the fused lasso over this graph. We show that this procedure has a number of theoretical advantages over competing methods: specifically, it inherits local adaptivity from its connection to the fused lasso, and it inherits manifold adaptivity from its connection to the [Formula: see text]-nearest-neighbours approach. In a simulation study and an application to flu data, we show that excellent results are obtained. For completeness, we also study an estimator that makes use of an [Formula: see text]-graph rather than a [Formula: see text]-nearest-neighbours graph and contrast it with the [Formula: see text]-nearest-neighbours fused lasso.

| S-EPMC7228543 | biostudies-literature

Genome scans for selection and introgression based on k-nearest neighbour techniques.

Project description:In recent years, genome-scan methods have been extensively used to detect local signatures of selection and introgression. Most of these methods are either designed for one or the other case, which may impair the study of combined cases. Here, we introduce a series of versatile genome-scan methods applicable for both cases, the detection of selection and introgression. The proposed approaches are based on nonparametric k-nearest neighbour (kNN) techniques, while incorporating pairwise Fixation Index (FST ) and pairwise nucleotide differences (dxy ) as features. We benchmark our methods using a wide range of simulation scenarios, with varying parameters, such as recombination rates, population background histories, selection strengths, the proportion of introgression and the time of gene flow. We find that kNN-based methods perform remarkably well compared with the state-of-the-art. Finally, we demonstrate how to perform kNN-based genome scans on real-world genomic data using the population genomics R-package popgenome.

| S-EPMC7689739 | biostudies-literature

Local hypergraph clustering using capacity releasing diffusion.

Project description:Local graph clustering is an important machine learning task that aims to find a well-connected cluster near a set of seed nodes. Recent results have revealed that incorporating higher order information significantly enhances the results of graph clustering techniques. The majority of existing research in this area focuses on spectral graph theory-based techniques. However, an alternative perspective on local graph clustering arises from using max-flow and min-cut on the objectives, which offer distinctly different guarantees. For instance, a new method called capacity releasing diffusion (CRD) was recently proposed and shown to preserve local structure around the seeds better than spectral methods. The method was also the first local clustering technique that is not subject to the quadratic Cheeger inequality by assuming a good cluster near the seed nodes. In this paper, we propose a local hypergraph clustering technique called hypergraph CRD (HG-CRD) by extending the CRD process to cluster based on higher order patterns, encoded as hyperedges of a hypergraph. Moreover, we theoretically show that HG-CRD gives results about a quantity called motif conductance, rather than a biased version used in previous experiments. Experimental results on synthetic datasets and real world graphs show that HG-CRD enhances the clustering quality.

| S-EPMC7757905 | biostudies-literature

Replacing salt correction factors with optimized RNA nearest-neighbour enthalpy and entropy parameters.

Project description:We calculate the nearest-neighbour enthalpies and entropies at 5 salt concentrations of 18 RNA sequences, each for at least 9 different species concentrations, totalling 757 melting temperatures, using a melting temperature optimization method. These new parameters do not need to be salt-corrected and are shown to provide overall improved melting temperature predictions. They show a marked quadratic dependence with salt concentrations which are compensated to form linear Gibbs free energies. Two different parameter schemes were tested, with fixed or variable initial parameters. We have found that using variable initial parameters provides better predictive results than using salt correction factors and that the prediction uncertainty is considerably reduced for a validation set of independent sequences. An interpolation scheme is introduced to generate model parameters for arbitrary salt concentrations which performs better against a validation set than predictions using salt corrections.

| S-EPMC6784847 | 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