Sciweavers

388 search results - page 57 / 78
» Learning Methods for DNA Binding in Computational Biology
Sort
View
ROCAI
2004
Springer
15 years 3 months ago
Learning Mixtures of Localized Rules by Maximizing the Area Under the ROC Curve
We introduce a model class for statistical learning which is based on mixtures of propositional rules. In our mixture model, the weight of a rule is not uniform over the entire ins...
Tobias Sing, Niko Beerenwinkel, Thomas Lengauer
ALMOB
2008
69views more  ALMOB 2008»
14 years 9 months ago
Learning from positive examples when the negative class is undetermined- microRNA gene identification
Background: The application of machine learning to classification problems that depend only on positive examples is gaining attention in the computational biology community. We an...
Malik Yousef, Segun Jung, Louise C. Showe, Michael...
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
15 years 2 months ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...
BMCBI
2011
14 years 1 months ago
ShoRAH: estimating the genetic diversity of a mixed sample from next-generation sequencing data
Background: With next-generation sequencing technologies, experiments that were considered prohibitive only a few years ago are now possible. However, while these technologies hav...
Osvaldo Zagordi, Arnab Bhattacharya, Nicholas Erik...
PKDD
2010
Springer
158views Data Mining» more  PKDD 2010»
14 years 8 months ago
Learning Sparse Gaussian Markov Networks Using a Greedy Coordinate Ascent Approach
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
Katya Scheinberg, Irina Rish