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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Jia, X., Shang, L., Ji, Y., & Li, W. (2007). An incremental updating algorithm for core computing in dominance-based rough set model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4482 LNAI, pp. 403–410). Springer Verlag. https://doi.org/10.1007/978-3-540-72530-5_48
Mendeley helps you to discover research relevant for your work.