Sciweavers

3694 search results - page 338 / 739
» Stochastic complexity in learning
Sort
View
SIGECOM
2004
ACM
135views ECommerce» more  SIGECOM 2004»
16 years 2 days ago
Applying learning algorithms to preference elicitation
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
Sébastien Lahaie, David C. Parkes
CHI
1998
ACM
15 years 11 months ago
New Media, New Practices: Experiences in Open Learning Course Design
We explore some of the complex issues surrounding the design and use of multimedia and Internet-based learning resources in distance education courses. We do so by analysing our e...
Tamara Sumner, Josie Taylor
SDM
2007
SIAM
182views Data Mining» more  SDM 2007»
15 years 8 months ago
Distance Preserving Dimension Reduction for Manifold Learning
Manifold learning is an effective methodology for extracting nonlinear structures from high-dimensional data with many applications in image analysis, computer vision, text data a...
Hyunsoo Kim, Haesun Park, Hongyuan Zha
IADIS
2004
15 years 8 months ago
Designing a personalized E-learning experience using learning objects
This paper aims to provide an experimental vision of the process of course creation using learning objects obtained in the <e-aula> project, a pilot e-learning system concei...
Pilar Sancho, Borja Manero, Baltasar Fernán...
AI
2008
Springer
15 years 6 months ago
Label ranking by learning pairwise preferences
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
Eyke Hüllermeier, Johannes Fürnkranz, We...