Sciweavers

1339 search results - page 89 / 268
» Learning Functions from Imperfect Positive Data
Sort
View
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 2 months ago
Improving data mining utility with projective sampling
Overall performance of the data mining process depends not just on the value of the induced knowledge but also on various costs of the process itself such as the cost of acquiring...
Mark Last
IDA
1998
Springer
13 years 9 months ago
Self-Organized-Expert Modular Network for Classification of Spatiotemporal Sequences
We investigate a form of modular neural network for classification with (a) pre-separated input vectors entering its specialist (expert) networks, (b) specialist networks which ar...
Sylvian R. Ray, William H. Hsu
IANDC
2006
102views more  IANDC 2006»
13 years 10 months ago
Polynomial certificates for propositional classes
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
Marta Arias, Aaron Feigelson, Roni Khardon, Rocco ...
BMCBI
2005
104views more  BMCBI 2005»
13 years 10 months ago
Scoring functions for transcription factor binding site prediction
Background: Transcription factor binding site (TFBS) prediction is a difficult problem, which requires a good scoring function to discriminate between real binding sites and backg...
Markus T. Friberg, Peter von Rohr, Gaston H. Gonne...
ECCV
2008
Springer
14 years 12 months ago
Scale Invariant Action Recognition Using Compound Features Mined from Dense Spatio-temporal Corners
Abstract. The use of sparse invariant features to recognise classes of actions or objects has become common in the literature. However, features are often "engineered" to...
Andrew Gilbert, John Illingworth, Richard Bowden