Sciweavers

6715 search results - page 1050 / 1343
» Learning from a Test Set
Sort
View
GECCO
2008
Springer
123views Optimization» more  GECCO 2008»
15 years 7 months ago
MLS security policy evolution with genetic programming
In the early days a policy was a set of simple rules with a clear intuitive motivation that could be formalised to good effect. However the world is becoming much more complex. S...
Yow Tzu Lim, Pau-Chen Cheng, Pankaj Rohatgi, John ...
AAMAS
2008
Springer
15 years 6 months ago
Agents that argue and explain classifications
Argumentation is a promising approach used by autonomous agents for reasoning about inconsistent/incomplete/uncertain knowledge, based on the construction and the comparison of ar...
Leila Amgoud, Mathieu Serrurier
DATAMINE
2010
120views more  DATAMINE 2010»
15 years 6 months ago
A weighted voting summarization of SOM ensembles
Abstract Weighted Voting Superposition (WeVoS) is a novel summarization algorithm for the results of an ensemble of Self-Organizing Maps. Its principal aim is to achieve the lowest...
Bruno Baruque, Emilio Corchado
JMLR
2008
148views more  JMLR 2008»
15 years 6 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
AMAI
2005
Springer
15 years 6 months ago
Robust inference of trees
Abstract. This paper is concerned with the reliable inference of optimal treeapproximations to the dependency structure of an unknown distribution generating data. The traditional ...
Marco Zaffalon, Marcus Hutter
« Prev « First page 1050 / 1343 Last » Next »