Sciweavers

263 search results - page 20 / 53
» Splitting of Learnable Classes
Sort
View
ATAL
2009
Springer
14 years 3 months ago
False name manipulations in weighted voting games: splitting, merging and annexation
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
Haris Aziz, Mike Paterson
ALT
2008
Springer
14 years 5 months ago
Numberings Optimal for Learning
This paper extends previous studies on learnability in non-acceptable numberings by considering the question: for which criteria which numberings are optimal, that is, for which nu...
Sanjay Jain, Frank Stephan
ALT
2006
Springer
14 years 5 months ago
Iterative Learning from Positive Data and Negative Counterexamples
A model for learning in the limit is defined where a (so-called iterative) learner gets all positive examples from the target language, tests every new conjecture with a teacher ...
Sanjay Jain, Efim B. Kinber
ICML
2002
IEEE
14 years 9 months ago
Learning Decision Trees Using the Area Under the ROC Curve
ROC analysis is increasingly being recognised as an important tool for evaluation and comparison of classifiers when the operating characteristics (i.e. class distribution and cos...
César Ferri, José Hernández-O...
SIGSOFT
1998
ACM
14 years 26 days ago
Reengineering Class Hierarchies Using Concept Analysis
The design of a class hierarchy may be imperfect. For example, a class C may contain a member m not accessed in any C-instance, an indication that m could be eliminated, or moved ...
Gregor Snelting, Frank Tip