32 search results - page 6 / 7 » Transductive Rademacher Complexities for Learning Over a Gra... |
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
This work presents a general rank-learning framework for passage ranking within Question Answering (QA) systems using linguistic and semantic features. The framework enables query...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We consider linear models for stochastic dynamics. To any such model can be associated a network (namely a directed graph) describing which degrees of freedom interact under the d...
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
Experimental analysis of networks of cooperative learning agents (to verify certain properties such as the system's stability) has been commonly used due to the complexity of...
108
Voted
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
137
click to vote
AII
1992
15 years 1 months ago
1992
Most theoretical models of inductive inference make the idealized assumption that the data available to a learner is from a single and accurate source. The subject of inaccuracies ...