New revision algorithms

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3244, Issue , 2004, Pages 395-409

  Goldsmith, Judy ^a   Sloan, Robert H ^b   Szörényi, Balázs ^c   Turán, György ^b,c  

^a UNIVERSITY OF KENTUCKY   (United States)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^c UNIVERSITY OF SZEGED   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; LEARNING SYSTEMS; MATHEMATICAL MODELS; SET THEORY; THEOREM PROVING; ALGORITHMS;

DIRECTED GRAPHS; LEARNING MODELS; REVISION ALGORITHMS; THRESHOLD FUNCTIONS; MEMBERSHIP QUERY; POLYLOGARITHMIC; REVISION OPERATOR; TARGET CONCEPT;

LEARNING ALGORITHMS;

EID: 22944434553     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30215-5_30     Document Type: Conference Paper

References (30)

1. Blum, A., Hellerstein, L., Littlestone, N.: Learning in the presence of finitely or infinitely many irrelevant attributes. J. of Comput. Syst. Sci. 50 (1995) 32-40
2. Earlier version in 4th COLT, 1991.
3. Bshouty, N., Hellerstein, L.: Attribute-efficient learning in query and mistake-bound models. J. of Comput. Syst. Sci. 56 (1998) 310-319
4. Koppel, M., Feldman, R., Segre, A.M.: Bias-driven revision of logical domain theories. Journal of Artificial Intelligence Research 1 (1994) 159-208
5. Ourston, D., Mooney, R.J.: Theory refinement combining analytical and empirical methods. Artificial Intelligence 66 (1994) 273-309
6. Richards, B.L., Mooney, R.J.: Automated refinement of first-order Horn-clause domain theories. Machine Learning 19 (1995) 95-131
7. Towell, G.G., Shavlik, J.W.: Extracting refined rules from knowledge-based neural networks. Machine Learning 13 (1993) 71-101
8. Wrobel, S.: Concept Formation and Knowledge Revision. Kluwer (1994)
9. Wrobel, S.: First order theory refinement. In De Raedt, L., ed.: Advances in ILP. IOS Press, Amsterdam (1995) 14-33
10. Goldsmith, J., Sloan, R.H., Turan, G.: Theory revision with queries: DNF formulas. Machine Learning 47 (2002) 257-295
11. Goldsmith, J., Sloan, R.H., Szörényi, B., Turán, G.: Theory revision with queries: Horn, read-once, and parity formulas. Artificial Intelligence 156 (2004) 139-176
12. Mooney, R.J.: A preliminary PAC analysis of theory revision. In Petsche, T., ed.: Computational Learning Theory and Natural Learning Systems. Volume III: Selecting Good Models. MIT Press (1995) 43-53
13. Sloan, R.H., Szörényi, B., Turán, G.: Projective DNF formulae and their revision. In: Learning Theory and Kernel Machines, 16th Annual Conference on Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003, Washington, DC, USA, August 24-27, 2003, Proceedings. Volume 2777 of Lecture Notes in Artificial Intelligence., Springer (2003) 625-639
14. Doshi, J.U.: Revising Horn formulas. Master's thesis, Dept. of Computer Science, University of Kentucky (2003)
15. Angluin, D., Frazier, M., Pitt, L.: Learning conjunctions of Horn clauses. Machine Learning 9 (1992) 147-164
16. Valiant, L.G.: Projection learning. Machine Learning 37 (1999) 115-130
17. Pinker, S.: The Blank Slate: The Modern Denial of Human Nature. Viking Press (2002)
18. Valiant, L.G.: A neuroidal architecture for cognitive computation. Journal of the ACM 47 (2000) 854-882
19. Valiant, L.G.: Robust logics. Artificial Intelligence 117 (2000) 231-253
20. Littlestone, N.: Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning 2 (1988) 285-318
21. Uehara, R., Tsuchida, K., Wegener, I.: Optimal attribute-efficient learning of disjunction, parity, and threshold functions. In: Computational Learning Theory, Third European Conference, EuroCOLT '97, Jerusalem, Israel, March 1997, Proceedings. Volume 1208 of Lecture Notes in Artificial Intelligence., Springer (1997) 171-184
22. Hegedüs, T., Indyk, P.: On learning disjunctions of zero-one threshold functions with queries. In: Algorithmic Learning Theory, 8th International Workshop, ALT '97, Sendai, Japan, October 1997, Proceedings. Volume 1316 of Lecture Notes in Artificial Intelligence., Springer (1997) 446-460
23. Hegedüs, T.: On training simple neural networks and small-weight neurons. In: Computational Learning Theory: EuroColt '93. Volume New Series Number 53 of The Institute of Mathematics and its Applications Conference Series., Oxford, Oxford University Press (1994) 69-82
24. Pitt, L., Valiant, L.G.: Computational limitations on learning from examples. J. ACM 35 (1988) 965-984
25. Schmitt, M.: On methods to keep learning away from intractability. In: Proc. International Conference on Artifical Neural Networks (ICANN) '95. Volume 1. (1995) 211-216
26. Sloan, R.H., Turán, G.: Learning from incomplete boundary queries using split graphs and hypergraphs. In: Computational Learning Theory, Third European Conference, EuroCOLT '97, Jerusalem, Israel, March 1997, Proceedings. Number 1208 in Lecture Notes in Artificial Intelligence, Springer (1997) 38-50
27. Angluin, D.: Learning prepositional Horn sentences with hints. Technical Report YALEU/DCS/RR-590, Department of Computer Science, Yale University (1987)
28. Hammer, P.L., Kogan, A.: Quasi-acyclic propositional Horn knowledge bases: optimal compression. IEEE Trans. Knowl. Data Eng. 7 (1995) 751-762
29. Arimura, H.: Learning acyclic first-order Horn sentences from entailment. In: Algorithmic Learning Theory, 8th International Workshop, ALT '97, Sendai, Japan, October 1997, Proceedings. Volume 1316 of Lecture Notes in Artificial Intelligence., Springer (1997) 432-445
30. Angluin, D.: Queries and concept learning. Machine Learning 2 (1988) 319-342