Sciweavers

4255 search results - page 226 / 851
» On Learning Boolean Functions
Sort
View
ICML
2004
IEEE
16 years 7 months ago
Unifying collaborative and content-based filtering
Collaborative and content-based filtering are two paradigms that have been applied in the context of recommender systems and user preference prediction. This paper proposes a nove...
Justin Basilico, Thomas Hofmann
COLT
1994
Springer
15 years 10 months ago
Rigorous Learning Curve Bounds from Statistical Mechanics
In this paper we introduce and investigate a mathematically rigorous theory of learning curves that is based on ideas from statistical mechanics. The advantage of our theory over ...
David Haussler, H. Sebastian Seung, Michael J. Kea...
COLT
2006
Springer
15 years 10 months ago
Stable Transductive Learning
Abstract. We develop a new error bound for transductive learning algorithms. The slack term in the new bound is a function of a relaxed notion of transductive stability, which meas...
Ran El-Yaniv, Dmitry Pechyony
IJKL
2007
46views more  IJKL 2007»
15 years 6 months ago
Trialogical learning in public: FlashMeeting recording and reuse in a peer-learning context
: Online meetings are increasingly popular in support of technology-enhanced learning collaboration. When these virtual meetings are recorded and shared in the host community and b...
Peter J. Scott, Linda J. Castaneda, Kevin Quick, J...
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 6 months ago
Efficient Minimization of Decomposable Submodular Functions
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
Peter Stobbe, Andreas Krause