Our investigation aims at detecting network intrusions using decision tree algorithms. Large differences in prior class probabilities of intrusion data have been reported to hinder the performance of decision trees. We propose to replace the Shannon entropy used in tree induction algorithms with a Kolmogorov Smirnov splitting criterion which locates a Bayes optimal cutpoint of attributes. The K...

Let ~o denote an arbitrary non-parametric unbiased test for a Gaussian shift given by an infinite dimensional parameter space. Then it is shown that the curvature of its power function has a principal component decomposition based on a Hilbert Schmidt operator. Thus every test has reasonable curvature only for a finite number of orthogonal directions of alternatives. As application the two-side...