paper-with-me

홈 › Papers

Extension of Rough Set Based on Positive Transitive Relation

2019-06-07 · Min Shu, Wei Zhu

The application of rough set theory in incomplete information systems is a key problem in practice since missing values almost always occur in knowledge acquisition due to the error of data measuring, the limitation of data collection, or the limitation of data comprehension, etc. An incomplete information system is mainly processed by compressing the indiscernibility relation. The existing rough set extension models based on tolerance or symmetric similarity relations typically discard one relation among the reflexive, symmetric and transitive relations, especially the transitive relation. In order to overcome the limitations of the current rough set extension models, we define a new relation called the positive transitive relation and then propose a novel rough set extension model built upon which. The new model holds the merit of the existing rough set extension models while avoids their limitations of discarding transitivity or symmetry. In comparison to the existing extension models, the proposed model has a better performance in processing the incomplete information systems while substantially reducing the computational complexity, taking into account the relation of tolerance and similarity of positive transitivity, and supplementing the related theories in accordance to the intuitive classification of incomplete information. In summary, the positive transitive relation can improve current theoretical analysis of incomplete information systems and the newly proposed extension model is more suitable for processing incomplete information systems and has a broad application prospect.

📄 PDF Abstract BibTeX arXiv:1906.03337

Code (0)

등록된 구현이 없습니다.

Tasks

Missing ValuesRelation

Similar Papers 제목 키워드 기반

Algebraic Semantics of Proto-Transitive Rough Sets

2014-10-02 · A. Mani

Rough sets over generalized transitive relations like proto-transitive ones had been initiated by the present author in the year 2012. Subsequently, approximation of proto-transitive relations by other relations was inve…

On Finite and Unrestricted Query Entailment beyond SQ with Number Restrictions on Transitive Roles

2020-10-22 · Thomas Gogacz, Víctor Gutiérrez-Basulto, Yazmín Ibáñez-García, Jean Christoph Jung 외

We study the description logic SQ with number restrictions applicable to transitive roles, extended with either nominals or inverse roles. We show tight 2EXPTIME upper bounds for unrestricted entailment of regular path q…

On the Limitations of Elo: Real-World Games, are Transitive, not Additive

2022-06-21 · Quentin Bertrand, Wojciech Marian Czarnecki, Gauthier Gidel

Real-world competitive games, such as chess, go, or StarCraft II, rely on Elo models to measure the strength of their players. Since these games are not fully transitive, using Elo implicitly assumes they have a strong t…

StarcraftStarcraft II

TransClean: Finding False Positives in Multi-Source Entity Matching under Real-World Conditions via Transitive Consistency

2025-06-04 · Fernando de Meer Pardo, Branka Hadji Misheva, Martin Braschler, Kurt Stockinger

We present TransClean, a method for detecting false positive predictions of entity matching algorithms under real-world conditions characterized by large-scale, noisy, and unlabeled multi-source datasets that undergo dis…

Closed-set lattice of regular sets based on a serial and transitive relation through matroids

2012-09-25 · Qingyin Li, William Zhu

Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related …

AllRelation