Minimizing the error of linear separators on linearly inseparable data

Discrete Applied Mathematics

Volumn 160, Issue 10-11, 2012, Pages 1441-1452

  Aronov, Boris ^a   Garijo, Delia ^b   Nez Rodrguez, Yurai ^c   Rappaport, David ^d   Seara, Carlos ^e   Urrutia, Jorge ^f  

^a POLYTECHNIC UNIVERSITY   (United States)

^b UNIVERSITY OF SEVILLE   (Spain)

^c Lakes Environmental Software   (Canada)

^d QUEEN S UNIVERSITY   (Canada)

^e UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^f UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

Author keywords

Classifiers; Error minimizers; Linearly inseparable

Indexed keywords

BLUE POINTS; LINEAR CLASSIFIERS; LINEAR SEPARATORS; LINEARLY INSEPARABLE; RED POINTS; SEPARATED SETS;

CLASSIFIERS; COMBINATORIAL MATHEMATICS; MATHEMATICAL TECHNIQUES;

SEPARATION;

EID: 84859902279     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2012.03.009     Document Type: Article

References (44)

1. P.K. Agarwal, B. Aronov, T.M. Chan, and M. Sharir On levels in arrangements of lines, segments, planes, and triangles Discrete Comput. Geom. 19 1998 315 331 (Pubitemid 128353120)
2. P.K. Agarwal, L.J. Guibas, S. Har-Peled, A. Rabinovitch, and M. Sharir Computing the penetration depth of two convex polytopes in 3D Nordic J. Comput. 7 2000 227 240
3. E.M. Arkin, F. Hurtado, J.S.B. Mitchell, C. Seara, and S.S. Skiena Some lower bounds on geometric separability problems Internat. J. Comput. Geom. Appl. 16 2006 1 26 (Pubitemid 43296675)
4. B. Aronov, and S. Har-Peled On approximating the depth and related problems SIAM J. Comput. 38 2008 899 921
5. K.P. Bennett, and O.L. Mangasarian Robust linear programming discrimination of two linearly inseparable sets Optim. Methods Softw. 1 1 1992 23 34 (Pubitemid 23615796)
6. M. Blum, R.W. Floyd, V. Pratt, R. Rivest, and R. Tarjan Time bounds for selection J. Comput. System Sci. 7 1973 448 461
7. J.D. Boissonnat, J. Czyzowicz, O. Devillers, J. Urrutia, and M. Yvinec Computing largest circles separating two sets of segments Internat. J. Comput. Geom. Appl. 10 1 2000 41 53
8. S.A. Cameron, R.K. Culley, Determining the minimum translational distance between two convex polyhedra. In: Proc. Int. Conf. on Robotics and Automation, 1986, pp. 591-596. (Pubitemid 16616205)
9. T.M. Chan, Remarks on the k-level algorithms in the plane, Manuscript, 1999.
10. T.M. Chan Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus Internat. J. Comput. Geom. Appl. 12 2002 67 85
11. T.M. Chan Low-dimensional linear programming with violations SIAM J. Comput. 34 2005 879 893 (Pubitemid 41246998)
12. T.M. Chan A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries J. ACM 57 3 2010 Article 16
13. T.M. Chan Random sampling, halfspace range reporting, and construction of (≤ k)-levels in three dimensions SIAM J. Comput. 30 2000 561 575 (Pubitemid 32469590)
14. B. Chazelle An optimal convex hull algorithm in any fixed dimension Discrete Comput. Geom. 10 1993 377 409
15. K.L. Clarkson New applications of random sampling in computational geometry Discrete Comput. Geom. 2 1987 195 222
16. K.L. Clarkson, and P.W. Shor Applications of random sampling in computational geometry, II Discrete Comput. Geom. 4 1989 387 421
17. R. Cole, M. Sharir, and C.K. Yap On k-hulls and related problems SIAM J. Comput. 16 1987 61 77
18. C. Cortés, J.M. Daz-Bez, P. Pérez-Lantero, C. Seara, J. Urrutia, and I. Ventura Bichromatic separability with two boxes: a general approach Journal of Algorithms, Algorithms in Cognition, Informatics and Logic 64 2-3 2009 79 88
19. N. Cristianini, and J. Shawe-Taylor An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods 2000 Cambridge University Press
20. T.K. Dey Improved bounds on planar k-sets and k-levels Discrete Comput. Geom. 19 1998 373 382
21. D. Dobkin, J. Hershberger, D. Kirkpatrick, and S. Suri Computing the intersection-depth of polyhedra Algorithmica 9 1993 518 533 (Pubitemid 23668713)
22. R. Duda, P. Hart, and D. Stork Pattern Classification 2001 John Wiley and Sons, Inc.
23. H. Edelsbrunner Algorithms in Combinatorial Geometry EATCS Series Monographs in Theoretical Computer Science vol. 10 1987 Springer
24. D. Elizondo, Searching for linearly separable subsets using the class of linear separability method, in: IEEE International Joint Conference on Neural Networks, 2004, pp. 955-960.
25. H. Everett, J.-M. Robert, and M. van Kreveld An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems Internat. J. Comput. Geom. Appl. 6 1996 247 261 (Pubitemid 126504528)
26. n 2) problems in computational geometry Comput. Geom. Theory Appl. 5 1995 165 185
27. S. Har-Peled Taking a walk in a planar arrangement SIAM J. Comput. 30 2000 1341 1367 (Pubitemid 32837897)
28. M.E. Houle Algorithms for weak and wide separation of sets Discrete Appl. Math. 45 1993 139 159
29. M.E. Houle, and G.T. Toussaint Computing the width of a set IEEE Trans. Pattern Anal. Mach. Intell. 10 1988 761 765
30. F. Hurtado, M. Noy, P.A. Ramos, and C. Seara Separating objects in the plane by wedges and strips Discrete Appl. Math. 109 2000 109 138 (Pubitemid 33673492)
31. A. Karam, G. Caporossi, and P. Hansen Arbitrary-norm hyperplane separation by variable neighbourhood search IMA J. Manag. Math 18 2007 173 189 (Pubitemid 46552842)
32. Y.J. Kim, M.C. Lin, and D. Manocha Incremental penetration depth estimation between convex polytopes using dual-space expansion IEEE Trans. Vis. Comput. Graphics 10 2004 152 163
33. Y.J. Kim, M.A. Otaduy, M.C. Lin, D. Manocha, Fast penetration-depth computation for physically-based animation, in: Proc. ACM SIGGRAPH/Eurographics Symposium on Computer Animation, 2002, pp. 23-31.
34. J. Matoušek, M. Sharir, S. Smorodinsky, and U. Wagner k-sets in four dimension Discrete Comput. Geom. 35 2006 177 191
35. N. Megiddo Linear programming in linear time when the dimension is fixed J. ACM 31 1 1984 114 127 (Pubitemid 14507495)
36. J. O'Rourke, S.R. Kosaraju, and N. Megiddo Computing circular separability Discrete Comput. Geom. 1 1 1986 105 113
37. M.H. Overmars, and J. van Leeuwen Maintenance of configurations in the plane J. Comput. System Sci. 23 1981 166 204
38. J. Rico, Dynamic planar convex hull, Ph.D. Dissertation, BRICS, Aarhus, Denmark, 2002.
39. T. Roos, and P. Widmayer k-Violation linear programming Inform. Process. Lett. 52 1994 109 114 (Pubitemid 124013229)
40. B. Schlkopf, and A.J. Smola Learning with Kernels 2002 The MIT Press
41. M. Sharir, S. Smorodinsky, and G. Tardos An improved bound for k-sets in three dimensions Discrete Comput. Geom. 26 2001 195 204
42. H.U. Simon On the complexity of working set selection Theoret. Comput. Sci. 382 3 2007 262 279 (Pubitemid 47248046)
43. G. Tóth Point sets with many k-sets Discrete Comput. Geom. 26 2001 187 194
44. G.T. Toussaint, Solving geometric problems with the rotating calipers, in: Proc. IEEE MELECON'83, Athens, Greece, 1983, A10.02/1-4.