Cost-sensitive feature selection of numeric data with measurement errors (Q2375660)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Cost-sensitive feature selection of numeric data with measurement errors
scientific article

    Statements

    Cost-sensitive feature selection of numeric data with measurement errors (English)
    0 references
    0 references
    0 references
    0 references
    14 June 2013
    0 references
    Summary: Feature selection is an essential process in data mining applications since it reduces a model's complexity. However, feature selection with various types of costs is still a new research topic. In this paper, we study the cost-sensitive feature selection problem of numeric data with measurement errors. The major contributions of this paper are fourfold. First, a new data model is built to address test costs and misclassification costs as well as error boundaries. It is distinguished from the existing models mainly on the error boundaries. Second, a covering-based rough set model with normal distribution measurement errors is constructed. With this model, coverings are constructed from data rather than assigned by users. Third, a new cost-sensitive feature selection problem is defined on this model. It is more realistic than the existing feature selection problems. Fourth, both backtracking and heuristic algorithms are proposed to deal with the new problem. Experimental results show the efficiency of the pruning techniques for the backtracking algorithm and the effectiveness of the heuristic algorithm. This study is a step toward realistic applications of the cost-sensitive learning.
    0 references
    feature selection
    0 references
    data mining
    0 references
    numeric data with measurement errors
    0 references
    misclassification
    0 references
    error boundary
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers