English  |  正體中文  |  简体中文  |  Items with full text/Total items : 28611/40649
Visitors : 640322      Online Users : 78
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/52306

Title: A novel approach for efficient updating approximations in dynamic ordered information systems
Authors: Shu Wang
Tianrui Li
Chuan Luo
Jie Hu
Hamido Fujita
Tianqiang Huang
Contributors: 國立臺灣海洋大學:資工工程學系
Keywords: Rough sets
Ordered information system
Dominance-based rough sets
Knowledge discovery
Date: 2020-01
Issue Date: 2019-11-15T03:24:32Z
Publisher: Information Sciences
Abstract: Abstract: Dynamic data in real-time application are typically updating in a multi-dimensional manner. In this paper, we introduce a novel approach based on Dominance-based Rough Set Approach (DRSA) to efficiently deal with the multi-dimensional variations of attribute set and attribute values in dynamic Ordered Information Systems (OIS). We improve the original notion of the P-generalized decision domains to make the feature value matrix be dominance symmetrical, and propose an efficient strategy based on the improved notion to obtain the dominance feature matrix. Then, we employ the dominance-feature-matrix-based incremental strategy to avoid repeated comparisons between original attributes, so that to efficiently update rough approximations of DRSA with the simultaneously increased attribute set and varied attribute values. In our approach, the steps based on these two combined strategies can work altogether or separately, not only efficiently dealing with the simultaneously increased attribute set and varied attribute values, but also efficiently dealing with the individually increased attribute set or varied attribute values in dynamic OIS. Efficient algorithm based on the updating strategies is designed and multiple groups of experiments are conducted. Experimental results on different real-world data sets show that the proposed algorithm is much faster than other algorithms for dealing with the multi-dimensional or the single-dimensional variations of attribute set and attribute values.
Relation: 207 pp.197-219
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/52306
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

File Description SizeFormat

All items in NTOUR are protected by copyright, with all rights reserved.


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback