Sciweavers

476 search results - page 86 / 96
» Learning When to Use Lazy Learning in Constraint Solving
Sort
View
ECAI
2010
Springer
13 years 6 months ago
Describing the Result of a Classifier to the End-User: Geometric-based Sensitivity
This paper addresses the issue of supporting the end-user of a classifier, when it is used as a decision support system, to classify new cases. We consider several kinds of classif...
Isabelle Alvarez, Sophie Martin, Salma Mesmoudi
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
14 years 2 months ago
Credit assignment in adaptive memetic algorithms
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
J. E. Smith
EXACT
2009
13 years 6 months ago
Explaining a Result to the End-User: A Geometric Approach for Classification Problems
This paper addresses the issue of the explanation of the result given to the end-user by a classifier, when it is used as a decision support system. We consider machine learning cl...
Isabelle Alvarez, Sophie Martin
WWW
2003
ACM
14 years 9 months ago
Adaptive ranking of web pages
In this paper, we consider the possibility of altering the PageRank of web pages, from an administrator's point of view, through the modification of the PageRank equation. It...
Ah Chung Tsoi, Gianni Morini, Franco Scarselli, Ma...
CP
2009
Springer
14 years 9 months ago
Minimising Decision Tree Size as Combinatorial Optimisation
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
Christian Bessiere, Emmanuel Hebrard, Barry O'Sull...