Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/14779
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChen, Hongmei-
dc.contributor.authorLi, Tianrui-
dc.contributor.authorRUAN, Da-
dc.contributor.authorLin, Jianhui-
dc.contributor.authorHu, Chengxiang-
dc.date.accessioned2013-03-22T10:06:58Z-
dc.date.available2013-03-22T10:06:58Z-
dc.date.issued2013-
dc.identifier.citationIEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 25 (2), p. 274-284-
dc.identifier.issn1041-4347-
dc.identifier.urihttp://hdl.handle.net/1942/14779-
dc.description.abstractApproximations of a concept by a variable precision rough-set model (VPRS) usually vary under a dynamic information system environment. It is thus effective to carry out incremental updating approximations by utilizing previous data structures. This paper focuses on a new incremental method for updating approximations of VPRS while objects in the information system dynamically alter. It discusses properties of information granulation and approximations under the dynamic environment while objects in the universe evolve over time. The variation of an attribute's domain is also considered to perform incremental updating for approximations under VPRS. Finally, an extensive experimental evaluation validates the efficiency of the proposed method for dynamic maintenance of VPRS approximations.-
dc.description.sponsorshipThis work is supported by the National Science Foundation of China (Nos. 60873108, 61175047, 61100117) and the Fundamental Research Funds for the Central Universities (SWJTU11ZT08). In addition, thanks to Xiong Wu and Xiaolan Ji for their early contributions to this work.-
dc.language.isoen-
dc.publisherIEEE COMPUTER SOC-
dc.subject.otherVariable precision rough-set model; knowledge discovery; granular computing; information systems; incremental updating-
dc.subject.otherComputer Science, Artificial Intelligence; Computer Science, Information Systems; Engineering, Electrical & Electronic; Variable precision rough-set model; knowledge discovery; granular computing; information systems; incremental updating-
dc.titleA Rough-Set-Based Incremental Approach for Updating Approximations under Dynamic Maintenance Environments-
dc.typeJournal Contribution-
dc.identifier.epage284-
dc.identifier.issue2-
dc.identifier.spage274-
dc.identifier.volume25-
local.format.pages11-
local.bibliographicCitation.jcatA1-
dc.description.notesLi, TR (reprint author), [Chen, Hongmei; Li, Tianrui] SW Jiaotong Univ, Sch Informat Sci & Technol, Chengdu 610031, Peoples R China. [Ruan, Da] Univ Ghent, Dept Appl Math & Comp Sci, Ghent, Belgium. [Ruan, Da] Hasselt Univ, Dept Appl Econ, Diepenbeek, Belgium. [Ruan, Da] Univ Technol Sydney, Fac Informat Technol, Sydney, NSW 2007, Australia. [Lin, Jianhui] SW Jiaotong Univ, Tract Power State Key Lab, Chengdu 610031, Peoples R China. [Hu, Chengxiang] Chuzhou Univ, Sch Comp & Informat Engn, Chuzhou 239000, Peoples R China. hmchen@swjtu.edu.cn; trli@swjtu.edu.cn; linjhyz@126.com; chengxiang0550@163.com-
local.publisher.placeLOS ALAMITOS-
local.type.refereedRefereed-
local.type.specifiedArticle-
dc.identifier.doi10.1109/TKDE.2011.220-
dc.identifier.isi000314188900005-
item.fulltextNo Fulltext-
item.contributorChen, Hongmei-
item.contributorLi, Tianrui-
item.contributorRUAN, Da-
item.contributorLin, Jianhui-
item.contributorHu, Chengxiang-
item.accessRightsClosed Access-
item.fullcitationChen, Hongmei; Li, Tianrui; RUAN, Da; Lin, Jianhui & Hu, Chengxiang (2013) A Rough-Set-Based Incremental Approach for Updating Approximations under Dynamic Maintenance Environments. In: IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 25 (2), p. 274-284.-
item.validationecoom 2014-
crisitem.journal.issn1041-4347-
crisitem.journal.eissn1558-2191-
Appears in Collections:Research publications
Show simple item record

SCOPUSTM   
Citations

103
checked on Sep 3, 2020

WEB OF SCIENCETM
Citations

131
checked on Apr 22, 2024

Page view(s)

38
checked on Apr 26, 2023

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.