Sciweavers

408 search results - page 71 / 82
» Learning Preferences for Multiclass Problems
Sort
View
ICML
2008
IEEE
15 years 10 months ago
Nearest hyperdisk methods for high-dimensional classification
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
Hakan Cevikalp, Bill Triggs, Robi Polikar
95
Voted
JAIR
2011
134views more  JAIR 2011»
14 years 4 months ago
Scaling up Heuristic Planning with Relational Decision Trees
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
Tomás de la Rosa, Sergio Jiménez, Ra...
91
Voted
ICDM
2009
IEEE
188views Data Mining» more  ICDM 2009»
14 years 7 months ago
Binomial Matrix Factorization for Discrete Collaborative Filtering
Matrix factorization (MF) models have proved efficient and well scalable for collaborative filtering (CF) problems. Many researchers also present the probabilistic interpretation o...
Jinlong Wu
ICALT
2006
IEEE
15 years 3 months ago
Mobile Technology and Content Delivery in Education
The purpose of this workshop is to identify various issues that are pertinent to the development and delivery of content in the context of mobile devices. The workshop will focus ...
Rory McGreal, Kinshuk
80
Voted
IJCAI
1989
14 years 10 months ago
A Critique of the Valiant Model
This paper considers the Valiant framework as it is applied to the task of learning logical concepts from random examples. It is argued that the current interpretation of this Val...
Wray L. Buntine