Graduate School of Information, Production and Systems, Waseda University, Kitakyushu 808-0135, Japan.
IEEE Trans Nanobioscience. 2011 Sep;10(3):139-51. doi: 10.1109/TNB.2011.2168535.
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.
粗糙集通常用于数据约简和分类。虽然它们在概念上很有吸引力,但粗糙集所使用的技术在计算上可能很繁琐。为了解决这个障碍,本研究的目的是研究 DNA 分子和相关技术的应用,作为支持粗糙集算法的优化工具。具体来说,我们开发了一种基于 DNA 的算法来推导最短长度的决策规则。当处理大量对象及其属性时,这种新方法可能很有价值,在这种情况下,基于粗糙集的方法的复杂性是 NP 难的。所提出的算法展示了如何实现数据处理中决策规则最小化所涉及的基本组成部分。