Sciweavers

162 search results - page 30 / 33
» Mining for the most certain predictions from dyadic data
Sort
View
RSFDGRC
2005
Springer
190views Data Mining» more  RSFDGRC 2005»
14 years 27 days ago
Finding Rough Set Reducts with SAT
Abstract. Feature selection refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encountered in many areas such as machine...
Richard Jensen, Qiang Shen, Andrew Tuson
BMCBI
2007
127views more  BMCBI 2007»
13 years 7 months ago
CORRIE: enzyme sequence annotation with confidence estimates
Using a previously developed automated method for enzyme annotation, we report the reannotation of the ENZYME database and the analysis of local error rates per class. In control ...
Benjamin Audit, Emmanuel D. Levy, Walter R. Gilks,...
BMCBI
2010
172views more  BMCBI 2010»
13 years 7 months ago
Comparison of evolutionary algorithms in gene regulatory network model inference
Background: The evolution of high throughput technologies that measure gene expression levels has created a data base for inferring GRNs (a process also known as reverse engineeri...
Alina Sîrbu, Heather J. Ruskin, Martin Crane
CSB
2003
IEEE
130views Bioinformatics» more  CSB 2003»
14 years 21 days ago
A Computational Approach to Reconstructing Gene Regulatory Networks
Reverse-engineering of gene networks using linear models often results in an underdetermined system because of excessive unknown parameters. In addition, the practical utility of ...
Xutao Deng, Hesham H. Ali
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
14 years 7 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea