Results 1  10
of
1,721
On the Power of Equivalence Queries
, 1994
"... In 1990, Angluin showed that no class exhibiting a combinatorial property called "approximate fingerprints" can be identified exactly using polynomially many Equivalence queries (of polynomial size). Here we show that this is a necessary condition: every class without approximate fingerpri ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
In 1990, Angluin showed that no class exhibiting a combinatorial property called "approximate fingerprints" can be identified exactly using polynomially many Equivalence queries (of polynomial size). Here we show that this is a necessary condition: every class without approximate
NonEquivalent Query Rewritings
 In International Database Conference, Hong Kong
, 1999
"... this paper, we apply this concept of nonequivalent query rewriting to the problem of maintaining view definitions (data warehouses), where it now allows us to handle a much larger class of changes of the underlying information sources, namely not only data but also schema changes. This relaxed quer ..."
Abstract

Cited by 9 (8 self)
 Add to MetaCart
this paper, we apply this concept of nonequivalent query rewriting to the problem of maintaining view definitions (data warehouses), where it now allows us to handle a much larger class of changes of the underlying information sources, namely not only data but also schema changes. This relaxed
Learning DFA from correction and equivalence queries
 IN: PROC. 8TH INTERNATIONAL COLLOQUIUM ON GRAMMATICAL INFERENCE (ICGI ’06). VOLUME 4201 OF LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
, 2006
"... In active learning, membership queries and equivalence queries have established themselves as the standard combination to be used. However, they are quite “unnatural” for real learning environments (membership queries are oversimplified and equivalence queries do not have a correspondence in a real ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
In active learning, membership queries and equivalence queries have established themselves as the standard combination to be used. However, they are quite “unnatural” for real learning environments (membership queries are oversimplified and equivalence queries do not have a correspondence in a
Learning Unions of Boxes with Membership and Equivalence Queries
 in Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory
, 1994
"... We present two algorithms that use membership and equivalence queries to exactly identify the concepts given by the union of s discretized axisparallel boxes in ddimensional discretized Euclidean space where each coordinate can have n discrete values. The first algorithm receives at most sd count ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
We present two algorithms that use membership and equivalence queries to exactly identify the concepts given by the union of s discretized axisparallel boxes in ddimensional discretized Euclidean space where each coordinate can have n discrete values. The first algorithm receives at most sd
Learning Multivariate Polynomials from Substitution and Equivalence Queries
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY
, 1996
"... It has been shown in previous recent work that multiplicity automata are predictable from multiplicity and equivalence queries. In this paper we generalize related notions in a matrix representation and obtain a basis for the solution of a number of open problems in learnability theory. Membersh ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
It has been shown in previous recent work that multiplicity automata are predictable from multiplicity and equivalence queries. In this paper we generalize related notions in a matrix representation and obtain a basis for the solution of a number of open problems in learnability theory
Using Fewer Examples to Simulate Equivalence Queries
, 1996
"... It is well known that an algorithm that learns exactly using Equivalence queries can be transformed into a PAC algorithm that asks for random labelled examples. The first transformation due to Angluin (1988) uses a number of examples quadratic in the number of queries. Later, Littlestone (1989) and ..."
Abstract
 Add to MetaCart
It is well known that an algorithm that learns exactly using Equivalence queries can be transformed into a PAC algorithm that asks for random labelled examples. The first transformation due to Angluin (1988) uses a number of examples quadratic in the number of queries. Later, Littlestone (1989
A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries
 Information Processing Letters
, 1996
"... We present a 2 time exact learning algorithm for polynomial size DNF using equivalence queries only. In particular, DNF is PAClearnable in subexponential time under any distribution. This is the first subexponential time PAClearning algorithm for DNF under any distribution. ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
We present a 2 time exact learning algorithm for polynomial size DNF using equivalence queries only. In particular, DNF is PAClearnable in subexponential time under any distribution. This is the first subexponential time PAClearning algorithm for DNF under any distribution.
Using multiplicity automata to identify transducer relations from membership and equivalence queries
 In Proc. 9th Int. Coll. Grammatical Inference, volume 5278 of LNCS
, 2008
"... Abstract. Multiplicity Automata are devices that implement functions from a string space to a field. Usually the real number’s field is used. From a learning point of view there exist some algorithms that are able to identify any multiplicity automaton from membership and equivalence queries. In thi ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. Multiplicity Automata are devices that implement functions from a string space to a field. Usually the real number’s field is used. From a learning point of view there exist some algorithms that are able to identify any multiplicity automaton from membership and equivalence queries
Results 1  10
of
1,721