Learning decision trees using the fourier spectrum

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F130073, Issue , 1991, Pages 455-464

  Kushilevitz, Eyal ^a   Mansourt, Yishay ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; FOURIER ANALYSIS; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

ABSOLUTE VALUES; DECISION TREE MODELING; FOURIER COEFFICIENTS; LINEAR OPERATIONS; MEMBERSHIP QUERY; NON-ZERO COEFFICIENTS; TIME POLYNOMIALS; UNIFORM DISTRIBUTION;

BOOLEAN FUNCTIONS;

EID: 85006528164     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/103418.103466     Document Type: Conference Paper

References (14)

1. William Aiello and Milena Mihail. Learning the fourier spectrum of probabilistic lists and trees. In Proceedings SODA 91. ACM, Jan 1991.
2. Dana Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87-106, November 1987.
3. Mihir Bellare. The spectral norm of finite functions. Technical Report TR-465, MIT-LCS, 1991.
4. Y. Brandman, J. Hennessy, and A, Orlitsky. A spectral lower bound technique for the size of decision trees and two level circuits. IEEE Trans. on Computers., 39(2):282-287, 1990.
5. J. Bruck and R. Smolensky. Polynomial threshold functions, ACO functions and spectral norms. Technical Report RJ 7140, IBM Research, 1989.
6. Persi Diaconis. The use of Group representation in probability and statistics. 1983.
7. Andrzej Ehrenfeucht and David Haussler. Learning decision trees from random examples. Information and Computation, 82(3):231-246, September 1989.
8. O. Goldreich and L. Levin. A hardcore predicate for all one-way functions. In Proc. 21 th ACM Symposium on Theory of Computing. ACM, 1989.
9. Thomas Hancock. Identifying pdecision trees with queries. In COLT, pages 23-37, August 1990.
10. Thomas Hancock. Learning 2p DNF and kp decision trees. Unpublished Manuscript, 1991.
11. Torben Hagerup and Christine Rub. A guided tour to chernoff bounds. Info. Proc. Lett., 33:305-308, 1989.
12. N. Linial, Y. Mansour, and N. Nisan. Constant depth circuits, fourier transform and learnability, In 30th Annual Symposium on Foundations of Computer Science, Reseach Triangle Park, NC, pages 574-579, October 1989.
13. M. Ron Roth and Gyora M. Benedek. Interpolation and approximation of light boolean functions. (unpublished manuscript), 1989.
14. Leslie G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, November 1984.