arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.07584cs.AIcs.LG
收藏

基于不交和相邻模糊粒的多类粒逼近

Multi-class granular approximation by means of disjoint and adjacent fuzzy granules

Ghent University(根特大学);University of Catania(卡塔尼亚大学);University of Portsmouth(朴茨茅斯大学);Poznań University of Technology(波兹南理工大学);Polish Academy of Sciences(波兰科学院)

Marko Palangetić, Chris Cornelis, Salvatore Greco, Roman Słowiński

摘要:

在粒计算中,模糊集可以由尽可能接近原始模糊集w.r.t.的粒可表示集来近似。一个给定的接近度。这样的集合被称为粒度近似。在这篇文章中,我们介绍了不相交和相邻的颗粒的概念,我们研究了新的定义如何影响颗粒近似。首先,我们表明,新的概念是重要的二进制分类问题,因为它们有助于保持决策区域分离(不相交的颗粒),并在同一时间,以覆盖尽可能多的属性空间(相邻颗粒)。稍后,我们考虑多类分类问题的粒度近似,从而定义了多类粒度近似。最后,我们展示了如何有效地计算多类粒度近似的Eukasiewicz模糊连接。我们还提供了图形插图,以便更好地理解所介绍的概念。

英文摘要:

In granular computing, fuzzy sets can be approximated by granularly representable sets that are as close as possible to the original fuzzy set w.r.t. a given closeness measure. Such sets are called granular approximations. In this article, we introduce the concepts of disjoint and adjacent granules and we examine how the new definitions affect the granular approximations. First, we show that the new concepts are important for binary classification problems since they help to keep decision regions separated (disjoint granules) and at the same time to cover as much as possible of the attribute space (adjacent granules). Later, we consider granular approximations for multi-class classification problems leading to the definition of a multi-class granular approximation. Finally, we show how to efficiently calculate multi-class granular approximations for Łukasiewicz fuzzy connectives. We also provide graphical illustrations for a better understanding of the introduced concepts.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