I read an article entitled "Permutation Tests for Studying Classifier Performance" which explains how to use "permutation-based p-value" to test the performance of a classifier. I can not understand how to calculate the p-value. The article reports this formula:
p = (|{D′ ∈ D: e(f,D′) ≤ e(f,D)}|+1)/(k+1)
(DEFINITION 1)
Where e(f,D) is some error of the classifier f on the dataset D or D' (D' is the dataset obtained with permutation).
This is the article: http://jmlr.org/papers/volume11/ojala10a/ojala10a.pdf
But I do not understand the formula. Why the error with D' is less than the error with D? and can I calculate the absolute value of an equation with "<=" ? And what is k?
The article says:
The empirical p-value of Definition 1 represents the fraction of randomized samples where the classifier behaved better in the random data than in the original data. Intuitively, it measures how likely the observed accuracy would be obtained by chance, only because the classifier identified in the training phase a pattern that happened to be random. Therefore, if the p-value is small enough usually under a certain threshold, for example, α = 0.05 we can say that the value of the error in the original data is indeed significantly small and in consequence, that the classifier is significant under the given null hypothesis, that is, the null hypothesis is rejected.