Test-cost-sensitive attribute reduction of data with normal distribution measurement errors (Q474299): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Importer (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1210.0091 / rank
 
Normal rank

Latest revision as of 14:11, 18 April 2024

scientific article
Language Label Description Also known as
English
Test-cost-sensitive attribute reduction of data with normal distribution measurement errors
scientific article

    Statements

    Test-cost-sensitive attribute reduction of data with normal distribution measurement errors (English)
    0 references
    0 references
    0 references
    0 references
    24 November 2014
    0 references
    Summary: The measurement error with normal distribution is universal in applications. Generally, smaller measurement error requires better instrument and higher test cost. In decision making, we will select an attribute subset with appropriate measurement error to minimize the total test cost. Recently, error-range-based covering rough set with uniform distribution error was proposed to investigate this issue. However, the measurement errors satisfy normal distribution instead of uniform distribution which is rather simple for most applications. In this paper, we introduce normal distribution measurement errors to covering-based rough set model and deal with test-cost-sensitive attribute reduction problem in this new model. The major contributions of this paper are fourfold. First, we build a new data model based on normal distribution measurement errors. Second, the covering-based rough set model with measurement errors is constructed through the ``3-sigma'' rule of normal distribution. With this model, coverings are constructed from data rather than assigned by users. Third, the test-cost-sensitive attribute reduction problem is redefined on this covering-based rough set. Fourth, a heuristic algorithm is proposed to deal with this problem. The experimental results show that the algorithm is more effective and efficient than the existing one. This study suggests new research trends concerning cost-sensitive learning.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references