Abstract: The multi-side covering algorithm is designed guided by the idea of divide-and-conquer to the mass high-dimensional data. According to the sum of the absolute value of the component deviation, subsets of attributes were selected to construct respective covering domains for different parts of training samples, thus reducing the complexity of learning. But the selection of initial attribute set should be acquired by experience or experiments. In order to reduce the subjectivity with the selection of initial attribute set and the complexity with the regulation of attribute set, the relief feature selection approach was used to ensure the optimal feature subset that can be appropriate for different data sets, build a hierarchical overlay network, and experiment on the actual data set. The experimental results show that this algorithm is provided with higher precision and efficiency. Therefore, the algorithm can effectively achieve the classification of the complex issues.

Key words: covering algorithm, feature selection, multi-side increase by degree

摘要： 多侧面覆盖算法对海量高维数据的分类采用分而治之的思想,依据分量差的绝对值和,选取部分属性构建不同样本子集的覆盖,降低了学习的复杂度,但初始属性集的选择依据经验或实验获得。为降低初始属性集选择的主观性和属性集调整的复杂性,利用Relief特征选择方法确定适合不同数据集的最优特征子集,构建了分层递阶的覆盖网络,并对实际数据集进行实验。实验结果表明,该算法具有较高的精度和效率,可以有效地实现复杂问题的分类。

关键词: 覆盖算法, 特征选择, 多侧面递进