Sciweavers

1244 search results - page 118 / 249
» Searching in Higher Dimension
Sort
View
ICMLA
2008
13 years 11 months ago
On the Use of Accuracy and Diversity Measures for Evaluating and Selecting Ensembles of Classifiers
The test set accuracy for ensembles of classifiers selected based on single measures of accuracy and diversity as well as combinations of such measures is investigated. It is foun...
Tuve Löfström, Ulf Johansson, Henrik Bos...
ICGA
1993
140views Optimization» more  ICGA 1993»
13 years 11 months ago
Expected Allele Coverage and the Role of Mutation in Genetic Algorithms
It is part of the traditional lore of genetic algorithms that low mutation rates lead to efficient search of the solution space, while high mutation rates result in diffusion of s...
David M. Tate, Alice E. Smith
CORR
2006
Springer
118views Education» more  CORR 2006»
13 years 10 months ago
Minimally Invasive Randomization for Collecting Unbiased Preferences from Clickthrough Logs
Clickthrough data is a particularly inexpensive and plentiful resource to obtain implicit relevance feedback for improving and personalizing search engines. However, it is well kn...
Filip Radlinski, Thorsten Joachims
KES
2010
Springer
13 years 8 months ago
An Efficient Mechanism for Stemming and Tagging: The Case of Greek Language
In an era that, searching the WWW for information becomes a tedious task, it is obvious that mainly search engines and other data mining mechanisms need to be enhanced with charact...
Giorgos Adam, Konstantinos Asimakis, Christos Bour...
SGAI
2007
Springer
14 years 4 months ago
Escaping Local Optima: Constraint Weights vs. Value Penalties
Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the cons...
Muhammed Basharu, Inés Arana, Hatem Ahriz