Data mining using extensions of the rough set model
Journal of the American Society for Information Science - Special issue: knowledge discovery and data mining
Relational interpretations of neighborhood operators and rough set approximation operators
Information Sciences—Informatics and Computer Science: An International Journal
Rough set approach to incomplete information systems
Information Sciences: an International Journal
Rules in incomplete information systems
Information Sciences: an International Journal
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
A reduction algorithm meeting users' requirements
Journal of Computer Science and Technology
A Generalized Definition of Rough Approximations Based on Similarity
IEEE Transactions on Knowledge and Data Engineering
Rough Approximate Operators: Axiomatic Rough Set Theory
RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
On the Extension of Rough Sets under Incomplete Information
RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing
On the Unknown Attribute Values in Learning from Examples
ISMIS '91 Proceedings of the 6th International Symposium on Methodologies for Intelligent Systems
Maximal consistent block technique for rule acquisition in incomplete information systems
Information Sciences: an International Journal
Mining diagnostic rules from clinical databases using rough sets and medical diagnostic model
Information Sciences: an International Journal - Special issue: Medical expert systems
Nearest Neighbors by Neighborhood Counting
IEEE Transactions on Pattern Analysis and Machine Intelligence
Information Sciences: an International Journal
Attribute reduction based on evidence theory in incomplete decision systems
Information Sciences: an International Journal
A Comparison of Three Approximation Strategies for Incomplete Data Sets
GRC '07 Proceedings of the 2007 IEEE International Conference on Granular Computing
Mixed feature selection based on granulation and approximation
Knowledge-Based Systems
Neighborhood rough set based heterogeneous feature subset selection
Information Sciences: an International Journal
A rough set approach to the discovery of classification rules in spatial data
International Journal of Geographical Information Science
Review: Dimensionality reduction based on rough set theory: A review
Applied Soft Computing
Exploring the boundary region of tolerance rough sets for feature selection
Pattern Recognition
Rough fuzzy set-based image compression
Fuzzy Sets and Systems
A confirmation technique for predictive maintenance using the Rough Set Theory
Computers and Industrial Engineering
Information Sciences: an International Journal
Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model
Information Sciences: an International Journal
Topological solution of missing attribute values problem in incomplete information tables
Information Sciences: an International Journal
A valued tolerance approach to missing attribute values in data mining
HSI'09 Proceedings of the 2nd conference on Human System Interactions
Knowledge reduction in random information systems via Dempster-Shafer theory of evidence
Information Sciences: an International Journal
Approximation reduction in inconsistent incomplete decision tables
Knowledge-Based Systems
Sequential covering rule induction algorithm for variable consistency rough set approaches
Information Sciences: an International Journal
Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation
International Journal of Approximate Reasoning
Neighborhood systems-based rough sets in incomplete information system
Knowledge-Based Systems
Topological properties of generalized approximation spaces
Information Sciences: an International Journal
Rule learning for classification based on neighborhood covering reduction
Information Sciences: an International Journal
Ranking outliers using symmetric neighborhood relationship
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
A rough set approach to data with missing attribute values
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Incomplete Multigranulation Rough Set
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Using one axiom to characterize rough set and fuzzy rough set approximations
Information Sciences: an International Journal
Information Sciences: an International Journal
FRPS: A Fuzzy Rough Prototype Selection method
Pattern Recognition
Quick attribute reduction in inconsistent decision tables
Information Sciences: an International Journal
A novel method for attribute reduction of covering decision systems
Information Sciences: an International Journal
Hi-index | 0.07 |
A systematic study of attribute reduction in inconsistent incomplete decision systems (IIDSs) has not yet been performed, and no complete methodology of attribute reduction has been developed for IIDSs to date. In an IIDS, there are various ways to handle missing values. In this paper, a missing attribute value may be replaced with any known value of a corresponding attribute (such a missing attribute value is called a ''do not care'' condition). In this way, this paper establishes reduction concepts specifically for IIDSs, mainly by extending related reduction concepts from other types of decision systems into IIDSs, and then derives their relationships and properties. With these derived properties, the extended reducts are divided into two distinct types: heritable reducts and nonheritable reducts, and algorithms for computing them are presented. Using the relationships derived here, the eight types of extended reducts established for IIDSs can be converted to five equivalent types. Then five discernibility function-based approaches are proposed, each for a particular kind of reduct. Each approach can find all reducts of its associated type. The theoretical analysis of the proposed approaches is described in detail. Finally, numerical experiments have shown that the proposed approaches are effective and suitable for handling both numerical and categorical attributes, but that they have different application conditions. The proposed approaches can provide a solution to the reduction problem for IIDSs.