基于特征变换的Tri-Training算法

Tri-Training Algorithm Based on Feature Transformation

提出一种基于特征变换的Tri Training算法。通过特征变换将已标记实例集映射到新空间,得到有差异的训练集,从而构建准确又存在差异的基分类器,避免自助采样不能充分利用全部已标记实例集的问题。为充分利用数据类分布信息,设计基于Must link和Cannot link约束集合的特征变换方法(TMC),并将其用于基于特征变换的Tri Training算法中。在UCI数据集上的实验结果表明,在不同未标记率下,与经典的Co Training、Tri Trainng算法相比,基于特征变换的Tri Training算法可在多数数据集上得到更高的准确率。此外,与Tri LDA和Tri CP算法相比,基于TMC的Tri Training算法具有更好的泛化性能。

This paper proposes a new Tri-Training algorithm based on feature transformation. It employs feature transformation to transform labeled instances into new space to obtain new training sets, and constructs accurate and diverse classifiers. In this way, it avoids the weakness of bootstrap sampling which only adopts training data samples to train base classifiers. In order to make full use of the data distribution information, this paper introduces a new transformation method called Transformation Based on Must-link Constrains and Cannot-link Constrains（TMC）, and uses it to this new Tri-Training algorithm. Experimental results on UCI data sets show that, in different unlabeled rate, compared with the classic Co-Training and Tri-Training algorithm, the proposed algorithm based on feature transformation gets the highest accuracy in most data sets. In addition, compared with the Tri-LDA and Tri-CP algorithm, the Tri-Training algorithm based on TMC has better generalization ability.