Concept learning with geometric hypotheses

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Concept learning with geometric hypotheses

Full text

Pdf (857 KB)

Source

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

Santa Cruz, California, United States

Pages: 329 - 336

Year of Publication: 1995

ISBN:0-89791-723-5

Authors

David P. Dobkin	Department of Computer Science, Princeton University, 35 Olden St., Princeton, NJ
Dimitrios Gunopulos	Department of Computer Science, Princeton University, 35 Olden St., Princeton, NJ

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
University of California : University of California

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 12, Downloads (12 Months): 24, Citation Count: 4

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

	AL	Dana Angluin , Philip Laird, Learning From Noisy Examples, Machine Learning, v.2 n.4, p.343-370, April 1988 [doi>10.1023/A:1022873112823]
	BN	Wray Buntine , Tim Niblett, A Further Comparison of Splitting Rules for Decision-Tree Induction, Machine Learning, v.8 n.1, p.75-85, Jan. 1992 [doi>10.1023/A:1022686419106]
	C	B. Chazelle, Geometric Discrepancy Revisited. 34th IEEE Symp. Foundat. Computer Science (1993).
	dB	M. deBerg, Computing Half-Plane and Strip Discrepancy of Planar Point Sets. Manuscript, (1994).
	DEM	David P. Dobkin , David Eppstein , Don P. Mitchell, Computing the discrepancy with applications to supersampling patterns, ACM Transactions on Graphics (TOG), v.15 n.4, p.354-376, Oct. 1996 [doi>10.1145/234535.234536]
	DGM	David P. Dobkin , Dimitrios Gunopulos , Wolfgang Maass, Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning, Journal of Computer and System Sciences, v.52 n.3, p.453-470, June 1996 [doi>10.1006/jcss.1996.0034]
	EG	Herbert Edelsbrunner , Leonidas Guibas, Topologically sweeping an arrangement, Journal of Computer and System Sciences, v.38 n.1, p.165-194, February 1989 [doi>10.1016/0022-0000(89)90038-X]
	F93	Paul Fischer, Learning unions of convex polygons, Proceedings of the first European conference on Computational learning theory, p.61-67, October 1994, Royal Holloway, Univ. of London, United Kingdom
	F95	Paul Fischer, More or less efficient agnostic learning of convex polygons, Proceedings of the eighth annual conference on Computational learning theory, p.337-344, July 05-08, 1995, Santa Cruz, California, United States [doi>10.1145/225298.225339]
	Ha	David Haussler, Decision theoretic generalizations of the PAC model for neural net and other learning applications, Information and Computation, v.100 n.1, p.78-150, Sept. 1992 [doi>10.1016/0890-5401(92)90010-D]
	Ho	Robert C. Holte, Very Simple Classification Rules Perform Well on Most Commonly Used Datasets, Machine Learning, v.11 n.1, p.63-90, April 1993 [doi>10.1023/A:1022631118932]
	HU	John E. Hopcroft , Jeffrey D. Ullman, Introduction To Automata Theory, Languages, And Computation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	KSS	Michael J. Kearns , Robert E. Schapire , Linda M. Sellie, Toward efficient agnostic learning, Proceedings of the fifth annual workshop on Computational learning theory, p.341-352, July 27-29, 1992, Pittsburgh, Pennsylvania, United States [doi>10.1145/130385.130424]
	Ma	Wolfgang Maass, Efficient agnostic PAC-learning with simple hypothesis, Proceedings of the seventh annual conference on Computational learning theory, p.67-75, July 12-15, 1994, New Brunswick, New Jersey, United States [doi>10.1145/180139.181016]
	Ma2	W. Maass, private communication.
	MWW	Jiří Matoušek , Emo Welzl , Lorenz Wernisch, Discrepancy and &egr; approximations for bounded VC-dimension, Proceedings of the 32nd annual symposium on Foundations of computer science, p.424-430, September 1991, San Juan, Puerto Rico [doi>10.1109/SFCS.1991.185401]
	V	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]
	VC	V.N. Vapnik and A.Ya. Chervonenkis, On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Apphc. 16 (1971), 264-280.
	WGT	S. M. Weiss , R. S. Galen , P. V. Tadepalli, Maximizing the predictive value of production rules, Artificial Intelligence, v.45 n.1-2, p.47-71, Sep. 1990 [doi>10.1016/0004-3702(90)90037-Z]
	WK90	S.M. Weiss and I. Kapouleas, An empirical comparison of pattern recognition, neural nets, and machine learning classification methods. 11th Int. Joint Conf. on Art. Int. (1990), Morgan Kauffmann, 781-787.
	WK91	S.M. Weiss and C.A. Kulikowski, Computer Systems that Learn (1991), Morgan Kauffmann.
	W	E. Welzl, personal communication.

CITED BY 4

	Paul Fischer, More or less efficient agnostic learning of convex polygons, Proceedings of the eighth annual conference on Computational learning theory, p.337-344, July 05-08, 1995, Santa Cruz, California, United States
	Stephen Kwek , Leonard Pitt, PAC learning intersections of halfspaces with membership queries (extended abstract), Proceedings of the ninth annual conference on Computational learning theory, p.244-254, June 28-July 01, 1996, Desenzano del Garda, Italy
	Sanjay Jain , Efim Kinber, Intrinsic complexity of learning geometrical concepts from positive data, Journal of Computer and System Sciences, v.67 n.3, p.546-607, November 2003
	Mark de Berg , Prosenjit Bose , Otfried Cheong , Pat Morin, On simplifying dot maps, Computational Geometry: Theory and Applications, v.27 n.1, p.43-62, January 2004