@article{01HME5SHXGKT2J0NS4SH3SC4SR,
  abstract     = {{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 Lukasiewicz fuzzy connectives. We also provide graphical illustrations for a better understanding of the introduced concepts.}},
  articleno    = {{108765}},
  author       = {{Palangetić, Marko and Cornelis, Chris and Greco, Salvatore and Słowiński, Roman}},
  issn         = {{0165-0114}},
  journal      = {{FUZZY SETS AND SYSTEMS}},
  keywords     = {{Artificial Intelligence,Logic,Granular computing,Fuzzy sets,Machine learning,SETS}},
  language     = {{eng}},
  pages        = {{16}},
  title        = {{Multi-class granular approximation by means of disjoint and adjacent fuzzy granules}},
  url          = {{http://doi.org/10.1016/j.fss.2023.108765}},
  volume       = {{478}},
  year         = {{2024}},
}

Altmetric

View in Altmetric

Web of Science

Times cited: