Partially-defined equivalence relations: relationship with orthopartitions and connection to rough sets
From MaRDI portal
Publication:6179976
DOI10.1016/j.ins.2023.119941OpenAlexW4389081390MaRDI QIDQ6179976
Andrea Campagner, Davide Ciucci, Stefania Boffa
Publication date: 18 January 2024
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2023.119941
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rough sets: some extensions
- Rough set approach to incomplete information systems
- Sequences of refinements of rough sets: logical and algebraic aspects
- Similarity-based rough sets and its applications in data mining
- Belief functions and rough sets: survey and new insights
- The problem of finding the simplest classifier ensemble is NP-hard -- a rough-set-inspired formulation based on decision bireducts
- Defining rough sets using tolerances compatible with an equivalence
- Rough set-based feature selection for weakly labeled data
- Orthopairs: A Simple and Widely UsedWay to Model Uncertainty
- Rough sets
- Relations binaires, fermetures, correspondances de Galois
- Logical entropy and aggregation of fuzzy orthopartitions
- Orthopartitions in knowledge representation and machine learning
This page was built for publication: Partially-defined equivalence relations: relationship with orthopartitions and connection to rough sets