.png){kind=icon}
.png){kind=icon}
Return
Constrained shadowed sets and fast optimization algorithm
.png){kind=icon}
OA
AI
DOI：10.1002/int.22170.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Shadowed sets provide a meaningful description of information granules by abstracting the corresponding fuzzy sets into three categories: full acceptance, full rejection, and uncertain (represented by shadows). One of the main motivating points to derive shadowed sets from fuzzy sets is the determination and explanation of the separation thresholds based on a specific optimization mechanism. The available optimization objective functions are mainly discussed on semantic interpretations and their mathematical properties; constructive algorithms for optimal solutions have rarely been reported. In this paper, the continuous and convex properties of Pedrycz's optimization objective function to construct shadowed sets, as well as the existence and uniqueness of solution points, are analyzed in detail. It is demonstrated that different approximation region partitions would be generated even under the same optimization model, which requires further criteria to make the constructed shadowed sets well-defined. To address this limitation, the notions of passive and active constrained shadowed sets are introduced. A fast algorithm to obtain the proposed constrained shadowed sets is also designed based on the analyzed mathematical properties. Its performance is then illustrated by some typical fuzzy sets and some real data from the UCI repository.
Keywords:
fuzzy sets
granular computing
passive and active constraints
shadowed sets
three-way approximations
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.7
Papers:
3.0K
Citations:
8.1K