article

Queries and Concept Learning

Author:

Dana AngluinAuthors Info & Claims

Machine Learning, Volume 2, Issue 4

Pages 319 - 342

https://doi.org/10.1023/A:1022821128753

Published: 01 April 1988 Publication History

Publisher Site

Abstract

We consider the problem of using queries to learn an unknown concept. Several types of queries are described and studied: membership, equivalence, subset, superset, disjointness, and exhaustiveness queries. Examples are given of efficient learning methods using various subsets of these queries for formal domains, including the regular languages, restricted classes of context-free languages, the pattern languages, and restricted types of prepositional formulas. Some general lower bound techniques are given. Equivalence queries are compared with Valiant's criterion of probably approximately correct identification under random sampling.

Cited By

View all

ten Cate BKoudijs R(2024)Characterising Modal Formulas with ExamplesACM Transactions on Computational Logic10.1145/364946125:2(1-27)Online publication date: 16-Apr-2024
https://dl.acm.org/doi/10.1145/3649461
Tapia-Flores TLópez-Mellado E(2024)Discovering workflow nets of concurrent iterative processesActa Informatica10.1007/s00236-023-00445-561:1(1-21)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1007/s00236-023-00445-5
Attias IHanneke SKrause ABrunskill ECho KEngelhardt BSabato SScarlett J(2023)Adversarially robust PAC learnability of real-valued functionsProceedings of the 40th International Conference on Machine Learning10.5555/3618408.3618457(1172-1199)Online publication date: 23-Jul-2023
https://dl.acm.org/doi/10.5555/3618408.3618457
Show More Cited By

Queries and Concept Learning

Recommendations

Malicious Omissions and Errors in Answers to Membership Queries

We consider two issues in polynomial-time exact learning of concepts using membership and equivalence queries: (1) errors or omissions in answers to membership queries, and (2) learning finite variants of concepts drawn from a learnable class.

To study (...
Filtering unsatisfiable XPath queries

The satisfiability test checks, whether or not the evaluation of a query returns the empty set for any input document, and can be used in query optimization for avoiding the submission and the computation of unsatisfiable queries. Thus, applying the ...
Learning tree languages from positive examples and membership queries

We investigate regular tree languages' exact learning from positive examples and membership queries. Input data are trees of the language to infer. The learner computes new trees from the inputs and asks the oracle whether or not they belong to the ...

Comments

Information & Contributors

Information

Published In

Machine Language Volume 2, Issue 4

April 1988

118 pages

ISSN:0885-6125

Issue’s Table of Contents

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 April 1988

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

548
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 24 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

ten Cate BKoudijs R(2024)Characterising Modal Formulas with ExamplesACM Transactions on Computational Logic10.1145/364946125:2(1-27)Online publication date: 16-Apr-2024
https://dl.acm.org/doi/10.1145/3649461
Tapia-Flores TLópez-Mellado E(2024)Discovering workflow nets of concurrent iterative processesActa Informatica10.1007/s00236-023-00445-561:1(1-21)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1007/s00236-023-00445-5
Attias IHanneke SKrause ABrunskill ECho KEngelhardt BSabato SScarlett J(2023)Adversarially robust PAC learnability of real-valued functionsProceedings of the 40th International Conference on Machine Learning10.5555/3618408.3618457(1172-1199)Online publication date: 23-Jul-2023
https://dl.acm.org/doi/10.5555/3618408.3618457
Bhargava VSaraf SVolkovich ISaha BServedio R(2023)Linear Independence, Alternants, and ApplicationsProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585149(441-454)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585149
Kang XShi XWu YRen F(2023)Active Learning With Complementary Sampling for Instructing Class-Biased Multi-Label Text Emotion ClassificationIEEE Transactions on Affective Computing10.1109/TAFFC.2020.303840114:1(523-536)Online publication date: 1-Jan-2023
https://dl.acm.org/doi/10.1109/TAFFC.2020.3038401
Mantegazza DXhyra AGiusti AGuzzi J(2023)Active Anomaly Detection for Autonomous Robots: A BenchmarkTowards Autonomous Robotic Systems10.1007/978-3-031-43360-3_26(315-327)Online publication date: 13-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-43360-3_26
Bressan MCesa-Bianchi NLattanzi SPaudice AThiessen MKoyejo SMohamed SAgarwal ABelgrave DCho KOh A(2022)Active learning of classifiers with label and seed queriesProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3602511(30911-30922)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.5555/3600270.3602511
Cate BDalmau V(2022)Conjunctive Queries: Unique Characterizations and Exact LearnabilityACM Transactions on Database Systems10.1145/355975647:4(1-41)Online publication date: 6-Nov-2022
https://dl.acm.org/doi/10.1145/3559756
Sharaf ADaume III HNi R(2022)Promoting Fairness in Learned Models by Learning to Active Learn under Parity ConstraintsProceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency10.1145/3531146.3534632(2149-2156)Online publication date: 21-Jun-2022
https://dl.acm.org/doi/10.1145/3531146.3534632
Daskalakis CGolowich NLeonardi SGupta A(2022)Fast rates for nonparametric online learning: from realizability to learning in gamesProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3519950(846-859)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519935.3519950
Show More Cited By

Abstract

Cited By

Recommendations

Malicious Omissions and Errors in Answers to Membership Queries

Filtering unsatisfiable XPath queries

Learning tree languages from positive examples and membership queries

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations