{"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.