Sciweavers

1017 search results - page 62 / 204
» Constructive and collaborative learning of algorithms
Sort
View
115
Voted
FOCM
2007
76views more  FOCM 2007»
15 years 17 days ago
Risk Bounds for Random Regression Graphs
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
Andrea Caponnetto, Steve Smale
85
Voted
DAGSTUHL
2001
15 years 2 months ago
Understanding Algorithms by Means of Visualized Path Testing
Visualization of an algorithm offers only a rough picture of operations. Explanations are crucial for deeper understanding, because they help the viewer to associate the visualiza...
Ari Korhonen, Erkki Sutinen, Jorma Tarhio
129
Voted
RSCTC
1993
Springer
161views Fuzzy Logic» more  RSCTC 1993»
15 years 4 months ago
Quantifying Uncertainty of Knowledge Discovered From Databases
This paper focuses on the application of rough set constructs to inductive learning from a database. A design guideline is suggested, which provides users the option to choose app...
Yang Xiang, S. K. Michael Wong, Nick Cercone
CORR
2006
Springer
99views Education» more  CORR 2006»
15 years 19 days ago
PAC Learning Mixtures of Axis-Aligned Gaussians with No Separation Assumption
Abstract. We propose and analyze a new vantage point for the learning of mixtures of Gaussians: namely, the PAC-style model of learning probability distributions introduced by Kear...
Jon Feldman, Ryan O'Donnell, Rocco A. Servedio
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
15 years 2 months ago
Stochastic local search in continuous domains: questions to be answered when designing a novel algorithm
Several population-based methods (with origins in the world of evolutionary strategies and estimation-of-distribution algorithms) for black-box optimization in continuous domains ...
Petr Posik