Article

Free access

Structural results about exact learning with unspecified attribute values

Authors:

Andreas Birkendorf,

Norbert Klasner,

Christian Kuhlmann,

Hans U. SimonAuthors Info & Claims

COLT' 98: Proceedings of the eleventh annual conference on Computational learning theory

Pages 144 - 153

https://doi.org/10.1145/279943.279974

Published: 24 July 1998 Publication History

PDF eReader

References

[1]

Dana Angluin. Queries aud concept learning. Machine Learning, 2(4):319-342, April 1988.

Digital Library

Google Scholar

[2]

Dana Angluin, Lisa Hellerstein, and Marek Karpinski. Learning read-once formulas with queries. Journal of the ACM, 40(1):185-210, Ja~mary 1993.

Digital Library

Google Scholar

[3]

Shai Ben-David stud Eli Dichtermml. Learning with restricted focus of attention. In Proceedings of the 6th Annual Conference on Computational Learning Theory, pages 287-296. ACM Press, New York, NY, 1993.

Digital Library

Google Scholar

[4]

Andreas Birkendorf, Eli DichtermaJ1, Jeffrey Jackson, Norbert Klasner, mid Hans Ulrich Simon. On restricted-focus-of-attention learnability of boolean functions. In Proceedings o/ the 9th Annual Conference on Computational Learning Theory, pages 205-216. ACM Press, New York, NY, June 1996. To appear ill Machine Learning.

Digital Library

Google Scholar

[5]

Nader H. Bshouty. Exact learning boolea~l functions via the monotone theory. Information and Computation, 123:146-153, 1995.

Digital Library

Google Scholar

[6]

Michael Frazier, Sally Goldman, N. Mishra, asld Leonard Pitt. Learning from a consistently ignoraslt teacher. Ill Proceedings of the 7th Annual Conference on Computational Learning Theory, pages 328-338. ACM Press, New York, NY, 1994.

Digital Library

Google Scholar

[7]

Sally A. Goldman, Stephen Kwek, and Stephen D. Scott. Learning from exeunples with unspecified attribute values. Ill Proceedings of the lOth Annual Conference on Computational Learning Theory, pages 231-242. ACM Press, New York, NY, 1997.

Digital Library

Google Scholar

[8]

Michael Kearns asld Robert E. Schapire. Efficient distribution-free learning of probabilistic concepts. Journal of Computer and System Sciences, 48:464- 497, 1994.

Digital Library

Google Scholar

[9]

Michael Kearns mid Leslie G. Valiaalt. Cryptographic limitations on learning Boolean formulae aud finite automata. Journal of the ACM, 41(1):67-95, January 1994.

Digital Library

Google Scholar

[10]

Nick Littlestone. From ou-line to batch learning. In Proceedings of the 2nd Annual Workshop on Computational Learning Theory, pages 269-284. Morgau Kaufina~m, San Mateo, CA, 1989.

Digital Library

Google Scholar

[11]

Wolfgang Maass stud GySrgy 2ktrgm. Lower bound methods eatd separation results for ou-line learning models. Machine Learning, 9:107-145, 1992.

Digital Library

Google Scholar

[12]

Halls Ulrich Simon aald Norbert Klasner. Tight bounds on the query complexity for exact learning. Unpublished manuscript, ~998.

Google Scholar

Cited By

View all

Bshouty NWilson DBen-David SLong P(1999)On learning in the presence of unspecified attribute valuesProceedings of the twelfth annual conference on Computational learning theory10.1145/307400.307415(81-87)Online publication date: 6-Jul-1999
https://dl.acm.org/doi/10.1145/307400.307415
Kwek SBen-David SLong P(1999)An apprentice learning model (extended abstract)Proceedings of the twelfth annual conference on Computational learning theory10.1145/307400.307413(63-74)Online publication date: 6-Jul-1999
https://dl.acm.org/doi/10.1145/307400.307413

Index Terms

Structural results about exact learning with unspecified attribute values
1. Computing methodologies
  1. Machine learning
  2. Modeling and simulation
    1. Model development and analysis
      1. Model verification and validation
2. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes
    2. Complexity theory and logic

Recommendations

Learning from examples with unspecified attribute values

A challenging problem within machine learning is how to make good inferences from data sets in which pieces of information are missing. While it is valuable to have algorithms that perform well for specific domains, to gain a fundamental understanding ...
Categorical Data Clustering Using the Combinations of Attribute Values
ICCSA '08: Proceedings of the international conference on Computational Science and Its Applications, Part II

Clustering is an important technique for exploratory data analysis. While most of the earlier clustering algorithms focused on numerical data, real-world problems and data mining applications frequently involve categorical data. Here, we propose a new ...
Selection and optimization of cut-points for numeric attribute values

Data discretization is the process of setting several cut-points which can represent attribute values using different symbols or integer values for continuous numeric attribute values. A hybrid method based on neural network and genetic algorithm is ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

COLT' 98: Proceedings of the eleventh annual conference on Computational learning theory

July 1998

304 pages

ISBN:1581130570

DOI:10.1145/279943

Chairmen:
Peter Bartlett
Australian National Univ., Australia
,
Yishay Mansour
Tel-Aviv Univ., Israel

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 July 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

COLT98

Sponsor:

University of Wisconsin
SIGAI
SIGACT
UC @ Santa Cruz

COLT98: The 11th Annual Conference on Computational Learning Theroy

July 24 - 26, 1998

Wisconsin, Madison, USA

Acceptance Rates

Overall Acceptance Rate 35 of 71 submissions, 49%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
199
Total Downloads

Downloads (Last 12 months)20
Downloads (Last 6 weeks)4

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bshouty NWilson DBen-David SLong P(1999)On learning in the presence of unspecified attribute valuesProceedings of the twelfth annual conference on Computational learning theory10.1145/307400.307415(81-87)Online publication date: 6-Jul-1999
https://dl.acm.org/doi/10.1145/307400.307415
Kwek SBen-David SLong P(1999)An apprentice learning model (extended abstract)Proceedings of the twelfth annual conference on Computational learning theory10.1145/307400.307413(63-74)Online publication date: 6-Jul-1999
https://dl.acm.org/doi/10.1145/307400.307413

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Learning from examples with unspecified attribute values

Categorical Data Clustering Using the Combinations of Attribute Values

Selection and optimization of cut-points for numeric attribute values