Pages that link to "Item:Q1750334"

The following pages link to The relationship between attribute reducts in rough sets and minimal vertex covers of graphs (Q1750334):

Displaying 8 items.

• The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory (Q779535) (← links)
• Class-specific attribute reducts in rough set theory (Q780940) (← links)
• A set-cover-based approach for the test-cost-sensitive attribute reduction problem (Q1741935) (← links)
• A graph approach for fuzzy-rough feature selection (Q2219196) (← links)
• An efficient local search framework for the minimum weighted vertex cover problem (Q2282264) (← links)
• Four operators of rough sets generalized to matroids and a matroidal method for attribute reduction (Q2333783) (← links)
• Equivalent characterizations of some graph problems by covering-based rough sets (Q2375570) (← links)
• An efficient feature selection algorithm based on the description vector and hypergraph (Q6127130) (← links)