Sciweavers

3837 search results - page 403 / 768
» Learning Approximate Consistencies
Sort
View
DATAMINE
2010
161views more  DATAMINE 2010»
15 years 4 months ago
Predicting labels for dyadic data
: In dyadic prediction, the input consists of a pair of items (a dyad), and the goal is to predict the value of an observation related to the dyad. Special cases of dyadic predicti...
Aditya Krishna Menon, Charles Elkan
ICPR
2008
IEEE
16 years 1 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang
COLT
2004
Springer
15 years 10 months ago
A New PAC Bound for Intersection-Closed Concept Classes
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...
Peter Auer, Ronald Ortner
SOCRATES
2008
125views Education» more  SOCRATES 2008»
15 years 8 months ago
Collaborative Knowledge Construction in Online Vocational Teacher Education
The purpose of this paper is to build a picture of knowledge construction models in online education. The study describes the knowledge construction process of a group of vocation...
Raimo Mäkelä, Marjatta Myllylä, Han...
JAIR
2011
134views more  JAIR 2011»
15 years 1 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...