Sciweavers

335 search results - page 7 / 67
» Kernel Machines and Boolean Functions
Sort
View
IJCNN
2007
IEEE
14 years 1 months ago
Agnostic Learning versus Prior Knowledge in the Design of Kernel Machines
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
Gavin C. Cawley, Nicola L. C. Talbot
DATE
2006
IEEE
88views Hardware» more  DATE 2006»
14 years 1 months ago
Using conjugate symmetries to enhance gate-level simulations
State machine based simulation of Boolean functions is substantially faster if the function being simulated is symmetric. Unfortunately function symmetries are comparatively rare....
Peter M. Maurer
ICML
2004
IEEE
14 years 8 months ago
Learning with non-positive kernels
In this paper we show that many kernel methods can be adapted to deal with indefinite kernels, that is, kernels which are not positive semidefinite. They do not satisfy Mercer...
Alexander J. Smola, Cheng Soon Ong, Stéphan...
BMCBI
2008
228views more  BMCBI 2008»
13 years 7 months ago
Adaptive diffusion kernel learning from biological networks for protein function prediction
Background: Machine-learning tools have gained considerable attention during the last few years for analyzing biological networks for protein function prediction. Kernel methods a...
Liang Sun, Shuiwang Ji, Jieping Ye
ML
2002
ACM
223views Machine Learning» more  ML 2002»
13 years 7 months ago
Text Categorization with Support Vector Machines. How to Represent Texts in Input Space?
The choice of the kernel function is crucial to most applications of support vector machines. In this paper, however, we show that in the case of text classification, term-frequenc...
Edda Leopold, Jörg Kindermann