A Survey on Incremental Attribute Reduction Method for Dynamic Data mining Decision Systems
DOI:
https://doi.org/10.26438/ijcse/v6i12.517519Keywords:
DIDS, mechanism in DIDSAbstract
In dynamic data mining situations, the attribute decrease issue has three issues: variety of protest sets, variety of trait sets and variety of property estimations. For the initial two issues, a couple of accomplishments have been made. For variety of the property estimations, current characteristic decrease approaches are not productive, in light of the fact that the strategy turns into a non-incremental or wasteful one sometimes. With the end goal to address this, we initially present the idea of an irregularity degree in a deficient choice framework and demonstrate that the property decrease dependent on the irregularity degree is proportional to that dependent on the positive area. At that point, three refresh procedures of irregularity degree for dynamic fragmented choice frameworks are given. At long last, the system of the incremental attribute decrease calculation is proposed.
References
[1]R.W. Swiniarski, A. Skowron, Rough set methods in feature selection and recognition, Pattern Recognit. Lett. 24 (2003) 833–849.
[2]M. Moshkov, B. Zielosko, Combinatorial Machine Learning: A Rough Set Approach, Studies in Computational Intelligence, vol.360, Springer, Berlin, 2011.
[3]Z. Pawlak, A. Skowron, Rudiments of rough sets, Inf. Sci. 177 (2007) 3–27
[4]Z. Pawlak, Rough set, Int. J. Comput. Inf. Sci. 11 (1982) 341–356.
[5]W. Ziarko, Variable precision rough set model, J. Comput. Syst. Sci. 46 (1993) 39–59.
[6]Z. Pawlak, Rough set theory and its application to data analysis, Cybern. Syst. 29 (1998) 661–668.
[7]A.K. Jain, R.P.W. Duin, J. Mao, Statistical pattern recognition: a review, IEEE Trans. Pattern Anal. Mach. Intell. 22 (2000) 4–37.
[8]D. Chen, C. Wang, Q. Hu, A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets, Inf. Sci. 177 (2007) 3500–3518.
[9]Y. Yao, Y. Zhao, Attribute reduction in decision-theoretic rough set models, Inf. Sci. 178 (2008) 3356–3373.
[10]Y. Qian, J. Liang, W. Pedrycz, Positive approximation: an accelerator for attribute reduction in rough set theory, Artif. Intell. 174 (2010) 597–618
[11]J. Stefanowski, A. Tsoukias, Incomplete information tables and rough classification, Comput. Intell. 17 (2001) 545–566
[12]F. Hu, G. Wang, H. Huang, Incremental attribute reduction based on elementary sets, in: International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, Springer-Verlag, 2005, pp.185–193.
[13]J.Y. Liang, W. Wei, Y.H. Qian, An incremental approach to computation of a core based on conditional entropy, Chin. J. Syst. Eng. Theory Pract. 4 (2008) 81–89.
[14]D. Liu, T.R. Li, D. Ruan, W.L. Zou, Anincremental approach for inducing knowledge from dynamic information systems, Fundam. Inform. 94 (2009) 245–260.
[15]Y.N. Fan, C.C. Huang, C.C. Chern, Rule induction based on an incremental rough set, Expert Syst. Appl. 36 (2009) 11439–11450.
[16]J. Liang, F. Wang, C. Dang, A group incremental approach to feature selection applying rough set technique, IEEE Trans. Knowl. Data Eng. 26 (2014) 294–308.
[17]W. Shu, W. Qian, An incremental approach to attribute reduction from dynamic incomplete decision systems in rough set theory, Data Knowl. Eng. 100 (2015) 116–132.
[18]Y. Jing, T. Li, F. Fujita, et al., An incremental attribute reduction approach based on knowledge granularity with a multi-granulation view, Inf. Sci. 411 (2017) 23–38.
[19]A. Zeng, T. Li, D. Liu, A fuzzy rough set approach for incremental feature selection on hybrid information systems, Fuzzy Sets Syst. 258 (2015) 39–60.
[20]C.C. Chan, A rough set approach to attribute generalization in data mining, Inf. Sci. 107 (1998) 169–176.
[21]T.R. Li, D. Ruan, W. Geert, J. Song, Y. Xu, A rough sets based characteristic relation approach for dynamic attribute generalization in data mining, Knowl.-Based Syst. 20 (2007) 485–494.
Downloads
Published
How to Cite
Issue
Section
License

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
