Learning the Fourier spectrum of probabilistic lists and trees

Authors:
William Aiello;Milena Mihail
Affiliations:
Bell Communications Research, Morristown, NJ;Bell Communications Research, Morristown, NJ
Venue:
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Year:
1991

A theory of the learnable

Communications of the ACM
Separating the polynomial-time hierarchy by oracles

Proc. 26th annual symposium on Foundations of computer science
Crytographic limitations on learning Boolean formulae and finite automata

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Learnability and the Vapnik-Chervonenkis dimension

Journal of the ACM (JACM)
Learning Decision Lists

Machine Learning

Learning decision trees using the Fourier spectrum

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
An O(nlog log n) learning algorithm for DNF under the uniform distribution

COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Learning k&mgr; decision trees on the uniform distribution

COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Efficient distribution-free learning of probabilistic concepts

Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
On the Fourier spectrum of monotone functions

Journal of the ACM (JACM)
Evolvability via the Fourier transform

Theoretical Computer Science

Hi-index	0.00