Sciweavers

1326 search results - page 60 / 266
» Approximate Tree Kernels
Sort
View
109
Voted
ESANN
2007
15 years 3 months ago
"Kernelized" Self-Organizing Maps for Structured Data
The suitability of the well known kernels for trees, and the lesser known SelfOrganizing Map for Structures for categorization tasks on structured data is investigated in this pap...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
NIPS
2001
15 years 3 months ago
Kernel Machines and Boolean Functions
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
Adam Kowalczyk, Alex J. Smola, Robert C. Williamso...
117
Voted
IPPS
2005
IEEE
15 years 8 months ago
Tight Bounds for Wavelength Assignment on Trees of Rings
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
144
Voted
JMLR
2010
198views more  JMLR 2010»
15 years 26 days ago
On Learning with Integral Operators
A large number of learning algorithms, for example, spectral clustering, kernel Principal Components Analysis and many manifold methods are based on estimating eigenvalues and eig...
Lorenzo Rosasco, Mikhail Belkin, Ernesto De Vito
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
15 years 6 months ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický