Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning

Journal of Computer and System Sciences

Volumn 52, Issue 3, 1996, Pages 453-470

  Dobkin, David P ^a   Gunopulos, Dimitrios ^a   Maass, Wolfgang ^b  

^a Princeton University   (United States)

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CALCULATIONS; COMPUTATIONAL GEOMETRY; COMPUTER GRAPHICS; HEURISTIC METHODS; LEARNING ALGORITHMS; LEARNING SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING;

COMPUTATIONAL LEARNING THEORY; MAXIMUM BICHROMATIC DISCREPANCY; MAXIMUM NUMERICAL DISCREPANCY;

COMPUTATION THEORY;

EID: 0030169930     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0034     Document Type: Article

References (49)

1. D. Angluin and P. Laird, Learning from noisy examples, Machine Learning 2 (1988), 343-370.
2. P. Auer, R. Holte, and W. Maass, Theory and applications of agnostic PAC-learning with small decision trees, in "Proc. 12th International Machine Learning Conference, 1995," pp. 21-29.
3. J. Beck and W. W. L. Chen, "Irregularities of Distribution," Cambridge Univ. Press, Cambridge 1987.
4. H. Bronnimann, B. Chazelle, and J. Matousek, Product range spaces, sensitive sampling, and derandomization, in "Proc. 34th Ann. IEEE Symposium on Foundations of Computer Science, 1993," pp. 143-155.
5. W. Buntine and T. Niblett, A further comparison of splitting rules for decision-tree induction, Machine Learning 8 (1992), 75-82.
6. B. Chazelle, Geometric discrepancy revisited, in "34th Symposium on Foundations of Computer Science, 1993."
7. M. deBerg, "Computing Half-Plane and Strip Discrepancy of Planar Point Sets," Manuscript, 1993.
8. D. Dobkin and D. Eppstein, Computing the discrepancy, in "Proceedings of the Ninth Annual Symposium on Computational Geometry, 1993," pp. 47-52.
9. D. Dobkin and D. Gunopulos, Concept learning with geometric hypotheses, in "8th ACM Conference on Learning Theory, 1995."
10. D. Dobkin and D. Gunopulos, Computing the rectangle discrepancy, in "3rd Annual Video Review of Computational Geometry, 1994," pp. 385-386.
11. D. Dobkin, and D. Mitchell, Random-edge discrepancy of supersampling patterns, in "Graphics Interface '93," 1993.
12. D. Dobkin and A. Tal, GASP - A system to facilitate animating geometric algorithms, in "Third Annual Video Review of Computational Geometry, 1994," pp. 388-389.
13. K. Y. Goldberg, Orienting polygonal parts without sensors, Algorithmica 10 (1993), 201-226.
14. D. Gunopulos, "Computing the Discrepancy," Ph.D. thesis, Princeton University Department of Computer Science, 1995.
15. J. H. Halton, A retrospective and prospective survey of the Monte Carlo method, SIAM Rev. 12 (1970), 1.
16. D. Haussler, Decision theoretic generations of the PAC-model for neural nets and other applications, Inform. and Comput. 100 (1992), 78-150.
17. D. Haussler and E. Welts, ε-nets and simplex range queries, Discuss. Comput. Geom. 2 (1987), 127-151.
18. K. U. Hoeffgen, H. U. Simon, and K. S. Van Horn, Robust Trainability of single neurons, preprint, 1993.
19. R. C. Holte, Very simple classification rules perform well on most commonly used datasets, Machine Learning 11 (1993), 63-91.
20. J. E. Hopcroft and J. D. Ullman, "Introduction to Automata Theory, Languages and Computation," Addison-Wesley, Reading, MA, 1979.
21. J. T. Kajiya, The rendering equation, Comput. Graphics 20 (1986), 143-150.
22. M. Kearns, Efficient noise-tolerant learning from statistical queries, in "Proc. of the 25th ACM Symposium on the Theory of Computing, 1993," pp. 392-401.
23. M. Kearns and M. Li, Learning in the presence of malicious errors, SIAM J. Comput. 22 (1993), 807-1837.
24. M. Kearns and R. E. Schapire, Efficient distribution-free learning of probabilistic concepts, in "Proc. of the 31st Annual IEEE Symp. on Foundations of Computer Science, 1990," pp. 382-391.
25. M. Kearns, R. E. Schapire, and L. M. Sellie, Toward efficient agnostic learning, in "Proc. of the 5th ACM Workshop on Computational Learning Theory, 1992," pp. 341-352.
26. J. F. Koksma, Een algemeene stelling uit de theorie der gelijkmatige verdeeling modulo 1, Mathematica B (Zutphen) 11 (1942/1943), pp. 7-11.
27. D. Lubinsky, "Bivariate Splits and Consistent Split Criteria in Dichotomous Classification trees," Ph.D. thesis, Rutgers Univ., 1994.
28. W. Maass, Efficient agnostic PAC-learning with simple hypotheses, in "Proc. of the 7th Annual ACM Conference on Computational Learning Theory, 1994," pp. 71-75.
29. J. Matousek, E. Welzl, and L. Wernish, Discrepancy and ε-approximations for bounded VC-dimension, in "Proc. of the 25th ACM Symposium on the Theory of Computing, 1993," pp. 424-430.
30. K. Mehlhorn, "Multi-dimensional Searching and Computational Geometry," Springer-Verlag, New York/Berlin, 1984.
31. D. Mitchell, Ph.D. thesis, Princeton University Department of Computer Science, to appear.
32. J. Mingers, An empirical comparison of pruning methods for decision tree induction, Machine Learning 4 (1989), 227-243.
33. H. Niederreiter, Quasi-Monte Carlo methods and pseudo-random numbers, Bull. Amer. Math. Soc. 84, No. 6 (1978), 957-1041.
34. H. Niederreiter, Quasirandom sampling computer graphics, in "Proc. 3rd Internal Seminar on Digital Image Processing in Medicine, Riga, Latvia, 1992," pp. 29-33.
35. M. Overmars and J. van Leeuwen, Maintenance of configurations in the plane, J. Comput. System Sci. 23 (1981), 166-204.
36. S. Paskov, "Computing High Dimensional Integrals With Applications to Finance," Tech. Rep. CUCS-023-94, Columbia University.
37. F. Preparata, An optimal real time algorithm for planar convex hulls, Comm. ACM 22 (1919).
38. F. Preparata and M. I. Shamos, "Computational Geometry," Springer-Verlag, New York/Berlin, 1985.
39. P. Shirley, Discrepancy as a quality measure for sample distributions, in "Proceedings of Eurographics '91," pp. 183-193.
40. M. Talagrand, Sharper bounds for empirical processes, Ann. of Probab. Appl., to appear.
41. J. F. Traub and H. Wozniakowski, Recent progress in information-based complexity, Bull. EATCS 51 (1993).
42. L. G. Valiant, A theory of the learnable, Comm. ACM 27 (1984), 1134-1142.
43. L. G. Valiant, Learning disjunctions of conjunctions, in "Proc. of the 9th International Joint Conference on Artificial Intelligence, 1985," pp. 560-566.
44. V. N. Vapnik and A. Ya. Chervonenkis, On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl. 16 (1971), 264-280.
45. S. M. Weiss, R. Galen and P. V. Tadepalli, Maximizing the predictive value of production rules, Artif. Intell. 45 (1900), 47-71.
46. S. M. Weiss and I. Kapouleas, An empirical comparison of pattern recognition, neural nets, and machine learning classification methods, in "Proc. of the 11th International Joint Conference on Artificial Intelligence, 1990," pp. 781-787, Morgan Kauffmann.
47. S. M. Weiss and C. A. Kulikowski, "Computer Systems that Learn," Morgan Kauffmann, San Mateo, CA, 1991.
48. G. Wasilkowski and H. Wózniakowski, Explicit cost bounds of algorithms for multivariate tensor product problems, J. Complexity 11 (1995), 1-56.
49. H. Wozniakowski, Average case complexity of multivariate integration, Bull. Amer. Math. Soc. 24 (1991).