摘要: 通过对数据集的不同划分,得到了基于数据集的粒化树。结合关联元素的信息,建立了基于不同数据集粒化树之间的关联关系,确定了两种粒化树中的两条关联链,促成了它们经关联元素的相互联系。由于每一关联链中的粒从粗到细逐步变化,使得关联元素与粒度的逐步细化密切相关,这是粒计算数据处理模式的体现。相关的结论为人才供求问题的算法描述提供了数学模型,并通过实例予以展示。
[1] Lin Tong-yan.Granular computing on binary relations II:rough set representations and belief functions[C]∥Rough Sets and Knowledge Discovery.1998:122-140 [2] Lin Tong-yan.Granular computing II:infrastructures for AI-En-gineering[C]∥Proceedings of 2006IEEE International Confe-rence on Granular Computing.Atlanta,USA,2006:2-7 [3] Yao Yi-yu.A partition model of granular computing[J].LNCS Transactions on Rough Sets,2004(1):232-253 [4] 苗夺谦,李道国.粗糙集理论、算法与应用[M].北京:清华大学出版社,2008 [5] Zadeh L A.Fuzzy sets and information granulation[M]∥Ad-vances in Fuzzy Set Theory and Applications.Amsterdam:North-Holland Publishing,1979 [6] Zhang Ling,Zhang Bo.Theory of fuzzy quotient space(methods of fuzzy granular computing)[J].Journal of Software,2003,14(4):770-776 [7] Qiu Guo-fang,Chen Jin.Concept knowledge system and concept information granular lattice[J].Chinese Journal of Engineering Mathematics,2005,22(6):963-969 [8] Lin Tong-yan.Neighborhood systems and relational database[C]∥Proceedings of CSC,88.New-York,1988 [9] 胡清华,于达仁,谢宗霞.基于邻域粒化和粗糙逼近的数值属性约简[J].软件学报,2008,19(3):640-649 [10] 张燕平,张铃,夏莹.商空间理论与粗糙集的比较[J].微机发展,2004,14(10):21-24 [11] 闫林.数理逻辑基础与粒计算[M].北京:科学出版社,2007:155-160 |
No related articles found! |
|