2008Unpublished venueOpen access

A Threshold-based Similarity Relation Under Incomplete Information

Xuri Yin

Open full text 0 citations

Abstract

The conventional rough set theory based on complete information systems stems from the observation that objects with the same characteristics are indiscernible according to available information. Although rough sets theory has been applied in many fields, the use of the indiscernibility relation may be too rigid in some real situations. Therefore, several generalizations of the rough set theory have been proposed some of which extend the indiscernibility relation using more general similarity or tolerance relations. In this paper, after discussing several extension models based on rough sets for incomplete information, a novel relation based on thresholds is introduced as a new extension of the rough set theory, the upper-approximation and the lower approximation defined on this relation are proposed as well. Furthermore, we present the properties of this extended relation. The experiments show that this relation works effectively in incomplete information and generates rational object classification.

Open-access reader

About this research paper

What this paper is about

The conventional rough set theory based on complete information systems stems from the observation that objects with the same characteristics are indiscernible according to available information. Although rough sets theory has been applied in many fields, the use of the indiscernibility relation may be too rigid in some real situations. Therefore, several generalizations of the rough set theory have been proposed some of which extend the indiscernibility relation using more general similarity or tolerance relations. In this paper, after discussing several extension models based on rough sets for incomplete information, a novel relation based on thresholds is introduced as a new extension of the rough set theory, the upper-approximation and the lower approximation defined on this relation are proposed as well. Furthermore, we present the properties of this extended relation. The experiments show that this relation works effectively in incomplete information and generates rational object classification.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The conventional rough set theory based on complete information systems stems from the observation that objects with the same characteristics are indiscernible according to available information. Although rough sets theory has been applied in many fields, the use of the indiscernibility relation may be too rigid in some real situations. Therefore, several generalizations of the rough set theory have been proposed some of which extend the indiscernibility relation using more general similarity or tolerance relations. In this paper, after discussing several extension models based on rough sets for incomplete information, a novel relation based on thresholds is introduced as a new extension of the rough set theory, the upper-approximation and the lower approximation defined on this relation are proposed as well. Furthermore, we present the properties of this extended relation. The experiments show that this relation works effectively in incomplete information and generates rational object classification.

Key concepts: Rough set, Relation (database), Extension (predicate logic), Similarity (geometry), Mathematics, Dominance-based rough set approach, Object (grammar), Set (abstract data type)

Related papers

Back to paper searchBrowse research topicsOriginal source
A Threshold-based Similarity Relation Under Incomplete Information — Research Paper | ScholarLens