Cost-sensitive attribute reduction in decision-theoretic rough set models (Q1719302): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 06:40, 1 February 2024

scientific article
Language Label Description Also known as
English
Cost-sensitive attribute reduction in decision-theoretic rough set models
scientific article

    Statements

    Cost-sensitive attribute reduction in decision-theoretic rough set models (English)
    0 references
    0 references
    0 references
    0 references
    8 February 2019
    0 references
    Summary: In recent years, the theory of decision-theoretic rough set and its applications have been studied, including the attribute reduction problem. However, most researchers only focus on decision cost instead of test cost. In this paper, we study the attribute reduction problem with both types of costs in decision-theoretic rough set models. A new definition of attribute reduct is given, and the attribute reduction is formulated as an optimization problem, which aims to minimize the total cost of classification. Then both backtracking and heuristic algorithms to the new problem are proposed. The algorithms are tested on four UCI (University of California, Irvine) datasets. Experimental results manifest the efficiency and the effectiveness of both algorithms. This study provides a new insight into the attribute reduction problem in decision-theoretic rough set models.
    0 references

    Identifiers