An Incremental Updating Algorithm for Core Computing in Dominance-Based Rough Set Model

Authors:
Xiuyi Jia;Lin Shang;Yangsheng Ji;Weiwei Li
Affiliations:
National Laboratory for Novel Software Technology, Nanjing University, Nanjing, 210093, China;National Laboratory for Novel Software Technology, Nanjing University, Nanjing, 210093, China;National Laboratory for Novel Software Technology, Nanjing University, Nanjing, 210093, China;College of Automation, Chongqing University, Chongqing, 400030, China
Venue:
RSFDGrC '07 Proceedings of the 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
Year:
2009

Citing 3
Cited 0

Reduction algorithms based on discernibility matrix: the ordered attributes method

Journal of Computer Science and Technology
An Algorithm for Induction of Decision Rules Consistent with the Dominance Principle

RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Dominance-Based Rough Set Approach Using Possibility and Necessity Measures

TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper analyzes incremental updating for core computing in a dominance-based rough set model, which extends previous reduct studies in capability of dynamic updating and dominance relation. Then we redefine the dominance discernibility matrix and present an incremental updating algorithm. In this algorithm, when new samples arrive, the proposed solution only involves a few modifications to relevant rows and columns in the dominance discernibility matrix instead of recalculation.Both of theoretical analysis and experimental results show that the algorithm is effective and efficient in dynamic computation.