Completing data algorithm based on similarity relation vector
基于相似关系向量的不完备数据补齐算法

This paper studied the problems of filling up incompleted data, and proposed an completing data algorithm based on similarity relation vector according to the decision rule independence principle. It could efficiently solve the potential contradiction between decision rules comparing with the original ROUSTIDA algorithm. A practical case proves the completing accuracy rate is upper than ROUSTIDA algorithm's, and the new algorithm has better practical value.