4255 search results - page 465 / 851 » On Learning Boolean Functions |
195
click to vote
NIPS
2008
15 years 8 months ago
2008
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...
177
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
169
click to vote
NIPS
1993
15 years 8 months ago
1993
The game of Go has a high branching factor that defeats the tree search approach used in computer chess, and long-range spatiotemporal interactions that make position evaluation e...
257
Voted
DBWORKSHOPS
1992
15 years 8 months ago
1992
Godin, R. and R. Missaoui, An incremental concept formation approach for learning from databases, Theoretical Computer Science 133 (1994) 3533385. This paper describes a concept f...
219
click to vote
JMLR
2006
15 years 6 months ago
2006
Many kernel learning algorithms, including support vector machines, result in a kernel machine, such as a kernel classifier, whose key component is a weight vector in a feature sp...