Sciweavers

683 search results - page 54 / 137
» Generalization Bounds for Learning Kernels
Sort
View
WWW
2004
ACM
14 years 10 months ago
Active e-course for constructivist learning
An active e-course is a self-representable and self-organizable document mechanism with a flexible structure. The kernel of the active e-course is to organize learning materials i...
Hai Zhuge, Yanyan Li
ICML
2009
IEEE
14 years 10 months ago
Generalization analysis of listwise learning-to-rank algorithms
This paper presents a theoretical framework for ranking, and demonstrates how to perform generalization analysis of listwise ranking algorithms using the framework. Many learning-...
Yanyan Lan, Tie-Yan Liu, Zhiming Ma, Hang Li
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 8 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang
ALT
2006
Springer
14 years 6 months ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro
AGI
2008
13 years 11 months ago
VARIAC: an Autogenous Cognitive Architecture
Learning theory and programs to date are inductively bounded: they can be described as "wind-up toys" which can only learn the kinds of things that their designers envisi...
J. Storrs Hall