MaxSet: An Algorithm for Finding a Good Approximation for the Largest Linearly Separable Set

Leonardo Franco, José Luis Subirats, José M. Jerez. MaxSet: An Algorithm for Finding a Good Approximation for the Largest Linearly Separable Set. In Joaquim Marques de Sá, Luís A. Alexandre, Wlodzislaw Duch, Danilo P. Mandic, editors, Artificial Neural Networks - ICANN 2007, 17th International Conference, Porto, Portugal, September 9-13, 2007, Proceedings, Part I. Volume 4668 of Lecture Notes in Computer Science, pages 648-656, Springer, 2007. [doi]

@inproceedings{FrancoSJ07,
  title = {MaxSet: An Algorithm for Finding a Good Approximation for the Largest Linearly Separable Set},
  author = {Leonardo Franco and José Luis Subirats and José M. Jerez},
  year = {2007},
  doi = {10.1007/978-3-540-74690-4_66},
  url = {http://dx.doi.org/10.1007/978-3-540-74690-4_66},
  researchr = {https://researchr.org/publication/FrancoSJ07},
  cites = {0},
  citedby = {0},
  pages = {648-656},
  booktitle = {Artificial Neural Networks - ICANN 2007, 17th International Conference, Porto, Portugal, September 9-13, 2007, Proceedings, Part I},
  editor = {Joaquim Marques de Sá and Luís A. Alexandre and Wlodzislaw Duch and Danilo P. Mandic},
  volume = {4668},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-74689-8},
}