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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pawlak, Z.: Rough set. International Journal of Information and Computer Science 11, 341–356 (1982)
Greco, S., Matarazzo, B., Slowinski, R.: The use of rough sets and fuzzy sets in MCDM. In: Gal, T., Stewart, T., Hanne, T. (eds.) Adcances in Multiple Criteria Decision Making, pp. 14.1–14.59. Kluwer Academic Publishers, Dordrecht (1999)
Slowinski, R., et al.: Rough sets processing of inconsistent information. Control and Cyberbetics 29, 379–404 (2000)
Greco, S., Inuiguchi, M., Slowinski, B.: Dominance-based rough set approach using possibility and necessity measures. In: Alpigini, J.J., et al. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 85–92. Springer, Heidelberg (2002)
Hu, X.H., Cercone, N.: Learning in relational databases: A rough set approach. Computational Intelligence 11(2), 323–338 (1995)
Jelonek, J., Krawiec, K., Slowinski, R.: Rough set reduction of attributes and their domains for neural networks. Computational Intelligence 11(2), 339–347 (1995)
Wang, J., Wang, J.: Reduction algorithm based on discernibility matrix the ordered attributes method. Journal of Computer Science and Technology 16(6), 489–504 (2001)
Yang, M.: An incremental updating algorithm of the computation of a core based on the improved discernibility matrix (in chinese). Chinese Journal of Computers 29(3), 407–413 (2006)
Greco, S., et al.: An algorithm for induction of decision rules consistent with the dominance principle. In: Ziarko, W., Yao, Y. (eds.) RSCTC 2000. LNCS (LNAI), vol. 2005, pp. 304–313. Springer, Heidelberg (2001)
Greco, S., Matarazzo, B., Slowinski, R.: Rough sets methodology for sorting problems in presence of multiple attributes and criteria. European Journal of Operational Research 138, 247–259 (2002)
Li, K.W., Wu, M.D.: Rough set based on order relations (in chinese). In: Proceedings of 2003 National Conference on Artificial Intelligence, pp. 1359–1363 (2003)
Wu, Y.M., Ye, D.Y.: Computation of a core in a rough set model based on dominance relation (in chinese). Journal of Computer Science and Technology 31(10A), 138–139 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jia, X., Shang, L., Ji, Y., Li, W. (2007). An Incremental Updating Algorithm for Core Computing in Dominance-Based Rough Set Model. In: An, A., Stefanowski, J., Ramanna, S., Butz, C.J., Pedrycz, W., Wang, G. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. RSFDGrC 2007. Lecture Notes in Computer Science(), vol 4482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72530-5_48
Download citation
DOI: https://doi.org/10.1007/978-3-540-72530-5_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72529-9
Online ISBN: 978-3-540-72530-5
eBook Packages: Computer ScienceComputer Science (R0)