RESULT OPTIMAL TRANSLATION SEQUENCE OF A NEW DEFINITION FORM OF ROUGH COMMUNICATION
In rough communication, because each agent has communication to each other, the concept translated among multi-agents will loss some information, and this results in a less or rougher concept With different translation sequences the amount of the missed knowledge is varied.A new definition form of rough communication is introduced.In order to get the translation sequence, in which the last agent taking part in new-rough communication gets maximum information, simulated annealing algorithm is used.Analysis and simulation of the algorithm demonstrate the effectiveness of the approach.
Rough sets Rough communication New definition form Result optimal Translation sequence Simulated annealing
HONG-KAI WANG YAN-YONG GUAN BING-XUE YAO KAI-QUAN SHI
School of Science, University of Jinan, Jinan 250022,China School of Mathematics Science, Liaocheng University, Liaocheng 252059,China School of Mathematics and System Sciences, Shandong University, Jinan 250100,China
国际会议
2007 International Conference on Machine Learning and Cybernetics(IEEE第六届机器学习与控制论国际会议)
香港
英文
3040-3044
2007-08-19(万方平台首次上网日期,不代表论文的发表时间)