Discernibility matrix simplification for constructing attribute reducts

DOI10.1016/J.INS.2008.11.020MaRDI QIDQ1007889zbMATH OpenOpenAlexFDO

Authors Yan Zhao, Yiyu Yao

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

zbMATH Keywords

algorithmsrough setsattribute reductiondiscernibility matrixmatrix simplification

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Reduction algorithms based on discernibility matrix: The ordered attributes method
• On Reduct Construction Algorithms
• Efficient algorithm of attribute reduction based on Skowron's discernibility matrix
• scientific article; zbMATH DE number 6612574
• An algorithm for relative reduction based on simplified binary discernibility matrix

Cites work

• scientific article; zbMATH DE number 3980536 (Why is no real title available?)
• scientific article; zbMATH DE number 53312 (Why is no real title available?)
• scientific article; zbMATH DE number 108581 (Why is no real title available?)
• scientific article; zbMATH DE number 3339023 (Why is no real title available?)
• A Model of Machine Learning Based on User Preference of Attributes
• A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
• A reduction algorithm meeting users' requirements.
• Analysis on attribute reduction strategies of rough set
• Approaches to knowledge reduction based on variable precision rough set model.
• Approximate Boolean Reasoning: Foundations and Applications in Data Mining
• Hybrid attribute reduction based on a novel fuzzy-rough model and information granulation
• Knowledge acquisition in incomplete information systems: a rough set approach
• Knowledge reduction in random information systems via Dempster-Shafer theory of evidence
• On the decision table with maximal number of reducts
• Reduction algorithms based on discernibility matrix: The ordered attributes method
• Reduction and axiomization of covering generalized rough sets.
• Rough computational methods for information systems
• Rough set algorithms in classification problem
• Rough sets
• Rough sets and Boolean reasoning
• Rough sets methods in feature reduction and classification
• Rudiments of rough sets
• THE INFORMATION ENTROPY, ROUGH ENTROPY AND KNOWLEDGE GRANULATION IN ROUGH SET THEORY
• \(\alpha\)-RST: A generalization of rough set theory

Cited in

(52)

• Algorithm for computing all the shortest reducts based on a new pruning strategy
• Constructing tests for skill assessment with competence-based test development
• Incremental mechanism of attribute reduction based on discernible relations for dynamically increasing attribute
• Knowledge reduction based on divide and conquer method in rough set theory
• scientific article; zbMATH DE number 6612574 (Why is no real title available?)
• Decision-relative discernibility matrices in the sense of entropies
• Core set analysis in inconsistent decision tables
• The further investigation of covering-based rough sets: uncertainty characterization, similarity measure and generalized models
• New perspectives of granular computing in relation geometry induced by pairings
• Dependency structures for decision tables
• A dominance intuitionistic fuzzy-rough set approach and its applications
• The Attribute Reductions Based on Indiscernibility and Discernibility Relations
• scientific article; zbMATH DE number 6178413 (Why is no real title available?)
• The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory
• Cost-sensitive approximate attribute reduction with three-way decisions
• Analysis of alternative objective functions for attribute reduction in complete decision tables
• A Further Investigation to Relative Reducts of Decision Information Systems
• A rough-set based solution of the total domination problem
• scientific article; zbMATH DE number 6613684 (Why is no real title available?)
• Improved general attribute reduction algorithms
• Evolutionary tolerance-based gene selection in gene expression data
• Knowledge reduction of dynamic covering decision information systems when varying covering cardinalities
• Three-way decision with co-training for partially labeled data
• Geometrical interpretation and applications of membership functions with fuzzy rough sets
• A unified incremental reduction with the variations of the object for decision tables
• A new algorithm for reduct computation based on gap elimination and attribute contribution
• A set-cover-based approach for the test-cost-sensitive attribute reduction problem
• Granular maximum decision entropy-based monotonic uncertainty measure for attribute reduction
• Three-way approximate reduct based on information-theoretic measure
• Efficient attribute reduction from the viewpoint of discernibility
• The relationship between attribute reducts in rough sets and minimal vertex covers of graphs
• Approximate distribution reducts in inconsistent interval-valued ordered decision tables
• Solving the Attribute Reduction Problem with Ant Colony Optimization
• The adjacency matrix of a graph as a data table: a geometric perspective
• Improving Indiscernibility Matrix Based Approach for Attribute Reduction
• Fast attribute reduction via inconsistent equivalence classes for large-scale data
• Dynamic reducts generation using cascading hashes
• Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation
• Attribute reduction and optimal decision rules acquisition for continuous valued information systems
• Bidirectional heuristic attribute reduction based on conflict region
• Finding rough and fuzzy-rough set reducts with SAT
• Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model
• Multi-granularity Attribute Reduction
• Parallel attribute reduction algorithms using MapReduce
• Class-specific information measures and attribute reducts for hierarchy and systematicness
• Dependency and accuracy measures for directed graphs
• Graph and matrix approaches to rough sets through matroids
• Accelerator for supervised neighborhood based attribute reduction
• On Reduct Construction Algorithms
• Notions from rough set theory in a generalized dependency relation context
• Attribute reduction in formal contexts based on a new discernibility matrix
• Constructing, improving, and shortening tests for skill assessment

This page was built for publication: Discernibility matrix simplification for constructing attribute reducts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007889)