Sciweavers

866 search results - page 54 / 174
» Incremental Class Testing from a Class Test Order
Sort
View
ACTAC
1998
71views more  ACTAC 1998»
15 years 3 months ago
On the Information Content of Semi-Structured Databases
In a semi-structured database there is no clear separation between the data and the schema, and the degree to which it is structured depends on the application. Semi-structured da...
Mark Levene
136
Voted
ICASSP
2010
IEEE
15 years 3 months ago
Weakly supervised learning with decision trees applied to fisheries acoustics
This paper addresses the training of classification trees for weakly labelled data. We call ”weakly labelled data”, a training set such as the prior labelling information pro...
Riwal Lefort, Ronan Fablet, Jean-Marc Boucher
BMCBI
2006
150views more  BMCBI 2006»
15 years 3 months ago
Instance-based concept learning from multiclass DNA microarray data
Background: Various statistical and machine learning methods have been successfully applied to the classification of DNA microarray data. Simple instance-based classifiers such as...
Daniel P. Berrar, Ian Bradbury, Werner Dubitzky
BMCBI
2006
200views more  BMCBI 2006»
15 years 3 months ago
Comparison and evaluation of methods for generating differentially expressed gene lists from microarray data
Background: Numerous feature selection methods have been applied to the identification of differentially expressed genes in microarray data. These include simple fold change, clas...
Ian B. Jeffery, Desmond G. Higgins, Aedín C...
141
Voted
LICS
2010
IEEE
15 years 1 months ago
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
Martin Grohe