2012
DOI: 10.1007/978-3-642-32909-8_24
|View full text |Cite
|
Sign up to set email alerts
|

Using Varying Negative Examples to Improve Computational Predictions of Transcription Factor Binding Sites

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2017
2017
2017
2017

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…The aim of this is not just to characterize the classes of the existing data, but to be able to extrapolate the likely class of previously unclassified data. We have used this technique in another related bioinformatics project [86]. There are many machine learning tools that can be used, such as Support Vector Machines, Random Forests and Bayesian methods.…”
Section: Machine Learning To Identify R Genes Lacking Conserved Domainsmentioning
confidence: 99%
See 1 more Smart Citation
“…The aim of this is not just to characterize the classes of the existing data, but to be able to extrapolate the likely class of previously unclassified data. We have used this technique in another related bioinformatics project [86]. There are many machine learning tools that can be used, such as Support Vector Machines, Random Forests and Bayesian methods.…”
Section: Machine Learning To Identify R Genes Lacking Conserved Domainsmentioning
confidence: 99%
“…This will be the case if ''near missies" are well represented as such cases are particularly useful in determining high quality decision boundaries. An extended discussion of this issue has been published [86].…”
Section: Machine Learning To Identify R Genes Lacking Conserved Domainsmentioning
confidence: 99%