Interactive Naive Bayesian network: A new approach of constructing gene-gene interaction network for cancer classification
- Authors
- Tian, Xue W.; Lim, Joon S.
- Issue Date
- 2015
- Publisher
- IOS PRESS
- Keywords
- Gene interaction; naive Bayesian; differently expressed genes (DEGs); leukemia; colon; DNA microarray
- Citation
- BIO-MEDICAL MATERIALS AND ENGINEERING, v.26, pp.S1929 - S1936
- Journal Title
- BIO-MEDICAL MATERIALS AND ENGINEERING
- Volume
- 26
- Start Page
- S1929
- End Page
- S1936
- URI
- https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/11947
- DOI
- 10.3233/BME-151495
- ISSN
- 0959-2989
- Abstract
- Naive Bayesian (NB) network classifier is a simple and well-known type of classifier, which can be easily induced from a DNA microarray data set. However, a strong conditional independence assumption of NB network sometimes can lead to weak classification performance. In this paper, we propose a new approach of interactive naive Bayesian (INB) network to weaken the conditional independence of NB network and classify cancers using DNA microarray data set. We selected the differently expressed genes (DEGs) to reduce the dimension of the microarray data set. Then, an interactive parent which has the biggest influence among all DEGs is searched for each DEG. And then we calculate a weight to represent the interactive relationship between a DEG and its parent. Finally, the gene-gene interaction network is constructed. We experimentally test the INB network in terms of classification accuracy using leukemia and colon DNA microarray data sets, then we compare it with the NB network. The INB network can get higher classification accuracies than NB network. And INB network can show the gene-gene interactions visually.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - IT융합대학 > 컴퓨터공학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/11947)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.