Sciweavers

899 search results - page 148 / 180
» Is an ordinal class structure useful in classifier learning
Sort
View
BMCBI
2011
12 years 11 months ago
BICEPP: an example-based statistical text mining method for predicting the binary characteristics of drugs
Background: The identification of drug characteristics is a clinically important task, but it requires much expert knowledge and consumes substantial resources. We have developed ...
Frank P. Y. Lin, Stephen Anthony, Thomas M. Polase...
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 5 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
SDM
2012
SIAM
216views Data Mining» more  SDM 2012»
11 years 10 months ago
Feature Selection "Tomography" - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable
:  Feature Selection “Tomography” - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable George Forman HP Laboratories HPL-2010-19R1 Feature selection; ...
George Forman
JAIR
2008
148views more  JAIR 2008»
13 years 7 months ago
Learning Partially Observable Deterministic Action Models
We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...
Eyal Amir, Allen Chang
TSMC
2002
142views more  TSMC 2002»
13 years 7 months ago
Adaptive color reduction
Abstract--This paper proposes a new algorithm for the reduction of the number of colors in an image. The proposed adaptive color reduction (ACR) technique achieves color reduction ...
Nikos Papamarkos, Antonios Atsalakis, Charalambos ...