Sciweavers

1414 search results - page 153 / 283
» Randomness and Universal Machines
Sort
View
87
Voted
ECTEL
2010
Springer
15 years 29 days ago
Ambient Displays and Game Design Patterns
In this paper we describe a social learning game we implemented to evaluate various means of ubiquitous learning support. Making use of game design patterns it was possible to impl...
Sebastian Kelle, Dirk Börner, Marco Kalz, Mar...
99
Voted
TKDE
2008
123views more  TKDE 2008»
15 years 20 days ago
Explaining Classifications For Individual Instances
We present a method for explaining predictions for individual instances. The presented approach is general and can be used with all classification models that output probabilities...
Marko Robnik-Sikonja, Igor Kononenko
83
Voted
ML
2000
ACM
105views Machine Learning» more  ML 2000»
15 years 16 days ago
Multiple Comparisons in Induction Algorithms
Abstract. A single mechanism is responsible for three pathologies of induction algorithms: attribute selection errors, overfitting, and oversearching. In each pathology, induction ...
David D. Jensen, Paul R. Cohen
114
Voted
COLT
2010
Springer
14 years 10 months ago
Hedging Structured Concepts
We develop an online algorithm called Component Hedge for learning structured concept classes when the loss of a structured concept sums over its components. Example classes inclu...
Wouter M. Koolen, Manfred K. Warmuth, Jyrki Kivine...
118
Voted
COLT
2010
Springer
14 years 10 months ago
Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...
Adi Akavia