Optimal attribute-efficient learning of disjunction, parity, and threshold functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1208, Issue , 1997, Pages 171-184

  Uehara, Ryuhei ^a   Tsuchida, Kensei ^b   Wegener, Ingo ^c  

^a TOKYO WOMAN'S CHRISTIAN UNIVERSITY   (Japan)

^b TOYO UNIVERSITY   (Japan)

^c TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES;

COMPUTATION MODEL; EFFICIENT LEARNING; GENERAL CLASS; OPTIMAL RESULTS; THRESHOLD FUNCTIONS;

BOOLEAN FUNCTIONS;

EID: 84949214707     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62685-9_15     Document Type: Conference Paper

References (16)

1. Ahlswede, R. and Wegener, I. (1987). Search Problems. Wiley.
2. Angluin, D. (1988). Queries and concept learning. Machine Learning 2, 319342.
3. Angluin, D., Hellerstein, L., and Karpinski, M. (1993). Learning read-once formulas with queries. Journal of the ACM 40, 185-210.
4. Bshouty, N. H. and Hellerstein, L. (1996). Attribute-efficient learning in query and mistake-bound models. Proc. of the 9th Conf. on Computational Learning Theory COLT '96, 235-243.
5. Friedman, J. (1984). Constructing O(nlogn) size monotone formulae for the k-th elementary symmetric polynomial of n Boolean variables. Proc. 25th Symp. on Foundations of Computer Science, 506-515.
6. Håstad, J., Wegener, I., Wurm, N., and Yi, S. (1994). Optimal depth, very small size circuits for symmetric functions in ACP. Information and Computation 108, 200-211.
7. Heiman, R. and Wigderson, A. (1991). Randomized vs. deterministic decision tree complexity. Computational Complexity 1, 311-329.
8. Hofmeister, T. (1996). Personal communication.
9. Littlestone, N. (1988). Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm. Machine Learning 2, 285-318.
10. Mehlhorn, K. (1982). On the program size of perfect and universal hash functions. Proc. 23rd Symp. on Foundations of Computer Science, 170-175.
11. Motwani, R. and Raghavan, P. (1995). Randomized Algorithms. Cambridge University Press.
12. Naor, M., Schulman, L., and Srinivasan, A. (1995). Splitters and near-optimal decomposition. Proc. 36th Symp. on Foundations of Computer Science, 182191.
13. Picard, C. (1965). Théorie des Questionnaires. Gauthier-Villars, Paris.
14. Ragde, P. and Wldgerson, A. (1991). Lìnear-size constant-depth polylog-threshold circuits. Information Processing Letters 39, 143-146.
15. Saks, M. and Widgerson, A. (1986). Probabilistic Boolean decision trees and the complexity of evaluating game trees. Proc. of 27th Symp. on Foundations of Computer Science, 29-38.
16. Wegener, I. (1987). The Complexity of Boolean Functions. Wiley-Teubner.