Optimization Analysis on Dynamic Reduction Algorithm
-
Yizhou Chen
Abstract
On the basis of rough set theory, the strengths of dynamic reduction are elaborated compared with traditional non-dynamic methods. A systematic concept of dynamic reduction from sampling process to the generation of the reduct set is presented. A new method of sampling is created to avoid the defects of being too subjective. And in order to deal with the over-sized time consuming problem in traditional dynamic reduction process, a quick algorithm is proposed within the constraint conditions. We have also proved that dynamic core possesses the essential characteristics of a reduction core on the basis of the formalized definition of the multi-layered dynamic core.
Acknowledgements
The authors gratefully acknowledge the editor and two anonymous referees for their insightful comments and helpful suggestions that led to a marked improvement of the article.
References
[1] Pawlak Z. Rough sets. International Journal of Information and Computer Sciences, 1982.10.1007/BF01001956Search in Google Scholar
[2] Tsumoto S. Medical Diagnosis: Rough Set View. 2017.10.1007/978-3-319-54966-8_7Search in Google Scholar
[3] Aličković E, Subasi A. Breast cancer diagnosis using GA feature selection and Rotation Forest. Neural Computing & Applications, 2017, 28(4): 753–763.10.1007/s00521-015-2103-9Search in Google Scholar
[4] Peng X, Wen J, Li Z, et al. Rough set theory applied to pattern recognition of partial discharge in noise affected cable data. IEEE Transactions on Dielectrics & Electrical Insulation, 2017, 24(1): 147–156.10.1109/TDEI.2016.006060Search in Google Scholar
[5] Lupyan M, Kuzminov K. Analysing possible applications for available mathematical models of tracked vehicle movement over the rough terrain to examine tracked chain dynamic processes. Science & Education of Bauman MSTU, 2014, 14(11): 110–117.10.7463/1114.0733222Search in Google Scholar
[6] Pawlakab Z. Rough set approach to knowledge-based decision support. European Journal of Operational Research, 1995, 99(1): 48–57.10.1016/S0377-2217(96)00382-7Search in Google Scholar
[7] Bazan J G. A comparison of dynamic and nondynamic rough set methods for extracting laws from decision tables. Rough Sets in Knowledge Discovery, Heidelberg: Physica-Verlag, 1998: 321–365.Search in Google Scholar
[8] Skowron A, Rauszer C. The discernibility matrices and functions in information systems. Theory & Decision Library, 1992, 11: 331–362.10.1007/978-94-015-7975-9_21Search in Google Scholar
[9] Bazan J G, Skowron A, Synak P. Dynamic reducts as a tool for extracting laws from decisions tables// International Symposium on Methodologies for Intelligent Systems. Springer-Verlag, 1994: 346–355.10.1007/3-540-58495-1_35Search in Google Scholar
[10] Shu W, Qian W. An incremental approach to attribute reduction from dynamic incomplete decision systems in rough set theory. Data & Knowledge Engineering, 2015, 100: 116–132.10.1016/j.datak.2015.06.009Search in Google Scholar
[11] Mukamakuza C P, Wang J, Li L. Dynamic reducts computation analysis based on rough sets// International Conference on Natural Computation. IEEE, 2014: 480–485.10.1109/ICNC.2014.6975882Search in Google Scholar
[12] Guo Y, Jiao L, Wang S, et al. A novel dynamic rough subspace based selective ensemble. Pattern Recognition, 2014, 48(5): 1638–1652.10.1016/j.patcog.2014.11.001Search in Google Scholar
[13] Trabelsi S, Elouedi Z, Lingras P. Belief rough set classification for web mining based on dynamic core// The Tenth International Conference on Intelligent Systems Design and Applications ISDA. 2010: 403–408.10.1109/ISDA.2010.5687230Search in Google Scholar
[14] Wang G Y. Attribute core of decision table. Lecture Notes in Computer Science, 2002, 2475: 213–217.10.1007/3-540-45813-1_27Search in Google Scholar
[15] Rice J A. Les informations contenues dans cette page sont `a usage strict de et ne doivent être utilisées ou copiées par un tiers. Mathematical Statistics and Data Analysis, Mathematical Gazette, 1988, 72(72): 390–391.Search in Google Scholar
© 2018 Walter De Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Co-evolution: A New Perspective for Business Model Innovation
- Solving the Observing and Downloading Integrated Scheduling Problem of Earth Observation Satellite with a Quantum Genetic Algorithm
- A Modified Gravity p-Median Model for Optimizing Facility Locations
- Real-Time Pricing for Smart Grid with Multiple Companies and Multiple Users Using Two-Stage Optimization
- Optimization Analysis on Dynamic Reduction Algorithm
- Finding Cut-Edges and the Minimum Spanning Tree via Semi-Tensor Product Approach
- A New Design of Electrical Impedance Tomography Sensor System for Pulmonary Disease Diagnosis
Articles in the same Issue
- Co-evolution: A New Perspective for Business Model Innovation
- Solving the Observing and Downloading Integrated Scheduling Problem of Earth Observation Satellite with a Quantum Genetic Algorithm
- A Modified Gravity p-Median Model for Optimizing Facility Locations
- Real-Time Pricing for Smart Grid with Multiple Companies and Multiple Users Using Two-Stage Optimization
- Optimization Analysis on Dynamic Reduction Algorithm
- Finding Cut-Edges and the Minimum Spanning Tree via Semi-Tensor Product Approach
- A New Design of Electrical Impedance Tomography Sensor System for Pulmonary Disease Diagnosis
