Andreas Birkendorf
- 1.Dana Angluin. Queries aud concept learning. Machine Learning, 2(4):319-342, April 1988. Google Scholar
Digital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 5.Nader H. Bshouty. Exact learning boolea~l functions via the monotone theory. Information and Computation, 123:146-153, 1995. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 8.Michael Kearns asld Robert E. Schapire. Efficient distribution-free learning of probabilistic concepts. Journal of Computer and System Sciences, 48:464- 497, 1994. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 11.Wolfgang Maass stud GySrgy 2ktrgm. Lower bound methods eatd separation results for ou-line learning models. Machine Learning, 9:107-145, 1992. Google ScholarDigital Library
- 12.Halls Ulrich Simon aald Norbert Klasner. Tight bounds on the query complexity for exact learning. Unpublished manuscript, ~998.Google Scholar
Index Terms
- Structural results about exact learning with unspecified attribute values
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 IIClustering 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