SVM and reduction-based two algorithms for examining and eliminating mistakes in inconsistent examples

Currently, misleading findings during data mining are mostly caused by the dirty data including that caused by mistakes of inconsistent examples. A reduction-based algorithm for helping us to check the mistakes hidden in inconsistent examples is presented, i.e., firstly, through reduction to eliminate the attributes which have no relation to the inconsistencies and leave behind the ones which have some relations to the inconsistencies; secondly, to examine whether there are some mistakes of the core attribute values of the inconsistent examples in the reduction; finally, to examine the non-core attribute values of the inconsistent examples. When the amount of the inconsistent examples is large, the algorithm is especially necessary. In addition, a SVM based algorithm is presented for eliminating the inconsistent examples in which there are mistakes. Using SVM, the consistent examples are trained first, the inconsistent examples are tested, the inconsistent examples that fall into the test class are left behind, and the inconsistent examples that do not belong to the test class are eliminated.