Exact learning of tree patterns from queries and counterexamples

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Exact learning of tree patterns from queries and counterexamples

Full text

Pdf (1.56 MB)

Source

Annual Workshop on Computational Learning Theory archive
Proceedings of the eleventh annual conference on Computational learning theory table of contents

Madison, Wisconsin, United States

Pages: 175 - 186

Year of Publication: 1998

ISBN:1-58113-057-0

Authors

Thomas R. Amoth	Department of Computer Science, Oregon State University, Corvallis, OR
Paul Cull	Department of Computer Science, Oregon State University, Corvallis, OR
Prasad Tadepalli	Department of Computer Science, Oregon State University, Corvallis, OR

Sponsors

University of Wisconsin : University of Wisconsin
UC @ Santa Cruz : UC @ Santa Cruz
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 10, Citation Count: 6

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/279943.279980 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	Angluin & Kharitnov, 1995	Dana Angluin , Michael Kharitonov, When won't membership queries help?, Journal of Computer and System Sciences, v.50 n.2, p.336-355, April 1995
	Angluin, Frazier, & Pitt, 1992	Dana Angluin , Michael Frazier , Leonard Pitt, Learning Conjunctions of Horn Clauses, Machine Learning, v.9 n.2-3, p.147-164, July 1992 [doi>10.1007/BF00992675]
	Angluin, 1980	Angluin, D. 1980. Finding patterns common to a set of strings. J. of Comp. and Syst. Sciences 21:46-62.
	Angluin, 1988	Dana Angluin, Queries and Concept Learning, Machine Learning, v.2 n.4, p.319-342, April 1988 [doi>10.1023/A:1022821128753]
	Angluin, 1990	Dana Angluin, Negative Results for Equivalence Queries, Machine Learning, v.5 n.2, p.121-150, Jun. 1990 [doi>10.1023/A:1022692615781]
	Arimura, Ishizaka, & Shinohara, 1995	Hiroki Arimura , Hiroki Ishizaka , Takeshi Shinohara, Learning Unions of Tree Patterns Using Queries, Proceedings of the 6th International Conference on Algorithmic Learning Theory, p.66-79, October 18-20, 1995
	Cardie, 1997	Cardie, C. 1997. Empirical methods in information extraction. AI Magazine 18:65-80.
	Lange & Wiehagen, 1991	Steffen Lange , Rolf Wiehagen, Polynomial-time inference of arbitrary pattern languages, New Generation Computing, v.8 n.4, p.361-370, 1991 [doi>10.1007/BF03037093]
	Mitchell, Utgoff, & Banerji, 1983	Mitchell, T.; Utgoff, P.; and Banerji, R. 1983. Learning by experimentation: Acquiring and refining problem solving heuristics. In Michalski, R.; Carbonell, J.; and Mitchell, T., eds., Machine Learning. Palo Alto, CA: Tioga. 163-190.
	Natarajan, 1987	B. K. Natarajan, On learning Boolean functions, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.296-304, January 1987, New York, New York, United States [doi>10.1145/28395.28427]
	Pitt & Warmuth, 1990	Leonard Pitt , Manfred K. Warmuth, Prediction-preserving reducibility, Journal of Computer and System Sciences, v.41 n.3, p.430-467, Dec. 1990 [doi>10.1016/0022-0000(90)90028-J]
	Reddy & Tadepalli, 1998a	Chandra Reddy , Prasad Tadepalli, Learning First-Order Acyclic Horn Programs from Entailment, Proceedings of the Fifteenth International Conference on Machine Learning, p.472-480, July 24-27, 1998
	Reddy & Tadepalli, 1998b	Chandra Reddy , Prasad Tadepalli, Learning horn definitions: theory and an application to planning, New Generation Computing, v.17 n.1, p.77-98, Jan. 1999 [doi>10.1007/BF03037583]
	Schapire, 1990	Robert E. Schapire, Pattern languages are not learnable, Proceedings of the third annual workshop on Computational learning theory, p.122-129, August 06-08, 1990, Rochester, New York, United States

CITED BY 6

	Sally A. Goldman , Stephen S. Kwek, On learning unions of pattern languages and tree patterns in the mistake bound model, Theoretical Computer Science, v.288 n.2, p.237-254, 16 October 2002
	Thomas R. Amoth , Paul Cull , Prasad Tadepalli, Exact learning of unordered tree patterns from queries, Proceedings of the twelfth annual conference on Computational learning theory, p.323-332, July 07-09, 1999, Santa Cruz, California, United States
	Yusuke Suzuki , Takayoshi Shoudai , Tomoyuki Uchida , Tetsuhiro Miyahara, Ordered term tree languages which are polynomial time inductively inferable from positive data, Theoretical Computer Science, v.350 n.1, p.63-90, 18 January 2006
	Thomas R. Amoth , Paul Cull , Prasad Tadepalli, On Exact Learning of Unordered Tree Patterns, Machine Learning, v.44 n.3, p.211-243, September 2001
	Satoshi Matsumoto , Takayoshi Shoudai , Tomoyuki Uchida , Tetsuhiro Miyahara , Yusuke Suzuki, Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries, IEICE - Transactions on Information and Systems, v.E91-D n.2, p.222-230, February 2008
	Ion Muslea , Steven Minton , Craig A. Knoblock, Active learning with multiple views, Journal of Artificial Intelligence Research, v.27 n.1, p.203-233, September 2006