On the upper bound of the probability of error, based on Chebyshev's inequality, in two-class linear discrimination

By applying the Chebyshev inequality directly to a linear discriminant function, Yau and Lin [1] obtained a distribution-free upper bound to the probability of error by identifying two classes. This letter provides, in a similar way, another upper bound of the same applicability which is sharper when good class separation exists.