Sciweavers

1310 search results - page 38 / 262
» Learning the k in k-means
Sort
View
MLG
2007
Springer
15 years 3 months ago
Transductive Rademacher Complexities for Learning Over a Graph
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...
Kristiaan Pelckmans, Johan A. K. Suykens
AI
2007
Springer
14 years 10 months ago
An economist's perspective on multi-agent learning
We comment on the Shoham, Powers, and Grenager survey of multi-agent learning and game theory, emphasizing that some of their categories are important for economics and others are...
Drew Fudenberg, David K. Levine
JMLR
2012
13 years 6 days ago
Sample Complexity of Composite Likelihood
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...
Joseph K. Bradley, Carlos Guestrin
COLT
2005
Springer
15 years 3 months ago
Leaving the Span
We discuss a simple sparse linear problem that is hard to learn with any algorithm that uses a linear combination of the training instances as its weight vector. The hardness holds...
Manfred K. Warmuth, S. V. N. Vishwanathan
ITICSE
2000
ACM
15 years 2 months ago
Student well-being in a computing department
We describe a project exploring the relationships between factors in the learning environment, student well-being and learning outcomes, in the context of a Computing department. ...
J. R. Davy, K. Audin, M. Barkham, C. Joyner