Daily rainfall nearest neighbor pattern using point data series in Iran.
Ontology highlight
ABSTRACT:
SUBMITTER: Javari M
PROVIDER: S-EPMC6141148 | biostudies-literature | 2018 Aug
REPOSITORIES: biostudies-literature
Publications
Daily rainfall nearest neighbor pattern using point data series in Iran.
Data in brief 20180619
In this data study, assessment of daily rainfall nearest neighbor׳s patterns (DRBBP) was described in Iran. This article presents some spatial patterns of daily rainfall nearest neighbor׳s patterns for Iran from 170 stations and 31195 rainfall points by comparing ordinary kriging techniques based on the forecast models. For the nearest neighbor׳s patterns of the daily rainfall, rainfall data series of 1975-2014 was employed to estimate the point data of daily rainfall. The statistical properties ...[more]
Similar Datasets
Project description:Resistive switching memory (RRAM) is considered as one of the most promising devices for parallel computing solutions that may overcome the von Neumann bottleneck of today's electronic systems. However, the existing RRAM-based parallel computing architectures suffer from practical problems such as device variations and extra computing circuits. In this work, we propose a novel parallel computing architecture for pattern recognition by implementing k-nearest neighbor classification on metal-oxide RRAM crossbar arrays. Metal-oxide RRAM with gradual RESET behaviors is chosen as both the storage and computing components. The proposed architecture is tested by the MNIST database. High speed (~100 ns per example) and high recognition accuracy (97.05%) are obtained. The influence of several non-ideal device properties is also discussed, and it turns out that the proposed architecture shows great tolerance to device variations. This work paves a new way to achieve RRAM-based parallel computing hardware systems with high performance.
| S-EPMC5364413 | biostudies-literature
Project description:In k Nearest Neighbor (kNN) classifier, a query instance is classified based on the most frequent class of its nearest neighbors among the training instances. In imbalanced datasets, kNN becomes biased towards the majority instances of the training space. To solve this problem, we propose a method called Proximity weighted Evidential kNN classifier. In this method, each neighbor of a query instance is considered as a piece of evidence from which we calculate the probability of class label given feature values to provide more preference to the minority instances. This is then discounted by the proximity of the neighbor to prioritize the closer instances in the local neighborhood. These evidences are then combined using Dempster-Shafer theory of evidence. A rigorous experiment over 30 benchmark imbalanced datasets shows that our method performs better compared to 12 popular methods. In pairwise comparison of these 12 methods with our method, in the best case, our method wins in 29 datasets, and in the worst case it wins in least 19 datasets. More importantly, according to Friedman test the proposed method ranks higher than all other methods in terms of AUC at 5% level of significance.
| S-EPMC7206335 | biostudies-literature
Project description:Copy number variation (CNV) is a well-known type of genomic mutation that is associated with the development of human cancer diseases. Detection of CNVs from the human genome is a crucial step for the pipeline of starting from mutation analysis to cancer disease diagnosis and treatment. Next-generation sequencing (NGS) data provides an unprecedented opportunity for CNVs detection at the base-level resolution, and currently, many methods have been developed for CNVs detection using NGS data. However, due to the intrinsic complexity of CNVs structures and NGS data itself, accurate detection of CNVs still faces many challenges. In this paper, we present an alternative method, called KNNCNV (K-Nearest Neighbor based CNV detection), for the detection of CNVs using NGS data. Compared to current methods, KNNCNV has several distinctive features: 1) it assigns an outlier score to each genome segment based solely on its first k nearest-neighbor distances, which is not only easy to extend to other data types but also improves the power of discovering CNVs, especially the local CNVs that are likely to be masked by their surrounding regions; 2) it employs the variational Bayesian Gaussian mixture model (VBGMM) to transform these scores into a series of binary labels without a user-defined threshold. To evaluate the performance of KNNCNV, we conduct both simulation and real sequencing data experiments and make comparisons with peer methods. The experimental results show that KNNCNV could derive better performance than others in terms of F1-score.
| S-EPMC8728060 | biostudies-literature
Project description:BackgroundThe enumeration of tetrameric and other sequence motifs that are positively or negatively correlated with in vivo antisense DNA effects has been a useful addition to the arsenal of information needed to predict effective targets for antisense DNA control of gene expression. Such retrospective information derived from in vivo cellular experiments characterizes aspects of the sequence dependence of antisense inhibition that are not predicted by nearest-neighbor (NN) thermodynamic parameters derived from in vitro experiments. However, quantitation of the antisense contributions of motifs is problematic, since individual motifs are not isolated from the effects of neighboring nucleotides, and motifs may be overlapping. These problems are circumvented by a next-nearest-neighbor (NNN) analysis of antisense DNA effects in which the overlapping nature of nearest-neighbors is taken into account.ResultsNext-nearest-neighbor triplet combinations of nucleotides are the simplest that include overlapping sequence effects and therefore can encompass interactions beyond those of nearest neighbors. We used singular value decomposition (SVD) to fit experimental data from our laboratory in which phosphorothioate-modified antisense DNAs (S-DNAs) 20 nucleotides long were used to inhibit cellular protein expression in 112 experiments involving four gene targets and two cell lines. Data were fitted using a NNN model, neglecting end effects, to derive NNN inhibition parameters that could be combined to give parameters for a set of 49 sequences that represents the inhibitory effects of all possible overlapping triplet interactions in the cellular targets of these antisense S-DNAs. We also show that parameters to describe subsets of the data, such as the mRNAs being targeted and the cell lines used, can be included in such a derivation. While NNN triplet parameters provided an adequate model to fit our data, NN doublet parameters did not.ConclusionsThe methodology presented illustrates how NNN antisense inhibitory information can be derived from in vivo cellular experiments. Subsequent calculations of the antisense inhibitory parameters for any mRNA target sequence automatically take into account the effects of all possible overlapping combinations of nearest-neighbors in the sequence. This procedure is more robust than the tallying of tetrameric motifs that have positive or negative antisense effects. The specific parameters derived in this work are limited in their applicability by the relatively small database of experiments that was used in their derivation.
| S-EPMC2877693 | biostudies-literature
Project description:Sepsis therapies have proven to be elusive because of the difficulty of translating biologically sound and effective interventions in animal models to humans. A part of this problem originates from the fact that septic patients present at various times after the onset of sepsis, whereas the exact time of infection is controlled in animal models. We sought to determine whether data mining longitudinal physiologic data in a nonhuman primate model of Escherichia coli-induced sepsis could help inform the time of onset of infection.A nearest-neighbor approach was used to back cast the time of onset of infection in animal models of sepsis. Animal data were censored to simulate prospective monitoring at any moment along the septic infection. This was compared against an uncensored database to find the most similar animal in order to estimate the infection onset time. Leave-one-out cross-validation was used for validation. Biomarker selection was performed based on the criteria of estimation accuracy and/or ease of measurement.Computational experimental on existing experimental data.Retrospective data from 33 septic baboons (Papio ursinus) subjected to Escherichia coli infusion. Validation was performed using 14 pigs that were subjected to surgically induced fecal peritonitis and 22 pigs that were subjected to lipopolysaccharide infusion.Longitudinal physiologic and serum markers, time of death. The presence of uniquely changing biomarkers during septic infection enabled the estimation of infection onset time in the datasets. Various combinations of temporal biomarkers, such as WBC, oxygen content, mean arterial pressure, and heart rate, yielded estimation accuracies of up to 97.8%. The use of temporal vital signs and a single measurement of serum biomarkers yielded highly accurate estimates without the need for invasive measurements. Validation in the pig data revealed similar results despite the heterogeneity of multiple experimental cohorts. This suggests that the method may be effective if sufficiently similar subjects are present in the database.One nearest-neighbor analysis showed promise in accurately identifying the onset of infection given a database of known infection times and of sufficient breadth. We suggest that this approach is ready for evaluation within the clinical setting using human data.
| S-EPMC5297595 | biostudies-literature
Project description:The linear "Ising" model, which has been around for nearly a century, treats the behavior of linear arrays of repetitive, interacting subunits. Linear "repeat-proteins" have only been described in the last decade or so, and their folding energies have only been characterized very recently. Owing to their repetitive structures, linear repeat-proteins are particularly well suited for analysis by the nearest-neighbor Ising formalism. After briefly describing the historical origins and applications of the Ising model to biopolymers, and introducing repeat protein structure, this chapter will focus on the application of the linear Ising model to repeat proteins. When applied to homopolymers, the model can be represented and applied in a fairly simplified form. When applied to heteropolymers, where differences in energies among individual subunits (i.e. repeats) must be included, some (but not all) of this simplicity is lost. Derivations of the linear Ising model for both homopolymer and heteropolymer repeat-proteins will be presented. With the increased complexity required for analysis of heteropolymeric repeat proteins, the ability to resolve different energy terms from experimental data can be compromised. Thus, a simple matrix approach will be developed to help inform on the degree to which different thermodynamic parameters can be extracted from a particular set of unfolding curves. Finally, we will describe the application of these models to analyze repeat-protein folding equilibria, focusing on simplified repeat proteins based on "consensus" sequence information.
| S-EPMC2967780 | biostudies-literature
Project description:By replacing lost or dysfunctional myocardium, tissue regeneration is a promising approach to treat heart failure. However, the challenge of detecting bona fide heart regeneration limits the validation of potential regenerative factors. One method to detect new cardiomyocytes is multicolor lineage tracing with clonal analysis. Clonal analysis experiments can be difficult to undertake, because labeling conditions that are too sparse lack sensitivity for rare events such as cardiomyocyte proliferation, and diffuse labeling limits the ability to resolve clones. Presented here is a protocol to undertake clonal analysis of the neonatal mouse heart by using statistical modeling of nearest neighbor distributions to resolve cardiomyocyte clones. This approach enables resolution of clones over a range of labeling conditions and provides a robust analytical approach for quantifying cardiomyocyte proliferation and regeneration. This protocol can be adapted to other tissues and can be broadly used to study tissue regeneration.
| S-EPMC7594646 | biostudies-literature
Project description:RationaleAdvanced algorithmic solutions are necessary to process the ever-increasing amounts of mass spectrometry data that are being generated. In this study, we describe the falcon spectrum clustering tool for efficient clustering of millions of MS/MS spectra.Methodsfalcon succeeds in efficiently clustering large amounts of mass spectral data using advanced techniques for fast spectrum similarity searching. First, high-resolution spectra are binned and converted to low-dimensional vectors using feature hashing. Next, the spectrum vectors are used to construct nearest neighbor indexes for fast similarity searching. The nearest neighbor indexes are used to efficiently compute a sparse pairwise distance matrix without having to exhaustively perform all pairwise spectrum comparisons within the relevant precursor mass tolerance. Finally, density-based clustering is performed to group similar spectra into clusters.ResultsSeveral state-of-the-art spectrum clustering tools were evaluated using a large draft human proteome data set consisting of 25 million spectra, indicating that alternative tools produce clustering results with different characteristics. Notably, falcon generates larger highly pure clusters than alternative tools, leading to a larger reduction in data volume without the loss of relevant information for more efficient downstream processing.Conclusionsfalcon is a highly efficient spectrum clustering tool, which is publicly available as an open source under the permissive BSD license at https://github.com/bittremieux/falcon.
| S-EPMC8709870 | biostudies-literature
Project description:MotivationFolding during transcription can have an important influence on the structure and function of RNA molecules, as regions closer to the 5' end can fold into metastable structures before potentially stronger interactions with the 3' end become available. Thermodynamic RNA folding models are not suitable to predict structures that result from cotranscriptional folding, as they can only calculate properties of the equilibrium distribution. Other software packages that simulate the kinetic process of RNA folding during transcription exist, but they are mostly applicable for short sequences.ResultsWe present a new algorithm that tracks changes to the RNA secondary structure ensemble during transcription. At every transcription step, new representative local minima are identified, a neighborhood relation is defined and transition rates are estimated for kinetic simulations. After every simulation, a part of the ensemble is removed and the remainder is used to search for new representative structures. The presented algorithm is deterministic (up to numeric instabilities of simulations), fast (in comparison with existing methods), and it is capable of folding RNAs much longer than 200 nucleotides.Availability and implementationThis software is open-source and available at https://github.com/ViennaRNA/drtransformer.Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC9889959 | biostudies-literature
Project description:We consider two types of spatial symmetry, namely, symmetry in the mixed or shared nearest neighbor (NN) structures. We use Pielou's and Dixon's symmetry tests which are defined using contingency tables based on the NN relationships between the data points. We generalize these tests to multiple classes and demonstrate that both the asymptotic and exact versions of Pielou's first type of symmetry test are extremely conservative in rejecting symmetry in the mixed NN structure and hence should be avoided or only the Monte Carlo randomized version should be used. Under RL, we derive the asymptotic distribution for Dixon's symmetry test and also observe that the usual independence test seems to be appropriate for Pielou's second type of test. Moreover, we apply variants of Fisher's exact test on the shared NN contingency table for Pielou's second test and determine the most appropriate version for our setting. We also consider pairwise and one-versus-rest type tests in post hoc analysis after a significant overall symmetry test. We investigate the asymptotic properties of the tests, prove their consistency under appropriate null hypotheses, and investigate finite sample performance of them by extensive Monte Carlo simulations. The methods are illustrated on a real-life ecological data set.
| S-EPMC3926298 | biostudies-other