CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 1985 vol.7 Issue No.03 - March
Issue No.03 - March (1985 vol.7)
Alfred M. Bruckstein , Department of Electrical Engineering, Stanford University, Stanford, CA 94305.
Thomas M. Cover , Department of Electrical Engineering and Statistics, Stanford University, Stanford, CA 94305.
A set of n pattern vectors are given in d-space and classified arbitrarily into two sets. The sets of patterns are said to be linearly separable if there exists a hyperplane that separates them. We ask whether translation of one of these sets in an arbitrary direction helps separability. Sometimes yes and sometimes no, but yes on the average. The average is taken over all classifications of the patterns into two sets. In fact, we prove that the probability of separability increases as the translation increases. Thus, we conclude that if points are drawn equiprobably from densities fo(x) and f1(x) = fo(x + tw) then the probability of linear separability is minimum at t = 0 and increases with t for t > 0.
Alfred M. Bruckstein, Thomas M. Cover, "Monotonicity of Linear Separability Under Translation", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.7, no. 3, pp. 355-358, March 1985, doi:10.1109/TPAMI.1985.4767666