Sciweavers

357 search results - page 67 / 72
» Selecting and constructing features using grammatical evolut...
Sort
View
ICDM
2003
IEEE
158views Data Mining» more  ICDM 2003»
14 years 1 months ago
Identifying Markov Blankets with Decision Tree Induction
The Markov Blanket of a target variable is the minimum conditioning set of variables that makes the target independent of all other variables. Markov Blankets inform feature selec...
Lewis Frey, Douglas H. Fisher, Ioannis Tsamardinos...
IDA
1997
Springer
14 years 2 days ago
How to Find Big-Oh in Your Data Set (and How Not to)
The empirical curve bounding problem is de ned as follows. Suppose data vectors X Y are presented such that E(Y i]) = f(X i]) where f(x) is an unknown function. The problem is to a...
Catherine C. McGeoch, Doina Precup, Paul R. Cohen
PRL
2008
213views more  PRL 2008»
13 years 7 months ago
Boosting recombined weak classifiers
Boosting is a set of methods for the construction of classifier ensembles. The differential feature of these methods is that they allow to obtain a strong classifier from the comb...
Juan José Rodríguez, Jesús Ma...
CORR
2011
Springer
151views Education» more  CORR 2011»
13 years 2 months ago
A supervised clustering approach for fMRI-based inference of brain states
We propose a method that combines signals from many brain regions observed in functional Magnetic Resonance Imaging (fMRI) to predict the subject’s behavior during a scanning se...
Vincent Michel, Alexandre Gramfort, Gaël Varo...
ICISC
2000
126views Cryptology» more  ICISC 2000»
13 years 9 months ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...