[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/307400.307483acmconferencesArticle/Chapter ViewAbstractPublication PagescoltConference Proceedingsconference-collections
Article
Free access

Learning threshold functions with small weights using membership queries

Published: 06 July 1999 Publication History
First page of PDF

References

[1]
D. Angluin. Queries and Concept Learning. Machine Learning, pp 319-342, 2, 4, 1988.
[2]
D. Angluin. Learning Regular Sets from Queries and Counterexamples. In Information and Computation, 75:87-106, 1987.
[3]
N. Littlestone, "Learning when Irrelevant Attributes Abound: A New Linear-Threshold Algorithm" Machine Learning, Vol. 2, pp. 285-318, 1988.
[4]
W. Maass and G. Turan. "On the Complexity of Learning from Counterexamples", Proc. of 3Oth Annu. Symp. on Foundations of Computer Science, pages 262-273, 1989.
[5]
W. Narkiewicz. Number Theory, Word Science, 1977.

Cited By

View all
  • (2014)Learning Boolean Halfspaces with Small Weights from Membership QueriesAlgorithmic Learning Theory10.1007/978-3-319-11662-4_8(96-110)Online publication date: 2014
  • (2013)Exact Learning from Membership Queries: Some Techniques, Results and New DirectionsAlgorithmic Learning Theory10.1007/978-3-642-40935-6_4(33-52)Online publication date: 2013

Index Terms

  1. Learning threshold functions with small weights using membership queries

      Recommendations

      Comments

      Please enable JavaScript to view thecomments powered by Disqus.

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      COLT '99: Proceedings of the twelfth annual conference on Computational learning theory
      July 1999
      333 pages
      ISBN:1581131674
      DOI:10.1145/307400
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 06 July 1999

      Permissions

      Request permissions for this article.

      Check for updates

      Qualifiers

      • Article

      Conference

      COLT99
      Sponsor:

      Acceptance Rates

      COLT '99 Paper Acceptance Rate 35 of 71 submissions, 49%;
      Overall Acceptance Rate 35 of 71 submissions, 49%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)34
      • Downloads (Last 6 weeks)3
      Reflects downloads up to 25 Dec 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2014)Learning Boolean Halfspaces with Small Weights from Membership QueriesAlgorithmic Learning Theory10.1007/978-3-319-11662-4_8(96-110)Online publication date: 2014
      • (2013)Exact Learning from Membership Queries: Some Techniques, Results and New DirectionsAlgorithmic Learning Theory10.1007/978-3-642-40935-6_4(33-52)Online publication date: 2013

      View Options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Login options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media