多Agent系统中基于Rough集的推理

THE INFERENCE BASED ON ROUGH SETS IN MULTI AGENT SYSTEMS

定义了多 Agent系统中的推理模型 .建立了在该模型下的 Rough集和基于 Rough集方法的 Rough包含计算或称集合连接计算 .在知识发现和数据挖掘中 ,集合之间往往不是给出它们的相等性 ,而是讨论它们之间的Rough包含或连接 .因为在不同的 Agent中集合之间关系的精确和一致解释往往是不容易获得的 .一般说来 ,一条基于决策表上的规则 ,满足前提公式个体的集合包含于满足结论公式个体的集合常常是用一种支持值和信赖系数来说明 Rough包含或连接的程度 .在分布式环境中多 Agent的情况下计算 Rough包含或连接的程度常常要求提供一个多 Agent之间互学习的界面 ,所以定义了一个多 Agent系统下的推理模型或称近似空间 ,它就是被用作互学习和计算的界面 ,因此在界面上定义了一种合成运算和包含程度计算 .从而可以实现在分布式环境下 ,由多 A-gent互相协作完成可定义集合的近似和集合之间的 Rough包含或连接程度的计算 .最后 ,通过实例说明了在分布式环境下 ,多

In this paper, a reasoning model in multi agent systems is defined. The rough sets in the models, and the rough inclusion calculus of sets or set connection computing based on rough set approach are established. The equality between sets can't be given in knowledge discovery and data mining; but only the rough inclusion between them is discussed, because it is often not easy to obtain the exact and consistent interpretation between sets in different agent models. In general, an association rule based on decision table often describes, by the support value and confidence coefficients, the degree by which the set of objects satisfying the formula on the left hand side of the association rule is included in the set of objects satisfying the formula on the right hand side of the association rule. Reasoning in distributed environment often requires that a learning interface between multi agents be offered. The interface is an approximate space AS or inference model IM of multi agent defined in this paper. All operations are performed on data table or decision table. Hence, a composite and included operation is defined on the interface(AS or IM). Thus it is possible to obtain the approximation of definable set performed by cooperation between multi agents and the rough included or connection computing between sets in a distributed environment. It is shown with real examples that it is feasible to achieve some goal by actions of multi agents and cooperation between agents in a distributed environment.