ALT
2010
Springer
13 years 6 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
ALT
2010
Springer
13 years 6 months ago
2010
Springer
ALT
2010
Springer
13 years 6 months ago
2010
Springer
ALT
2010
Springer
13 years 6 months ago
2010
Springer
: In many prediction problems, including those that arise in computer security and computational finance, the process generating the data is best modeled as an adversary with whom ...
ALT
2010
Springer
13 years 6 months ago
2010
Springer
We are studying long term sequence prediction (forecasting). We approach this by investigating criteria for choosing a compact useful state representation. The state is supposed t...
ALT
2010
Springer
13 years 6 months ago
2010
Springer
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability
ALT
2010
Springer
13 years 6 months ago
2010
Springer
Online learning and kernel learning are two active research topics in machine learning. Although each of them has been studied extensively, there is a limited effort in addressing ...
ALT
2010
Springer
13 years 6 months ago
2010
Springer
Stability has been explored to study the performance of learning algorithms in recent years and it has been shown that stability is sufficient for generalization and is sufficient ...
ALT
2010
Springer
13 years 6 months ago
2010
Springer
Many algorithms for grammatical inference can be viewed as instances of a more general algorithm which maintains a set of primitive elements, which distributionally define sets of ...
ALT
2010
Springer
13 years 6 months ago
2010
Springer
We explore a general Bayesian active learning setting, in which the learner can ask arbitrary yes/no questions. We derive upper and lower bounds on the expected number of queries r...