Abstract
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several problems that can be formulated as the minimization of a set of inequalities. We propose in this work a new algorithm that is based on finding a unate subset of the input examples, with which then train a perceptron to find an approximation for the largest linearly separable subset. The results from the new algorithm are compared to those obtained by the application of the Pocket learning algorithm directly with the whole set of inputs, and show a clear improvement in the size of the linearly separable subset obtained, using a large set of benchmark functions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Johnson, D.S., Preparata, F.P.: The densest hemisphere problem. Theoretical Computer Science 6, 93–107 (1978)
Greer, R.: Trees and hills: Methodology for maximizing functions of systems of linear relations. Annals Discrete Mathematics 22 (1984)
Amaldi, E., Pfetsch, M.E., Trotter, L.E.: On the maximum feasible subsystem problem, IISs and IIS-hypergraphs. Mathematical Programming 95, 533–554 (2003)
Elizondo, D.: Searching for linearly separable subsets using the class of linear separability method. In: Proceedings of the IEEE International Joint Conference on Neural Networks, pp. 955–960. IEEE Computer Society Press, Los Alamitos (2004)
Rosenblatt, F.: Principles of Neurodynamics. Spartan Books, New York (1962)
Gallant, S.I.: Perceptron-based learning algorithms. IEEE Trans. on Neural Networks 1, 179–192 (1990)
Frean, M.: Thermal perceptron learning rule. Neural Computation 4, 946–957 (1992)
Marchand, M., Golea, M.: An Approximation Algorithm to Find the Largest Linearly Separable Subset of Training Examples. In: Proceedings of the 1993 Annual Meeting of the International Neural Network Society, vol. 3, pp. 556–559. Erlbaum Associates, Hillsdale, NJ (1993)
Jacob, J., Mischenko, A.: Unate Decomposition of Boolean Functions. In: Proceedings of the International Workshop on Logic and Synthesis, California (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Franco, L., Subirats, J.L., Jerez, J.M. (2007). MaxSet: An Algorithm for Finding a Good Approximation for the Largest Linearly Separable Set. In: de Sá, J.M., Alexandre, L.A., Duch, W., Mandic, D. (eds) Artificial Neural Networks – ICANN 2007. ICANN 2007. Lecture Notes in Computer Science, vol 4668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74690-4_66
Download citation
DOI: https://doi.org/10.1007/978-3-540-74690-4_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74689-8
Online ISBN: 978-3-540-74690-4
eBook Packages: Computer ScienceComputer Science (R0)