DNA Rough-Set Computing in the Development of Decision Rule Reducts

Ikno Kim; Junzo Watada; Witold Pedrycz

doi:10.1007/978-3-642-30344-9_15

DNA Rough-Set Computing in the Development of Decision Rule Reducts

Ikno Kim^*, Junzo Watada, Witold Pedrycz

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Abstract

Rough set methods are often employed for reducting decision rules. The specific techniques involving rough sets can be carried out in a computational manner. However, they are quite demanding when it comes computing overhead. In particular, it becomes problematic to compute all minimal length decision rules while dealing with a large number of decision rules. This results in an NP-hard problem. To address this computational challenge, in this study, we propose a method of DNA rough-set computing composed of computational DNA molecular techniques used for decision rule reducts. This method can be effectively employed to alleviate the computational complexity of the problem.

Original language	English
Title of host publication	Intelligent Systems Reference Library
Pages	409-438
Number of pages	30
Volume	42
DOIs	https://doi.org/10.1007/978-3-642-30344-9_15
Publication status	Published - 2013

Publication series

Name	Intelligent Systems Reference Library
Volume	42
ISSN (Print)	18684394
ISSN (Electronic)	18684408

Keywords

affinity separation technique
decision rule reduction
deoxyribonucleic acid
digraph
DNA computation
DNA molecular technique
DNA rough-set computing
encoding process
gel electrophoresis technique
hydrogen bond
ligation technique
nitrogen- containing base
NP hard problem
polymerase chain reaction technique
restriction enzyme technique

ASJC Scopus subject areas

Computer Science(all)
Information Systems and Management
Library and Information Sciences

Access to Document

10.1007/978-3-642-30344-9_15

Cite this

@inbook{caafb8fd070d47be8f3df607b165abd2,

title = "DNA Rough-Set Computing in the Development of Decision Rule Reducts",

abstract = "Rough set methods are often employed for reducting decision rules. The specific techniques involving rough sets can be carried out in a computational manner. However, they are quite demanding when it comes computing overhead. In particular, it becomes problematic to compute all minimal length decision rules while dealing with a large number of decision rules. This results in an NP-hard problem. To address this computational challenge, in this study, we propose a method of DNA rough-set computing composed of computational DNA molecular techniques used for decision rule reducts. This method can be effectively employed to alleviate the computational complexity of the problem.",

keywords = "affinity separation technique, decision rule reduction, deoxyribonucleic acid, digraph, DNA computation, DNA molecular technique, DNA rough-set computing, encoding process, gel electrophoresis technique, hydrogen bond, ligation technique, nitrogen- containing base, NP hard problem, polymerase chain reaction technique, restriction enzyme technique",

author = "Ikno Kim and Junzo Watada and Witold Pedrycz",

year = "2013",

doi = "10.1007/978-3-642-30344-9_15",

language = "English",

isbn = "9783642303432",

volume = "42",

series = "Intelligent Systems Reference Library",

pages = "409--438",

booktitle = "Intelligent Systems Reference Library",

}

TY - CHAP

T1 - DNA Rough-Set Computing in the Development of Decision Rule Reducts

AU - Kim, Ikno

AU - Watada, Junzo

AU - Pedrycz, Witold

PY - 2013

Y1 - 2013

N2 - Rough set methods are often employed for reducting decision rules. The specific techniques involving rough sets can be carried out in a computational manner. However, they are quite demanding when it comes computing overhead. In particular, it becomes problematic to compute all minimal length decision rules while dealing with a large number of decision rules. This results in an NP-hard problem. To address this computational challenge, in this study, we propose a method of DNA rough-set computing composed of computational DNA molecular techniques used for decision rule reducts. This method can be effectively employed to alleviate the computational complexity of the problem.

AB - Rough set methods are often employed for reducting decision rules. The specific techniques involving rough sets can be carried out in a computational manner. However, they are quite demanding when it comes computing overhead. In particular, it becomes problematic to compute all minimal length decision rules while dealing with a large number of decision rules. This results in an NP-hard problem. To address this computational challenge, in this study, we propose a method of DNA rough-set computing composed of computational DNA molecular techniques used for decision rule reducts. This method can be effectively employed to alleviate the computational complexity of the problem.

KW - affinity separation technique

KW - decision rule reduction

KW - deoxyribonucleic acid

KW - digraph

KW - DNA computation

KW - DNA molecular technique

KW - DNA rough-set computing

KW - encoding process

KW - gel electrophoresis technique

KW - hydrogen bond

KW - ligation technique

KW - nitrogen- containing base

KW - NP hard problem

KW - polymerase chain reaction technique

KW - restriction enzyme technique

UR - http://www.scopus.com/inward/record.url?scp=84885458382&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84885458382&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-30344-9_15

DO - 10.1007/978-3-642-30344-9_15

M3 - Chapter

AN - SCOPUS:84885458382

SN - 9783642303432

VL - 42

T3 - Intelligent Systems Reference Library

SP - 409

EP - 438

BT - Intelligent Systems Reference Library

ER -

DNA Rough-Set Computing in the Development of Decision Rule Reducts

Abstract

Publication series

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this