paper-with-me

홈 › Papers

Comparison research on binary relations based on transitive degrees and cluster degrees

2022-01-25 · Zhaohao Wang, Huifang Yue

Interval-valued information systems are generalized models of single-valued information systems. By rough set approach, interval-valued information systems have been extensively studied. Authors could establish many binary relations from the same interval-valued information system. In this paper, we do some researches on comparing these binary relations so as to provide numerical scales for choosing suitable relations in dealing with interval-valued information systems. Firstly, based on similarity degrees, we compare the most common three binary relations induced from the same interval-valued information system. Secondly, we propose the concepts of transitive degree and cluster degree, and investigate their properties. Finally, we provide some methods to compare binary relations by means of the transitive degree and the cluster degree. Furthermore, we use these methods to analyze the most common three relations induced from Face Recognition Dataset, and obtain that $RF_{B} ^{\lambda}$ is a good choice when we deal with an interval-valued information system by means of rough set approach.

📄 PDF Abstract BibTeX arXiv:2201.10315

Code (0)

등록된 구현이 없습니다.

Tasks

Face Recognition

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…

Comparing Constraints for Taxonomic Organization

2018-06-01 · NAACL 2018 6 · Anne Cocos, Marianna Apidianaki, Chris Callison-Burch

Building a taxonomy from the ground up involves several sub-tasks: selecting terms to include, predicting semantic relations between terms, and selecting a subset of relational instances to keep, given constraints on the…

Entity Extraction using GAN

Topological Connectedness and Behavioral Assumptions on Preferences: A Two-Way Relationship

2018-10-25

This paper offers a comprehensive treatment of the question as to whether a binary relation can be consistent (transitive) without being decisive (complete), or decisive without being consistent, or simultaneously incons…

RelationVocal Bursts Valence Prediction

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 d…

Missing ValuesRelation

Evaluating Temporal Graphs Built from Texts via Transitive Reduction

2014-01-16 · Xavier Tannier, Philippe Muller

Temporal information has been the focus of recent attention in information extraction, leading to some standardization effort, in particular for the task of relating events in a text. This task raises the problem of comp…