Double-local rough sets for efficient data mining

DOI10.1016/J.INS.2021.05.007MaRDI QIDQ6092076zbMATH OpenOpenAlexFDO

Authors

Publication date 23 November 2023

Published in Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

attribute reductionconcept approximationlocal rough setsrough set theory

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Local logical disjunction double-quantitative rough sets
• Local rough set: a solution to rough data analysis in big data
• A new knowledge reduction algorithm based on decision power in rough set
• Local rough sets based on tolerance relations
• Quick attribute reduction algorithm for neighborhood multi-granulation rough set based on double granulate criterion

Cites work

• A fast heuristic attribute reduction approach to ordered decision systems
• Consistency-based search in feature selection
• Efficient parallel Boolean matrix based algorithms for computing composite rough set approximations
• Feature selection using neighborhood entropy-based uncertainty measures for gene expression data classification
• Feature selection using rough set-based direct dependency calculation by avoiding the positive region
• Game-theoretic rough sets
• scientific article; zbMATH DE number 53312 (Why is no real title available?)
• scientific article; zbMATH DE number 1931880 (Why is no real title available?)
• scientific article; zbMATH DE number 927110 (Why is no real title available?)
• Incremental three-way neighborhood approach for dynamic incomplete hybrid data
• Knowledge acquisition in incomplete information systems: a rough set approach
• Local logical disjunction double-quantitative rough sets
• Local multigranulation decision-theoretic rough sets
• Local rough set: a solution to rough data analysis in big data
• Maximal consistent block technique for rule acquisition in incomplete information systems.
• Neighborhood rough set based heterogeneous feature subset selection
• Parallel attribute reduction algorithms using MapReduce
• Parallel attribute reduction in dominance-based neighborhood rough set
• Positive approximation: an accelerator for attribute reduction in rough set theory
• Probabilistic rough set approximations
• Rough approximation by dominance relations
• ROUGH FUZZY SETS AND FUZZY ROUGH SETS*
• Rough set approach to incomplete information systems
• Rough set methods in feature selection and recognition
• Rough sets: probabilistic versus deterministic approach
• Single-parameter decision-theoretic rough set
• The investigation of the Bayesian rough set model
• Theory and applications of granular labelled partitions in multi-scale decision tables
• Three-way decisions based on decision-theoretic rough sets with dual hesitant fuzzy information
• Two basic double-quantitative rough set models of precision and grade and their investigation using granular computing
• Variable precision rough set model

Cited in

(4)

• Fast attribute reduction via inconsistent equivalence classes for large-scale data
• Local fuzzy rough attribute reduction for large-scale mixed data with limited missing labels based on local fuzzy self information
• Feature selection based on consistent granulation
• A novel fuzzy-rough attribute reduction approach via local information entropy

This page was built for publication: Double-local rough sets for efficient data mining

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6092076)