Cost-sensitive feature selection of numeric data with measurement errors (Q2375660): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2013/754698 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084162392 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59004281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using rough sets with heuristics for feature selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4208556 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paradoxes of fuzzy logic, revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost-sensitive feature acquisition and classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost-sensitive feature reduction applied to a hybrid genetic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchical model for test-cost-sensitive decision systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3493307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transactions on Rough Sets I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test-cost-sensitive attribute reduction of data with normal distribution measurement errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some types of neighborhood-related covering rough sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized rough sets based on relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction and axiomization of covering generalized rough sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attribute reduction of data with error ranges and test costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4709203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost-sensitive learning and decision making revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rough sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonic variable consistency rough set approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions and intensions in the rough set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable-precision dominance-based rough set approach and attribute reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A granularity-based framework of deduction, induction, and abduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3784806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive and algebraic methods of the theory of rough sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic rough set approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3346320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationship among basic concepts in covering-based rough sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Granular computing applied to ontologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on genetic algorithms for large-scale feature selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5485044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484247 / rank
 
Normal rank

Latest revision as of 13:34, 6 July 2024

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