Granular reduction in formal fuzzy contexts: graph representation, graph approach and its algorithm

Attribute reduction is one of the significant research issues in the formal fuzzy context (FFC). However, the extant method of computing the minimal granular reducts by Boolean reasoning is an NP problem. To this end, a graph-theoretic-based heuristic algorithm is proposed to compute the granular re...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Artificial intelligence review Jg. 56; H. 12; S. 15101 - 15127
Hauptverfasser: Gong, Zengtai, Zhang, Jing
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Dordrecht Springer Netherlands 01.12.2023
Springer
Springer Nature B.V
Schlagworte:
Algorithms
Analysis
Artificial Intelligence
Attributes
Computer Science
Experiments
Graph representations
Graph theory
Graphical representations
Heuristic
Heuristic methods
Reduction
Run time (computers)
Transformation
Formal fuzzy decision contexts
Vertex covers
Formal fuzzy contexts
Granular reduction
ISSN:0269-2821, 1573-7462
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Attribute reduction is one of the significant research issues in the formal fuzzy context (FFC). However, the extant method of computing the minimal granular reducts by Boolean reasoning is an NP problem. To this end, a graph-theoretic-based heuristic algorithm is proposed to compute the granular reducts in an FFC. We introduce the induced graph of the granular discernibility matrix and show that the minimal vertex cover of this induced graph is equivalent to the reduction of the FFC, thus transforming the problem of reduction the FFC into the problem of finding the minimal vertex cover of the graph. The manuscript also sets forth algorithms for finding minimal granular reducts based on graph theory. Further, data experiments are designed, and we formulate a transformation model from an information system with multi-valued attributes to an FFC, considering the characteristics of the continuous type of numerical attributes used in the experiments. Experimental results show that our proposed method performs well in terms of time complexity and running time.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0269-2821
1573-7462
DOI:10.1007/s10462-023-10523-2