基于模糊关系方程组的Sugeno积分学习能力研究
On learning capacities of Sugeno integrals with systems of fuzzy relational equations
AI总结:
本研究基于模糊关系方程组提出Sugeno积分容度学习方法,构建max-min与min-max方程组求解极值容度,给出q-maxitive/q-minitive容度推导条件,并解决方程组不相容时的近似容度获取问题。
摘要:
本文提出一种基于模糊关系方程组、根据训练数据学习Sugeno积分底层容度的方法。针对训练数据,我们构建两个方程组:max-min系统和min-max系统。利用Sanchez的结果求解这两个相容的方程组,可直接得到表征训练数据的极值容度。将max-min(对应min-max)方程组约简为基数小于等于q(对应大于等于n−q,其中n为准则数量)的准则子集对应的方程组,我们给出了从其潜在最大解(对应潜在最小解)推导出q-maxitive(对应q-minitive)容度的充分条件。最后,若这两个约简后的方程组不相容,我们展示了如何运用处理模糊关系方程组不相容性的最新研究结果,得到最大近似q-maxitive容度和最小近似q-minitive容度。
英文摘要:
In this article, we introduce a method for learning a capacity underlying a Sugeno integral according to training data based on systems of fuzzy relational equations. To the training data, we associate two systems of equations: a $\max-\min$ system and a $\min-\max$ system. By solving these two systems (in the case that they are consistent) using Sanchez's results, we show that we can directly obtain the extremal capacities representing the training data. By reducing the $\max-\min$ (resp. $\min-\max$) system of equations to subsets of criteria of cardinality less than or equal to $q$ (resp. of cardinality greater than or equal to $n-q$), where $n$ is the number of criteria, we give a sufficient condition for deducing, from its potential greatest solution (resp. its potential lowest solution), a $q$-maxitive (resp. $q$-minitive) capacity. Finally, if these two reduced systems of equations are inconsistent, we show how to obtain the greatest approximate $q$-maxitive capacity and the lowest approximate $q$-minitive capacity, using recent results to handle the inconsistency of systems of fuzzy relational equations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。