摘要
为提高ROUSTIDA算法对离散型不完备数据的填充能力,根据极大相容块中的元素之间具有最高的相似度的性质,提出了一种改进的ROUSTIDA算法,从而使填充缺失数据的能力有了很大提高,同时还具备了初步排除噪声数据的能力。实例分析表明该算法是行之有效的。
In order to improve the ability of packing missing data, a improved ROUSTIDA algorithm based on the property of maximal consistent block in which the elements have the highest similarity was proposed to deal with in- complete information system with discrete value. Then the ability to pack data is greatly improved, meanwhile the method has the good capacity of eliminating the elementary noise. An example show that the presented algorithm is reasonable and efficient.
出处
《桂林电子科技大学学报》
2011年第5期419-421,425,共4页
Journal of Guilin University of Electronic Technology
基金
广西研究生教育创新计划项目(2010105950701M29)