Learning from examples with unspecified attribute values (extended abstract)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Learning from examples with unspecified attribute values (extended abstract)

Full text

Pdf (2.45 MB)

Source

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

Nashville, Tennessee, United States

Pages: 231 - 242

Year of Publication: 1997

ISBN:0-89791-891-6

Authors

Sally A. Goldman	Dept. of Computer Science, Washington University, St. Louis, MO
Stephen S. Kwek	Dept. of Computer Science, Washington University, St. Louis, MO
Stephen D. Scott	Dept. of Computer Science, Washington University, St. Louis, MO

Sponsors

AT&T Labs :
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
Vanderbilt University : Vanderbilt University

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 16, Citation Count: 8

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/267460.267504 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.

	1	Howard Aizenstein , Leonard Pitt, Exact learning of read-twice DNF formulas (extended abstract), Proceedings of the 32nd annual symposium on Foundations of computer science, p.170-179, September 1991, San Juan, Puerto Rico [doi>10.1109/SFCS.1991.185366]
	2	Dana Angluin, Learning regular sets from queries and counterexamples, Information and Computation, v.75 n.2, p.87-106, November 1, 1987 [doi>10.1016/0890-5401(87)90052-6]
	3	Dana Angluin, Queries and Concept Learning, Machine Learning, v.2 n.4, p.319-342, April 1988 [doi>10.1023/A:1022821128753]
	4	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]
	5	Dana Angluin , Lisa Hellerstein , Marek Karpinski, Learning read-once formulas with queries, Journal of the ACM (JACM), v.40 n.1, p.185-210, Jan. 1993 [doi>10.1145/138027.138061]
	6	Dana Angluin , Mārtiņš Kriķis, Learning with malicious membership queries and exceptions (extended abstract), Proceedings of the seventh annual conference on Computational learning theory, p.57-66, July 12-15, 1994, New Brunswick, New Jersey, United States [doi>10.1145/180139.181015]
	7	Dana Angluin , Donna K. Slonim, Randomly Fallible Teachers: Learning Monotone DNF with an Incomplete Membership Oracle, Machine Learning, v.14 n.1, p.7-26, Jan. 1994 [doi>10.1023/A:1022642604085]
	8	B. W. Porter , R. Bareiss , R. C. Holte, Concept learning and heuristic classification in weak-theory domains, Artificial Intelligence, v.45 n.1-2, p.229-263, Sep. 1990 [doi>10.1016/0004-3702(90)90041-W]
	9	Shai Ben-David , Eli Dichterman, Learning with restricted focus of attention, Proceedings of the sixth annual conference on Computational learning theory, p.287-296, July 26-28, 1993, Santa Cruz, California, United States [doi>10.1145/168304.168353]
	10	Andreas Birkendorf , Eli Dichterman , Jeffrey Jackson , Norbert Klasner , Hans Ulrich Simon, On restricted-focus-of-attention learnability of Boolean functions, Proceedings of the ninth annual conference on Computational learning theory, p.205-216, June 28-July 01, 1996, Desenzano del Garda, Italy [doi>10.1145/238061.238098]
	11	Avrim Blum , Steven Rudich, Fast learning of k-term DNF formulas with queries, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.382-389, May 04-06, 1992, Victoria, British Columbia, Canada [doi>10.1145/129712.129748]
	12	Avrim Blum , Prasad Chalasani , Sally A. Goldman , Donna K. Slonim, Learning with unreliable boundary queries, Proceedings of the eighth annual conference on Computational learning theory, p.98-107, July 05-08, 1995, Santa Cruz, California, United States [doi>10.1145/225298.225310]
	13	L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone, Classification and Regression Trees. Wadsworth International Group, 1984.
	14	Nader H. Bshouty , Thomas R. Hancock , Lisa Hellerstein , Marek Karpinski, An algorithm to learn read-once threshold formulas, and transformations between learning models, Computational Complexity, v.4 n.1, p.37-61, Jan. 1994 [doi>10.1007/BF01205054]
	15	Nader H. Bshouty , Richard Cleve , Sampath Kannan , Christino Tamon, Oracles and queries that are sufficient for exact learning (extended abstract), Proceedings of the seventh annual conference on Computational learning theory, p.130-139, July 12-15, 1994, New Brunswick, New Jersey, United States [doi>10.1145/180139.181067]
	16	Nader H. Bshouty , Thomas R. Hancock , Lisa Hellerstein, Learning arithmetic read-once formulas, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.370-381, May 04-06, 1992, Victoria, British Columbia, Canada [doi>10.1145/129712.129747]
	17	N. H. Bshouty. Exact learning via the monotone theory. In Proceedings of the 34rd Annual Symposium on Foundations of Computer Science, pages 302-311. IEEE Computer Society Press, Los Alamitos, CA, 1993.
	18	Nader H. Bshouty, Simple learning algorithms using divide and conquer, Proceedings of the eighth annual conference on Computational learning theory, p.447-453, July 05-08, 1995, Santa Cruz, California, United States [doi>10.1145/225298.225352]
	19	Michael Frazier , Sally Goldman , Nina Mishra , Leonard Pitt, Learning from a consistently ignorant teacher, Proceedings of the seventh annual conference on Computational learning theory, p.328-339, July 12-15, 1994, New Brunswick, New Jersey, United States [doi>10.1145/180139.181170]
	20	R. Greiner, A. Grove, and D. Roth. Learning active classifiers. In Proc. 13th Int. Conf. on Machine Learning, pages 207-215. Morgan Kaufmann, 1996.
	21	S. A. Goldman and R. H. Sloan. Can PAC learning algorithms tolerate random attribute noise? Algorithmica, 14:70-84, 1995.
	22	T. Hancock. Identifying p-decision trees and p-formulas with constrained instance queries. Manuscript, Harvard University, 1989.
	23	L. Hellerstein , Marek Karpinski, Learning read-once formulas using membership queries, Proceedings of the second annual workshop on Computational learning theory, p.146-161, December 1989, Santa Cruz, California, United States
	24	Michael Kearns , Ming Li, Learning in the presence of malicious errors, SIAM Journal on Computing, v.22 n.4, p.807-837, Aug. 1993 [doi>10.1137/0222052]
	25	M. J. Kearns and R. E. Schapire. Efficient distribution-free learning of probabilistic concepts. In Proc. of the 31st Symposium on the Foundations of Comp. Sei., pages 382-391. IEEE Computer Society Press, Los Alamitos, CA, 1990.
	26	Philip D. Laird, Learning from good and bad data, Kluwer Academic Publishers, Norwell, MA, 1988
	27	Nicholas Littlestone, Redundant noisy attributes, attribute errors, and linear-threshold learning using winnow, Proceedings of the fourth annual workshop on Computational learning theory, p.147-156, August 05-07, 1991, Santa Cruz, California, United States
	28	J. R. Quinlan, Unknown attribute values in induction, Proceedings of the sixth international workshop on Machine learning, p.164-168, December 1989, Ithaca, New York, United States
	29	Yasubumi Sakakibara, On learning from queries and counterexamples in the presence of noise, Information Processing Letters, v.37 n.5, p.279-284, March 14, 1991 [doi>10.1016/0020-0190(91)90220-C]
	30	D. Schuurmans and R. Greiner. Learning default concepts. In Proceedings of the Tenth Canadian Conference on Artificial Intelligence, pages 519- 523, 1994.
	31	D. Schuurmans and R. Greiner. Learning to Classify Incomplete Examples, chapter 6. MIT Press, 1997.
	32	George Shackelford , Dennis Volper, Learning k-DNF with noise in the attributes, Proceedings of the first annual workshop on Computational learning theory, p.97-103, August 03-05, 1988, MIT, Cambridge, Massachusetts, United States
	33	Robert Sloan, Types of noise in data for concept learning, Proceedings of the first annual workshop on Computational learning theory, p.91-96, August 03-05, 1988, MIT, Cambridge, Massachusetts, United States
	34	Robert H. Sloan , György Turán, Learning with queries but incomplete information (extended abstract), Proceedings of the seventh annual conference on Computational learning theory, p.237-245, July 12-15, 1994, New Brunswick, New Jersey, United States [doi>10.1145/180139.181128]
	35	L. G. Valiant, A theory of the learnable, Communications of the ACM, v.27 n.11, p.1134-1142, Nov. 1984 [doi>10.1145/1968.1972]

