×

Incremental mechanism of attribute reduction based on discernible relations for dynamically increasing attribute. (English) Zbl 1436.68345

Summary: Rough set is a data evaluation methodology to take care of uncertainty in data. Attribute reduction with rough set goals to achieve a compact and informative attribute set for a given data sets, and incremental mechanism is reasonable selection for attribute reduction in dynamic data sets. This paper focuses on introducing incremental mechanism to develop effective incremental algorithm during the arrival of new attributes in terms of approach of discerning samples. The traditional definition of discernibility matrix is improved first to address fewer samples to be discerned. Based on this improvement, discernible relation is developed for every attribute and utilized to characterize attribute reduction. For dynamic data sets with the dynamically increasing of attributes, an incremental mechanism is introduced to judge and ignore unnecessary new arriving attributes. For necessary new arriving attributes, the original reduct is updated in terms of updating of discernible relations instead of information granular or information entropy. The efficiency and effectiveness of developed incremental algorithm based on this mechanism is demonstrated through experimental comparisons in this paper in terms of running time.

MSC:

68T37 Reasoning under uncertainty in the context of artificial intelligence
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Benitez-Caballero, Mj; Medina, J.; Ramirez-Poussa, E.; Slȩzak, D., Bireducts with tolerance relations, Inf Sci, 435, 26-39 (2018) · Zbl 1440.68283 · doi:10.1016/j.ins.2017.12.037
[2] Benitez-Caballero, Mj; Medina, J.; Ramirez-Poussa, E.; Slezak, D., A computational procedure for variable selection preserving different initial conditions, Int J Comput Math (2019) · Zbl 1484.68239 · doi:10.1080/00207160.2019.1613530
[3] Bien, Z., Incremental inductive learning algorithm in the framework of rough set theory and its application, Int J Fuzzy Syst, 1, 1, 25-36 (2007)
[4] Chen, D.; Yang, Y., Attribute reduction for heterogeneous data based on the combination of classical and fuzzy rough set models, IEEE Trans Fuzzy Syst, 22, 5, 1325-1334 (2014) · doi:10.1109/TFUZZ.2013.2291570
[5] Chen, D.; Zhao, S.; Zhang, L.; Yang, Y.; Zhang, X., Sample pair selection for attribute reduction with rough set, IEEE Trans Knowl Data Eng, 24, 11, 2080-2093 (2012) · doi:10.1109/TKDE.2011.89
[6] Feng, H.; Jin, D.; Guo, Y., Incremental algorithms for attribute reduction in decision table, Control Decis, 22, 3, 267-268 (2007) · Zbl 1150.68407
[7] Guan, L.; Wang, G., An incremental updating algorithm for attribute reduction set of decision tables, J Front Comput Sci Technol, 4, 5, 436-444 (2010)
[8] Han, Y.; Shi, P.; Chen, S., Bipolar-valued rough fuzzy set and its applications to decision information system, IEEE Trans Fuzzy Syst, 23, 2358-2370 (2015) · doi:10.1109/TFUZZ.2015.2423707
[9] Hu, Q.; Yu, D.; Liu, J.; Wu, C., Neighborhood rough set based heterogeneous feature subset selection, Inf Sci, 178, 18, 3577-3594 (2008) · Zbl 1154.68466 · doi:10.1016/j.ins.2008.05.024
[10] Jing, Y.; Li, T.; Huang, J.; Zhang, Y., An incremental attribute reduction approach based on knowledge granularity under the attribute generalization, Int J Approx Reason, 76, 80-95 (2016) · Zbl 1385.68047 · doi:10.1016/j.ijar.2016.05.001
[11] Liang, J.; Wang, F.; Dang, C.; Qian, Y., A group incremental approach to feature selection applying rough set technique, IEEE Trans Knowl Data Eng, 26, 2, 294-308 (2014) · doi:10.1109/TKDE.2012.146
[12] Medina, J., Relating attribute reduction in formal, object-oriented and property-oriented concept lattices, Comput Math Appl, 64, 6, 1992-2002 (2012) · Zbl 1268.06007 · doi:10.1016/j.camwa.2012.03.087
[13] Orlowska, M.; Orlowski, M., Maintenance of knowledge in dynamic information systems. Intelligent decision support (1992), Netherlands: Springer, Netherlands
[14] Pawlak, Z., Rough sets, Int J Comput Inform Sci, 11, 5, 341-356 (1982) · Zbl 0501.68053 · doi:10.1007/BF01001956
[15] Shu, W.; Shen, H., Updating attribute reduction in incomplete decision systems with the variation of attribute set (2014), Amsterdam: Elsevier, Amsterdam · Zbl 1316.68193
[16] Skowron, Andrzej; Rauszer, Cecylia, The Discernibility Matrices and Functions in Information Systems, Intelligent Decision Support, 331-362 (1992), Dordrecht: Springer Netherlands, Dordrecht
[17] Stawicki, S.; Sleak, D.; Janusz, A.; Widz, S., Decision bireducts and decision reducts—a comparison, Int J Approx Reason, 84, 75-109 (2017) · Zbl 1419.68178 · doi:10.1016/j.ijar.2017.02.007
[18] Swiniarski, R.; Skowron, A., Rough set methods in feature selection and recognition, Pattern Recogn Lett, 24, 6, 833-849 (2003) · Zbl 1053.68093 · doi:10.1016/S0167-8655(02)00196-4
[19] Teng, S.; Liu, M.; Yang, A.; Zhang, J.; Nian, Y.; He, M., Efficient attribute reduction from the viewpoint of discernibility, Inf Sci, 326, 297-314 (2016) · Zbl 1390.68556 · doi:10.1016/j.ins.2015.07.052
[20] Wang, F.; Liang, J.; Dang, C., Attribute reduction for dynamic data sets, Appl Soft Comput, 13, 1, 676-689 (2013) · doi:10.1016/j.asoc.2012.07.018
[21] Wang, F.; Liang, J.; Qian, Y., Attribute reduction: a dimension incremental strategy, Knowl Based Syst, 39, 95-108 (2013) · doi:10.1016/j.knosys.2012.10.010
[22] Yao, Y.; Zhao, Y., Discernibility matrix simplification for constructing attribute reducts, Inf Sci, 179, 7, 867-882 (2009) · Zbl 1162.68704 · doi:10.1016/j.ins.2008.11.020
[23] Zeng, A.; Li, T.; Liu, D.; Zhang, J.; Chen, H., A fuzzy rough set approach for incremental feature selection on hybrid information systems, Fuzzy Sets Syst, 258, 39-60 (2015) · Zbl 1335.68274 · doi:10.1016/j.fss.2014.08.014
[24] Ziarko, W., Variable precision rough set model, J Comput Syst Sci, 46, 1, 39-59 (1993) · Zbl 0764.68162 · doi:10.1016/0022-0000(93)90048-2
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.