4903 search results - page 538 / 981 » The Set Covering Machine |
190
click to vote
ICML
1994
IEEE
15 years 10 months ago
1994
IEEE
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
189
click to vote
ECML
1987
Springer
15 years 10 months ago
1987
Springer
This paper examines the induction of classification rules from examples using real-world data. Real-world data is almost always characterized by two features, which are important ...
194
click to vote
ALT
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We consider the problem of sequence prediction in a probabilistic setting. Let there be given a class C of stochastic processes (probability measures on the set of one-wa...
153
click to vote
ALT
2010
Springer
15 years 8 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 ...
192
click to vote
ALT
2010
Springer
15 years 8 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 ...