Pages that link to "Item:Q1007889"

The following pages link to Discernibility matrix simplification for constructing attribute reducts (Q1007889):

Displaying 44 items.

• Geometrical interpretation and applications of membership functions with fuzzy rough sets (Q419060) (← links)
• Analysis of alternative objective functions for attribute reduction in complete decision tables (Q422488) (← links)
• Core set analysis in inconsistent decision tables (Q497268) (← links)
• Finding rough and fuzzy-rough set reducts with SAT (Q497893) (← links)
• Parallel attribute reduction algorithms using MapReduce (Q506356) (← links)
• Graph and matrix approaches to rough sets through matroids (Q508728) (← links)
• Bidirectional heuristic attribute reduction based on conflict region (Q521640) (← links)
• Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation (Q541820) (← links)
• Approximate distribution reducts in inconsistent interval-valued ordered decision tables (Q726325) (← links)
• Attribute reduction and optimal decision rules acquisition for continuous valued information systems (Q730910) (← links)
• The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory (Q779535) (← links)
• Incremental mechanism of attribute reduction based on discernible relations for dynamically increasing attribute (Q780251) (← links)
• Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model (Q845298) (← links)
• The further investigation of covering-based rough sets: uncertainty characterization, similarity measure and generalized models (Q991904) (← links)
• Notions from rough set theory in a generalized dependency relation context (Q1644893) (← links)
• Granular maximum decision entropy-based monotonic uncertainty measure for attribute reduction (Q1726314) (← links)
• Cost-sensitive approximate attribute reduction with three-way decisions (Q1726326) (← links)
• A set-cover-based approach for the test-cost-sensitive attribute reduction problem (Q1741935) (← links)
• The relationship between attribute reducts in rough sets and minimal vertex covers of graphs (Q1750334) (← links)
• Efficient attribute reduction from the viewpoint of discernibility (Q1750425) (← links)
• A dominance intuitionistic fuzzy-rough set approach and its applications (Q1789009) (← links)
• Knowledge reduction based on divide and conquer method in rough set theory (Q1955292) (← links)
• Knowledge reduction of dynamic covering decision information systems when varying covering cardinalities (Q1991878) (← links)
• New perspectives of granular computing in relation geometry induced by pairings (Q2000596) (← links)
• Three-way decision with co-training for partially labeled data (Q2054101) (← links)
• Three-way approximate reduct based on information-theoretic measure (Q2076993) (← links)
• Constructing, improving, and shortening tests for skill assessment (Q2116018) (← links)
• A new algorithm for reduct computation based on gap elimination and attribute contribution (Q2195414) (← links)
• Accelerator for supervised neighborhood based attribute reduction (Q2300454) (← links)
• A unified incremental reduction with the variations of the object for decision tables (Q2318552) (← links)
• The adjacency matrix of a graph as a data table: a geometric perspective (Q2362877) (← links)
• Dependency structures for decision tables (Q2411274) (← links)
• Dependency and accuracy measures for directed graphs (Q2423026) (← links)
• Improved general attribute reduction algorithms (Q2666800) (← links)
• Evolutionary Tolerance-Based Gene Selection in Gene Expression Data (Q3019856) (← links)
• A Further Investigation to Relative Reducts of Decision Information Systems (Q3300352) (← links)
• A Rough-Set Based Solution of the Total Domination Problem (Q5082211) (← links)
• Decision-relative discernibility matrices in the sense of entropies (Q5409911) (← links)
• DYNAMIC REDUCTS GENERATION USING CASCADING HASHES (Q5495433) (← links)
• Solving the Attribute Reduction Problem with Ant Colony Optimization (Q5900467) (← links)
• Fast attribute reduction via inconsistent equivalence classes for large-scale data (Q6064256) (← links)
• Class-specific information measures and attribute reducts for hierarchy and systematicness (Q6064476) (← links)
• Algorithm for computing all the shortest reducts based on a new pruning strategy (Q6149507) (← links)
• Constructing tests for skill assessment with competence-based test development (Q6668994) (← links)