Sciweavers

2177 search results - page 160 / 436
» Relative Margin Machines
Sort
View
CEC
2007
IEEE
16 years 13 days ago
On the analysis of average time complexity of estimation of distribution algorithms
— Estimation of Distribution Algorithm (EDA) is a well-known stochastic optimization technique. The average time complexity is a crucial criterion that measures the performance o...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
FOCS
1999
IEEE
15 years 10 months ago
An Algorithmic Theory of Learning: Robust Concepts and Random Projection
We study the phenomenon of cognitive learning from an algorithmic standpoint. How does the brain effectively learn concepts from a small number of examples despite the fact that e...
Rosa I. Arriaga, Santosh Vempala
KDD
1998
ACM
84views Data Mining» more  KDD 1998»
15 years 10 months ago
Similarity of Attributes by External Probes
In data mining, similarity or distance between attributes is one of the central notions. Such a notion can be used to build attribute hierarchies etc. Similarity metrics can be us...
Gautam Das, Heikki Mannila, Pirjo Ronkainen
AAAI
2000
15 years 7 months ago
A Unified Bias-Variance Decomposition for Zero-One and Squared Loss
The bias-variance decomposition is a very useful and widely-used tool for understanding machine-learning algorithms. It was originally developed for squared loss. In recent years,...
Pedro Domingos
EDM
2009
110views Data Mining» more  EDM 2009»
15 years 3 months ago
Using Learning Decomposition and Bootstrapping with Randomization to Compare the Impact of Different Educational Interventions o
A basic question of instructional interventions is how effective it is in promoting student learning. This paper presents a study to determine the relative efficacy of different in...
Mingyu Feng, Joseph Beck, Neil T. Heffernan