Sciweavers

919 search results - page 24 / 184
» Generalizing over Several Learning Settings
Sort
View
COLT
2008
Springer
13 years 9 months ago
Dimension and Margin Bounds for Reflection-invariant Kernels
A kernel over the Boolean domain is said to be reflection-invariant, if its value does not change when we flip the same bit in both arguments. (Many popular kernels have this prop...
Thorsten Doliwa, Michael Kallweit, Hans-Ulrich Sim...
ICML
2006
IEEE
14 years 4 months ago
Cover Trees for Nearest Neighbor
We present a tree data structure for fast nearest neighbor operations in general n- point metric spaces (where the data set con- sists of n points). The data structure re- quir...
Alina Beygelzimer, Sham Kakade, John Langford
PKDD
2010
Springer
122views Data Mining» more  PKDD 2010»
13 years 6 months ago
Exploration in Relational Worlds
Abstract. One of the key problems in model-based reinforcement learning is balancing exploration and exploitation. Another is learning and acting in large relational domains, in wh...
Tobias Lang, Marc Toussaint, Kristian Kersting
DAGSTUHL
2010
13 years 9 months ago
Generalized Hyper-cylinders: a Mechanism for Modeling and Visualizing N-D Objects
The display of surfaces and solids has usually been restricted to the domain of scientific visualization; however, little work has been done on the visualization of surfaces and s...
Matthew O. Ward, Zhenyu Guo
KDD
2002
ACM
104views Data Mining» more  KDD 2002»
14 years 8 months ago
Generalization Methods in Bioinformatics
Protein secondary structure prediction and high-throughput drug screen data mining are two important applications in bioinformatics. The data is represented in sparse feature spac...
Steven Eschrich, Nitesh V. Chawla, Lawrence O. Hal...