Compound approximation spaces for relational data

DOI10.1016/j.ijar.2016.02.002zbMath1352.68244OpenAlexW2253741475MaRDI QIDQ256488

Piotr Hońko

Publication date: 9 March 2016

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2016.02.002

zbMATH Keywords

rough setsdata mininggranular computingrelational databases

Mathematics Subject Classification ID

Database theory (68P15) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (2)

Granular computing on information tables: families of subsets and operators ⋮ Granular computing on basic digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nearness approximation space based on axiomatic fuzzy sets
• Some twin approximation operators on covering approximation spaces
• Composite rough sets for dynamic data mining
• Rough-granular computing in knowledge discovery and data mining
• Variable precision rough set model
• Extensions and intensions in the rough set theory
• Reduction and axiomization of covering generalized rough sets.
• MGRS: a multi-granulation rough set
• Matrix-based set approximations and reductions in covering decision information systems
• Association discovery from relational data via granular computing
• Information granules: Towards foundations of granular computing
• Description Languages for Relational Information Granules
• Rough-Granular Computing Based Relational Data Mining
• Rough Approximation Based on Weak q-RIFs
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• Rough Sets and Current Trends in Computing
• Rough Sets and Current Trends in Computing
• Rough sets theory for multicriteria decision analysis

This page was built for publication: Compound approximation spaces for relational data