A DNA-Based Algorithm for Minimizing Decision Rules: A Rough Sets Approach
Authors:
- 20 October 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Nanobioscience
- Vol. 10 (3) , 139-151
Abstract
Rough sets are often exploited for data reduction and classification. While they are conceptually appealing, the techniques used with rough sets can be computationally demanding. To address this obstacle, the objective of this study is to investigate the use of DNA molecules and associated techniques as an optimization vehicle to support algorithms of rough sets. In particular, we develop a DNA-based algorithm to derive decision rules of minimal length. This new approach can be of value when dealing with a large number of objects and their attributes, in which case the complexity of rough-sets-based methods is NP-hard. The proposed algorithm shows how the essential components involved in the minimization of decision rules in data processing can be realized.Keywords
This publication has 15 references indexed in Scilit:
- A DNA-based algorithm for arranging weighted cliquesSimulation Modelling Practice and Theory, 2008
- A Comparison of Three Strategies to Rule Induction from Data with Numerical AttributesElectronic Notes in Theoretical Computer Science, 2003
- DATA‐BASED ACQUISITION AND INCREMENTAL MODIFICATION OF CLASSIFICATION RULESComputational Intelligence, 1995
- Molecular Computation of Solutions to Combinatorial ProblemsScience, 1994
- Variable precision rough set modelJournal of Computer and System Sciences, 1993
- Sensitivity of Rough Classification to Changes in Norms of Attributes1992
- The Discernibility Matrices and Functions in Information Systems1992
- Rough sets: probabilistic versus deterministic approachInternational Journal of Man-Machine Studies, 1988
- Rough classificationInternational Journal of Man-Machine Studies, 1984
- Rough setsInternational Journal of Parallel Programming, 1982