A parallel rough set attribute reduction algorithm based on attribute frequency.

FSKD(2012)

引用 4|浏览32
暂无评分
摘要
Reduction is the core issue of rough set theory. Integrate the parallel idea into the attribute reduction in order to improve the efficiency and construct a parallel rough set attribute reduction algorithm based on attribute frequency. The algorithm divides the original information system into several subsystems according to the proposed division of thought, then uses the properties of frequency as the attribute importance to reduce each subsystem. When encountered with the situation of the same frequency, select the most uniform classification of the property by calculating the information entropy, and finally, obtain the global reduction from partial reduction. The algorithm is applied to corn breeding. Experiments show that the algorithm outperforms the traditional algorithms. © 2012 IEEE.
更多
查看译文
关键词
attribute frequency,attribute reduction,parallel algorithm,rough set,information systems,algorithm design and analysis,frequency shift keying,parallel algorithms,computer science,production,information system,information entropy,rough set theory
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要