Discernibility matrix simplification for constructing attribute reducts
From MaRDI portal
Publication:1007889
DOI10.1016/j.ins.2008.11.020zbMath1162.68704OpenAlexW2075340829MaRDI QIDQ1007889
Publication date: 24 March 2009
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2008.11.020
Related Items
The adjacency matrix of a graph as a data table: a geometric perspective, Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model, Notions from rough set theory in a generalized dependency relation context, A Rough-Set Based Solution of the Total Domination Problem, Improved general attribute reduction algorithms, Dependency structures for decision tables, Fast attribute reduction via inconsistent equivalence classes for large-scale data, Class-specific information measures and attribute reducts for hierarchy and systematicness, Dependency and accuracy measures for directed graphs, Multi-granularity Attribute Reduction, A new algorithm for reduct computation based on gap elimination and attribute contribution, Algorithm for computing all the shortest reducts based on a new pruning strategy, Geometrical interpretation and applications of membership functions with fuzzy rough sets, Analysis of alternative objective functions for attribute reduction in complete decision tables, Knowledge reduction based on divide and conquer method in rough set theory, Granular maximum decision entropy-based monotonic uncertainty measure for attribute reduction, Cost-sensitive approximate attribute reduction with three-way decisions, A Further Investigation to Relative Reducts of Decision Information Systems, Core set analysis in inconsistent decision tables, Finding rough and fuzzy-rough set reducts with SAT, A set-cover-based approach for the test-cost-sensitive attribute reduction problem, Parallel attribute reduction algorithms using MapReduce, Graph and matrix approaches to rough sets through matroids, Knowledge reduction of dynamic covering decision information systems when varying covering cardinalities, The relationship between attribute reducts in rough sets and minimal vertex covers of graphs, Efficient attribute reduction from the viewpoint of discernibility, Decision-relative discernibility matrices in the sense of entropies, Evolutionary Tolerance-Based Gene Selection in Gene Expression Data, Bidirectional heuristic attribute reduction based on conflict region, New perspectives of granular computing in relation geometry induced by pairings, Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation, The further investigation of covering-based rough sets: uncertainty characterization, similarity measure and generalized models, Approximate distribution reducts in inconsistent interval-valued ordered decision tables, A dominance intuitionistic fuzzy-rough set approach and its applications, Attribute reduction and optimal decision rules acquisition for continuous valued information systems, Accelerator for supervised neighborhood based attribute reduction, Three-way decision with co-training for partially labeled data, Solving the Attribute Reduction Problem with Ant Colony Optimization, A unified incremental reduction with the variations of the object for decision tables, Three-way approximate reduct based on information-theoretic measure, DYNAMIC REDUCTS GENERATION USING CASCADING HASHES, The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory, Incremental mechanism of attribute reduction based on discernible relations for dynamically increasing attribute, Constructing, improving, and shortening tests for skill assessment
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rudiments of rough sets
- Rough sets and Boolean reasoning
- Hybrid attribute reduction based on a novel fuzzy-rough model and information granulation
- Analysis on attribute reduction strategies of rough set
- Rough computational methods for information systems
- Reduction and axiomization of covering generalized rough sets.
- Approaches to knowledge reduction based on variable precision rough set model.
- A reduction algorithm meeting users' requirements.
- \(\alpha\)-RST: A generalization of rough set theory
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- Knowledge acquisition in incomplete information systems: a rough set approach
- Knowledge reduction in random information systems via Dempster-Shafer theory of evidence
- A Model of Machine Learning Based on User Preference of Attributes
- Rough sets
- THE INFORMATION ENTROPY, ROUGH ENTROPY AND KNOWLEDGE GRANULATION IN ROUGH SET THEORY
- Approximate Boolean Reasoning: Foundations and Applications in Data Mining
- Reduction algorithms based on discernibility matrix: The ordered attributes method
