Local and Global Approximations for Incomplete Data

DOI10.1007/978-3-540-85064-9_2zbMath1162.68689OpenAlexW2750921783MaRDI QIDQ5901391

Jerzy W. Grzymala-Busse, Wojciech Rzasa

Publication date: 10 February 2009

Published in: Transactions on Rough Sets VIII (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.468.1052

Mathematics Subject Classification ID

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

Related Items (11)

Mining incomplete data using global and saturated probabilistic approximations based on characteristic sets and maximal consistent blocks ⋮ Characteristic sets and generalized maximal consistent blocks in mining incomplete data ⋮ On lower and upper intension order relations by different cover concepts ⋮ A Rough Set Approach to Incomplete Data ⋮ Mining incomplete data with singleton, subset and concept probabilistic approximations ⋮ Consistency of incomplete data ⋮ Generalized approximations defined by non-equivalence relations ⋮ The further investigation of covering-based rough sets: uncertainty characterization, similarity measure and generalized models ⋮ Lattices with Interior and Closure Operators and Abstract Approximation Spaces ⋮ A logic for multiple-source approximation systems with distributed knowledge base ⋮ An update logic for information systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two views of the theory of rough sets in finite universes
• Relational interpretations of neighborhood operators and rough set approximation operators
• Rules in incomplete information systems
• Rough sets
• Transactions on Rough Sets I
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• Rough Sets and Current Trends in Computing
• Local and Global Approximations for Incomplete Data

This page was built for publication: Local and Global Approximations for Incomplete Data