version spaces
Recently Published Documents


TOTAL DOCUMENTS

31
(FIVE YEARS 0)

H-INDEX

8
(FIVE YEARS 0)

2019 ◽  
Vol 30 (02) ◽  
pp. 333-353 ◽  
Author(s):  
Miguel Couceiro ◽  
Miklós Maróti ◽  
Tamás Waldhauser ◽  
László Zádori

We consider a lattice-based model in multiattribute decision making, where preferences are represented by global utility functions that evaluate alternatives in a lattice structure (which can account for situations of indifference as well as of incomparability). Essentially, this evaluation is obtained by first encoding each of the attributes (nominal, qualitative, numeric, etc.) of each alternative into a distributive lattice, and then aggregating such values by lattice functions. We formulate version spaces within this model (global preferences consistent with empirical data) as solutions of an interpolation problem and present their complete descriptions accordingly. Moreover, we consider the computational complexity of this interpolation problem, and show that up to 3 attributes it is solvable in polynomial time, whereas it is NP complete over more than 3 attributes. Our results are then illustrated with a concrete example.



2012 ◽  
Vol 45 (4) ◽  
pp. 658-666 ◽  
Author(s):  
M.C. Lin ◽  
D.J. Vreeman ◽  
Clement J. McDonald ◽  
S.M. Huff
Keyword(s):  


2012 ◽  
pp. 109-126
Author(s):  
Evgueni Smirnov ◽  
Georgi Nalbantov ◽  
Ida Sprinkhuizen-Kuyper


2009 ◽  
Vol 34 ◽  
pp. 165-208 ◽  
Author(s):  
S. A. Wallace

In this paper, we explore methods for comparing agent behavior with human behavior to assist with validation. Our exploration begins by considering a simple method of behavior comparison. Motivated by shortcomings in this initial approach, we introduce behavior bounding, an automated model-based approach for comparing behavior that is inspired, in part, by Mitchell’s Version Spaces. We show that behavior bounding can be used to compactly represent both human and agent behavior. We argue that relatively low amounts of human effort are required to build, maintain, and use the data structures that underlie behavior bounding, and we provide a theoretical basis for these arguments using notions of PAC Learnability. Next, we show empirical results indicating that this approach is effective at identifying differences in certain types of behaviors and that it performs well when compared against our initial benchmark methods. Finally, we demonstrate that behavior bounding can produce information that allows developers to identify and fix problems in an agent’s behavior much more efficiently than standard debugging techniques.



Author(s):  
Stasinos Konstantopoulos ◽  
Rui Camacho ◽  
Nuno A. Fonseca ◽  
Vítor Santos Costa

This chapter introduces Inductive Logic Programming (ILP) from the perspective of search algorithms in Computer Science. It first briefly considers the Version Spaces approach to induction, and then focuses on Inductive Logic Programming: from its formal definition and main techniques and strategies, to priors used to restrict the search space and optimized sequential, parallel, and stochastic algorithms. The authors hope that this presentation of the theory and applications of Inductive Logic Programming will help the reader understand the theoretical underpinnings of ILP, and also provide a helpful overview of the State-of-the-Art in the domain.



Author(s):  
E. N. Smirnov ◽  
I. G. Sprinkhuizen-Kuyper ◽  
G. I. Nalbantov
Keyword(s):  


2004 ◽  
Vol 156 (2) ◽  
pp. 115-138 ◽  
Author(s):  
Haym Hirsh ◽  
Nina Mishra ◽  
Leonard Pitt


Sign in / Sign up

Export Citation Format

Share Document