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

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.

• Type: Conference
• Year: 2007
• Where: ICANN
• Authors: Leonardo Franco, José Luis Subirats, José M. Jerez
• Keywords: ICANN 2007, Learning Algorithm, Linearly Separable Subset, Separable Set