We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
Background: In discriminant analysis of microarray data, usually a small number of samples are expressed by a large number of genes. It is not only difficult but also unnecessary ...
Support vector machines (SVMs) have proven to be a powerful technique for pattern classification. SVMs map inputs into a high dimensional space and then separate classes with a hy...
William M. Campbell, Joseph P. Campbell, Douglas A...
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,...
Many data mining applications have a large amount of data but labeling data is often difficult, expensive, or time consuming, as it requires human experts for annotation. Semi-supe...