摘要
在度量空间基础上,通过将邻域粒化重新定义了上近似、下近似的概念;根据蚂蚁算法的思想,定义了求解邻域决策表的约简算法(ACSR);根据实验分析,得出了一个求解δ算子的公式。
The concepts of upper approximation and lower approximation have been redefined through toneighborhood graining in metric space. A reduction algorithm （ACSR） is defined, which is based on the ideaof the ant algorithm. In other hand, a solution formula of d operator have been proposed according tothe experimental analysis.
出处
《青岛大学学报（自然科学版）》
CAS
2016年第3期102-106,共5页
Journal of Qingdao University(Natural Science Edition)
关键词
邻域粗糙模型
邻域集
决策依赖度
Δ算子
蚁群算法
次优约简算法
neighborhood rough set model
neighborhood set
decision-making dependency
d operator
antcolony optimization algorithm
sub-optimal reduction algorithm
