PAC meditation on boolean formulas

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

Volumn 2371, Issue , 2002, Pages 274-281

  Apolloni, Bruno ^a   Baraghini, Fabio ^a   Palmas, Giorgio ^b  

^a UNIVERSITY OF MILAN   (Italy)

^b ST Microelectronics srl Agrate Brianza (Mi)   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; POLYNOMIAL APPROXIMATION;

BOOLEAN FORMULAE; DESCRIPTION COMPLEXITY; LEARNING PARADIGMS; POLYNOMIAL HIERARCHIES; POLYNOMIAL-TIME; SAMPLE COMPLEXITY; SAMPLE INFORMATION; SECOND LEVEL;

BOOLEAN ALGEBRA;

EID: 84956853437     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45622-8_20     Document Type: Conference Paper

References (11)

1. [1] Valiant, L.G.: A theory of the learnable. Comm. of the ACM 11 (1984) 1134–1142
2. [2] Blum, A.: Learning boolean functions in an infinite attribute space. Machine Learning 9 (1992) 373–386
3. [3] Schapire, R.E.: The strength of weak learnability. Machine Learning 2 (1990) 197–227
4. [4] Linial, N., Mansour, Y., Rivest, R.L.: Results on learnability and the vapnik-chervonenkis dimension. Information and Computation 90 (1991) 33–49
5. [5] Qunilan, J.R.: C4.5: programs for machine learning. Morgan Kaufmann Publishers, San Mateo, California (1993)
6. Andrews, R., Geva, S.: Inserting and extracting knowledge from constrained backpropagation network. In: Proc. 6th Australian Conference on Neural Networks, Sidney (1995) 29–32
7. [7] Vapnik, V.: The Nature of Statistical Learning Theory. Springer, NewYork (1995)
8. [8] Apolloni, B., Malchiodi, D., Orovas, C., Palmas, G.: From synapses to rules. Cognitive Systems Research (2002) in press.
9. [9] Apolloni, B., Chiaravalli, S.: Pac learning of concept classes through the boundaries of their items. Theoretical Computer Science 172 (1997) 91–120
10. [10] Apolloni, B., Baraghini, F., Palmas, G.: PAC meditation on boolean formulas. Technical report, Università degli Studi di Milano (2001)
11. [11] Pitt, L., Valiant, L.: Computational limitations on learning from examples. J. ACM 35 (1988) 965–984