CITED BY 8

	Paul W. Goldberg, Learning fixed-dimension linear thresholds from fragmented data, Proceedings of the twelfth annual conference on Computational learning theory, p.88-99, July 07-09, 1999, Santa Cruz, California, United States
	Nader H. Bshouty , David K. Wilson, On learning in the presence of unspecified attribute values, Proceedings of the twelfth annual conference on Computational learning theory, p.81-87, July 07-09, 1999, Santa Cruz, California, United States
	Paul W. Goldberg, Learning fixed-dimension linear thresholds from fragmented data, Information and Computation, v.171 n.1, p.98-122, November 25, 2001
	Sally A. Goldman , Stephen S. Kwek , Stephen D. Scott, Learning from examples with unspecified attribute values, Information and Computation, v.180 n.2, p.82-100, 29 January 2003
	Andreas Birkendorf , Norbert Klasner , Christian Kuhlmann , Hans U. Simon, Structural results about exact learning with unspecified attribute values, Proceedings of the eleventh annual conference on Computational learning theory, p.144-153, July 24-26, 1998, Madison, Wisconsin, United States
	Stephen S. Kwek, An apprentice learning model (extended abstract), Proceedings of the twelfth annual conference on Computational learning theory, p.63-74, July 07-09, 1999, Santa Cruz, California, United States
	Russell Greiner , Adam J. Grove , Dan Roth, Learning cost-sensitive active classifiers, Artificial Intelligence, v.139 n.2, p.137-174, August 2002
	Loizos Michael, Learning from partial observations, Proceedings of the 20th international joint conference on Artifical intelligence, p.968-974, January 06-12, 2007, Hyderabad, India