Journal ArticleDOI
Data analysis based on discernibility and indiscernibility
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
Guilong Liu,William Zhu +1 more
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
Wei-Zhi Wu,Yee Leung +1 more
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
F. L. Chen,Feng-Chia Li +1 more
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
Reduction and axiomization of covering generalized rough sets
William Zhu,Fei-Yue Wang +1 more
TL;DR: It has been proved that the reduct of a covering is the minimal covering that generates theSame covering lower approximation or the same covering upper approximation, so this concept is also a technique to get rid of redundancy in data mining.
Book ChapterDOI
LERS-A System for Learning from Examples Based on Rough Sets
TL;DR: The paper presents the system LERS for rule induction, which handles inconsistencies in the input data due to its usage of rough set theory principle and induces all rules, each in the minimal form, that can be induced from the inputData.
Journal ArticleDOI
Generalization of Rough Sets using Modal Logics
Yiyu Yao,Tsau Young Lin +1 more
TL;DR: A number of extended rough set models are proposed and examined based on the properties satisfied by a binary relation, such as serial, reflexive, symmetric, transitive, and Euclidean, which correspond to different modal logic systems.
Book ChapterDOI
Rough set algorithms in classification problem
Jan G. Bazan,Hung Son Nguyen,Hung Son Nguyen,Sinh Hoa Nguyen,Sinh Hoa Nguyen,Piotr Synak,Jakub Wróblewski,Jakub Wróblewski +7 more
TL;DR: Some algorithms, based on rough set theory, that can be used for the problem of new cases classification, and several methods for computation of decision rules based on reducts for real value attribute discretization are presented.
Journal ArticleDOI
Approaches to knowledge reduction based on variable precision rough set model
TL;DR: It is proved that for some special thresholds, β lower distribution reduct is equivalent to the maximum distribution reduction reduct, whereas β upper distribution reduCT is equivalents to the possible reduct.