Dynamic Updating Rough Approximations in Distributed Information Systems

Yanyong Huang, Tianrui Li, Chuan Luo, S. Horng
{"title":"Dynamic Updating Rough Approximations in Distributed Information Systems","authors":"Yanyong Huang, Tianrui Li, Chuan Luo, S. Horng","doi":"10.1109/ISKE.2015.48","DOIUrl":null,"url":null,"abstract":"Rough set theory is an effective mathematical tool for processing the uncertainty and inexact data. In some real-life applications, data stores in information systems distributively which are called as Distributed Information Systems (DIS). It is hard to centralize the large-scale data in DIS for data mining tasks. Furthermore, knowledge needs updating as the attributes dynamically increase in size in DIS. In this paper, we present an incremental approach for maintaining rough approximations in DIS under attribute generalization. Firstly, a matrix-based approach is presented to compute approximations. Then, an incremental approach for updating rough approximations in DIS is proposed, which does not need to centralize data from different locations and recompute the whole data sets from scratch. Finally, a case study is provided for validating the efficiency and effectiveness of the proposed method.","PeriodicalId":312629,"journal":{"name":"2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISKE.2015.48","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Rough set theory is an effective mathematical tool for processing the uncertainty and inexact data. In some real-life applications, data stores in information systems distributively which are called as Distributed Information Systems (DIS). It is hard to centralize the large-scale data in DIS for data mining tasks. Furthermore, knowledge needs updating as the attributes dynamically increase in size in DIS. In this paper, we present an incremental approach for maintaining rough approximations in DIS under attribute generalization. Firstly, a matrix-based approach is presented to compute approximations. Then, an incremental approach for updating rough approximations in DIS is proposed, which does not need to centralize data from different locations and recompute the whole data sets from scratch. Finally, a case study is provided for validating the efficiency and effectiveness of the proposed method.
分布式信息系统中的动态更新粗略逼近
粗糙集理论是处理不确定性和不精确数据的有效数学工具。在一些实际应用中,数据以分布式方式存储在信息系统中,这些信息系统被称为分布式信息系统(DIS)。在数据挖掘任务中,难以将大规模数据集中到DIS中。本文提出了一种在属性泛化条件下保持DIS中粗糙近似的增量方法。首先,提出了一种基于矩阵的近似计算方法。在此基础上,提出了一种不需要集中不同位置的数据,也不需要从头重新计算整个数据集的增量更新方法。最后,通过实例验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信