scispace - formally typeset
Journal ArticleDOI

Data analysis based on discernibility and indiscernibility

Yan Zhao, +2 more
- 15 Nov 2007 - 
- Vol. 177, Iss: 22, pp 4959-4976
TLDR
The consideration of the matrix- counterpart of relations, and the relation-counterpart of matrices, brings more insights into rough set theory.
About
This article is published in Information Sciences.The article was published on 2007-11-15. It has received 128 citations till now.

read more

Citations
More filters
Journal ArticleDOI

The algebraic structures of generalized rough set theory

TL;DR: The structures of the lower and upper approximations based on arbitrary binary relations in the generalized rough sets are presented and an algorithm to compute atoms for these two Boolean algebras is presented.
Journal ArticleDOI

Attribute selection with fuzzy decision reducts

TL;DR: This paper introduces the concept of fuzzy decision reducts, dependent on an increasing attribute subset measure, and presents a generalization of the classical rough set framework for data-based attribute selection and reduction using fuzzy tolerance relations.
Journal ArticleDOI

Theory and applications of granular labelled partitions in multi-scale decision tables

TL;DR: A formal approach to granular computing with multi-scale data measured at different levels of granulations is proposed in this paper and the unravelling of decision rules at different scales in multi- scale decision tables is discussed.
Journal ArticleDOI

Combination of feature selection approaches with SVM in credit scoring

TL;DR: This study suggests that hybrid credit scoring approach is mostly robust and effective in finding optimal subsets and is a promising method to the fields of data mining.
Journal ArticleDOI

Attribute reduction based on evidence theory in incomplete decision systems

TL;DR: This paper deals with attribute reduction in incomplete information systems and incomplete decision systems based on Dempster-Shafer theory of evidence and shows that in an incomplete information system an attribute set is a belief reduct if and only if it is a classical reduct and a plausibility consistent set must be a classical consistent set.
References
More filters
Journal ArticleDOI

A reduction algorithm meeting users' requirements

TL;DR: An approach to dealing with how to find a particular reduct including those attributes anterior in the attribute order is proposed and its completeness for reduct is proved.
Book ChapterDOI

Logical Analysis of Indiscernibility

TL;DR: The role of indiscernibility in the analysis of vagueness of concepts and in concept learning is explained and deduction methods that enable us making inferences from incomplete information in the presence of indiscERNibility are developed.
Proceedings Article

Reducts and Constructs in Attribute Reduction

TL;DR: The topological aspects of such reducts are focused on, identifying some of their limitations and introducing alternative definitions that do not suffer from these limitations.
Book ChapterDOI

Conflicts and negotations

TL;DR: This paper shows how the conflict situation and development can be represented and studied by means of conflict graphs and an illustration of the introduced concepts by the Middle East conflict is presented.
Journal Article

Conflicts and negotations

TL;DR: In this article, the authors show how the conflict situation and development can be represented and studied by means of conflict graphs, and an illustration of the introduced concepts by the Middle East conflict is presented.