266 search results - page 14 / 54 » Learning to Identify Unexpected Instances in the Test Set |
100
click to vote
KAIS
2000
14 years 11 months ago
2000
In this paper, a fast adaptive neural network classifier named FANNC is proposed. FANNC exploits the advantages of both adaptive resonance theory and field theory. It needs only on...
ICML
2006
IEEE
16 years 17 days ago
2006
IEEE
Support Vector Machines (SVMs) suffer from an O(n2 ) training cost, where n denotes the number of training instances. In this paper, we propose an algorithm to select boundary ins...
101
click to vote
ECIR
2011
Springer
14 years 3 months ago
2011
Springer
Aggregate ranking tasks are those where documents are not the final ranking outcome, but instead an intermediary component. For instance, in expert search, a ranking of candidate ...
88
Voted
LREC
2010
15 years 1 months ago
2010
In the paper we investigate the impact of data size on a Word Sense Disambiguation task (WSD). We question the assumption that the knowledge acquisition bottleneck, which is known...
AE
2007
Springer
15 years 6 months ago
2007
Springer
We propose using the so called Royal Road functions as test functions for cooperative co-evolutionary algorithms (CCEAs). The Royal Road functions were created in the early 90’s ...