.png){kind=icon}
返回
Compound approximation spaces for relational data
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijar.2016.02.002.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Rough set theory provides a powerful tool for dealing with uncertainty in data. Application of variety of rough set models to mining data stored in a single table has been widely studied. However, analysis of data stored in a relational structure using rough sets is still an extensive research area. This paper proposes compound approximation spaces and their constrained versions that are intended for handling uncertainty in relational data. The proposed spaces are expansions of tolerance approximation ones to a relational case. Compared with compound approximation spaces, the constrained version enables to derive new knowledge from relational data. The proposed approach can improve mining relational data that is uncertain, incomplete, or inconsistent. (C) 2016 Elsevier Inc. All rights reserved.
Keyword:
Rough sets
Granular computing
Data mining
Relational databases
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
3.0K
被引数:
5.1K
机构
引用论文
Incentivizing Hosts via Multilateral Cooperation in User-Provided Networks.png)
Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and ComputingIF0
PREAI
分享收藏分享收藏The “organizing” paradigm in public administration: learning by focusing on customer orientation
PREAI
分享收藏
查看更多内容