Attribute reduction of data with error ranges and test costs

DOI10.1016/j.ins.2012.04.031zbMath1250.68227OpenAlexW2097287674MaRDI QIDQ456456

Fan Min, William Zhu

Publication date: 25 October 2012

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2012.04.031

zbMATH Keywords

neighborhoodcovering rough setcost-sensitive learningerror rangetest cost

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (29)

Equivalent characterizations of some graph problems by covering-based rough sets ⋮ Cost-sensitive feature selection of numeric data with measurement errors ⋮ A computational formulation of distribution reducts in probabilistic rough set models ⋮ Connectedness of graphs and its application to connected matroids through covering-based rough sets ⋮ Test-cost-sensitive attribute reduction on heterogeneous data for adaptive neighborhood model ⋮ Attribute reduction for sequential three-way decisions under dynamic granulation ⋮ FRPS: a fuzzy rough prototype selection method ⋮ Multicost Decision-Theoretic Rough Sets Based on Maximal Consistent Blocks ⋮ A three-way decision method with pre-order relations ⋮ A comparison study of similarity measures for covering-based neighborhood classifiers ⋮ Nullity-based matroid of rough sets and its application to attribute reduction ⋮ Characteristic matrix of covering and its application to Boolean matrix decomposition ⋮ Rough set methods in feature selection via submodular function ⋮ Cost-sensitive attribute reduction in decision-theoretic rough set models ⋮ Cost-sensitive approximate attribute reduction with three-way decisions ⋮ Three-way decisions approach to multiple attribute group decision making with linguistic information-based decision-theoretic rough fuzzy set ⋮ The Lower Approximation Number in Covering-Based Rough Set ⋮ Entropy measures and granularity measures for set-valued information systems ⋮ Rough set approach to incomplete numerical data ⋮ Test cost sensitive multigranulation rough set: model and minimal cost selection ⋮ A set-cover-based approach for the test-cost-sensitive attribute reduction problem ⋮ Matrix approach to spanning matroids of rough sets and its application to attribute reduction ⋮ Decision region distribution preservation reduction in decision-theoretic rough set model ⋮ Graph and matrix approaches to rough sets through matroids ⋮ On quick attribute reduction in decision-theoretic rough set models ⋮ Deriving three-way decisions from intuitionistic fuzzy decision-theoretic rough sets ⋮ Attribute reduction based on \(k\)-nearest neighborhood rough sets ⋮ Cost-sensitive rough set approach ⋮ Three-way decision model with two types of classification errors

Cites Work

• An interval set model for learning rules from incomplete information table
• A comparative study of rough sets for hybrid data
• Approximations and uncertainty measures in incomplete information systems
• Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model
• Topological approaches to covering rough sets
• Induction of multiple fuzzy decision trees based on rough set technique
• Attribute reduction in decision-theoretic rough set models
• Neighborhood rough set based heterogeneous feature subset selection
• Positive approximation: an accelerator for attribute reduction in rough set theory
• Variable precision rough set model
• Reduction and axiomization of covering generalized rough sets.
• Relational interpretations of neighborhood operators and rough set approximation operators
• Rough sets and intelligent data analysis
• Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
• On the coverings by tolerance classes
• Textural approach to generalized rough sets based on relations
• A hierarchical model for test-cost-sensitive decision systems
• A fast approach to attribute reduction in incomplete decision systems with tolerance relation-based rough sets
• Generalized rough sets based on relations
• Generalized rough sets over fuzzy lattices
• Rough 3-valued algebras
• Numerical Attribute Reduction Based on Neighborhood Granulation and Rough Approximation
• A Greedy Heuristic for the Set-Covering Problem
• Rough sets
• Transactions on Rough Sets I
• Nearest neighbor pattern classification
• On Reduct Construction Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Attribute reduction of data with error ranges and test costs