199 search results - page 5 / 40 » Intensional Positive Set Theory |
KDD
2008
ACM
14 years 8 months ago
2008
ACM
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper we propose a novel approach termed as dynamic copula time-frequency distribution (DCTFD) for the construction of positive time-frequency distributions (PTFDs). DCTFD...
RSKT
2010
Springer
13 years 6 months ago
2010
Springer
A naive Bayesian classifier is a probabilistic classifier based on Bayesian decision theory with naive independence assumptions, which is often used for ranking or constructing a...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current...