|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2008 International Symposium on Computational Intelligence and Design
Incremental Core Computing for Incomplete Decision Tables
October 17-October 18
ISBN: 978-0-7695-3311-7
| ASCII Text | x | ||
| Renpu Li, Dedong Zhang, Yongsheng Zhao, Xinting Tang, "Incremental Core Computing for Incomplete Decision Tables," Computational Intelligence and Design, International Symposium on, vol. 1, pp. 270-273, 2008 International Symposium on Computational Intelligence and Design, 2008. | |||
| BibTex | x | ||
| @article{ 10.1109/ISCID.2008.84, author = {Renpu Li and Dedong Zhang and Yongsheng Zhao and Xinting Tang}, title = {Incremental Core Computing for Incomplete Decision Tables}, journal ={Computational Intelligence and Design, International Symposium on}, volume = {1}, year = {2008}, isbn = {978-0-7695-3311-7}, pages = {270-273}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISCID.2008.84}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Computational Intelligence and Design, International Symposium on TI - Incremental Core Computing for Incomplete Decision Tables SN - 978-0-7695-3311-7 SP270 EP273 A1 - Renpu Li, A1 - Dedong Zhang, A1 - Yongsheng Zhao, A1 - Xinting Tang, PY - 2008 KW - rough sets KW - core KW - incomplete decision table KW - incremental algorithm VL - 1 JA - Computational Intelligence and Design, International Symposium on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISCID.2008.84
Core is an important concept of rough set theory and many efficient reduction methods were proposed from the computation of core. However, very little work has been performed on updating a core, especially for incomplete decision tables. In this paper an incremental algorithm for updating the core of an incomplete decision table is presented based on discernibility matrix, which may obtain a new core through several simple operations on original discernibility matrix when a new object is added to the decision table. Theoretical analysis and example show that the incremental core algorithm proposed is efficient for incomplete decision tables.
Index Terms:
rough sets, core, incomplete decision table, incremental algorithm
Citation:
Renpu Li, Dedong Zhang, Yongsheng Zhao, Xinting Tang, "Incremental Core Computing for Incomplete Decision Tables," iscid, vol. 1, pp.270-273, 2008 International Symposium on Computational Intelligence and Design, 2008
Usage of this product signifies your acceptance of the Terms of Use.