Earticle

현재 위치 Home

A Novel Feature Gene Selection Method Based On Neighborhood Mutual Information

첫 페이지 보기
  • 발행기관
    보안공학연구지원센터(IJHIT) 바로가기
  • 간행물
    International Journal of Hybrid Information Technology 바로가기
  • 통권
    Vol.8 No.7 (2015.07)바로가기
  • 페이지
    pp.277-292
  • 저자
    Tao Chen, Zenglin Hong, Hui Zhao, Xiao Yang, Jun Wei
  • 언어
    영어(ENG)
  • URL
    https://www.earticle.net/Article/A251278

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

원문정보

초록

영어
DNA microarray technique can detect tens of thousands of genes activity in cells and has been widely used in clinical diagnosis. However, microarray data has characteristics of high dimension and small samples, moreover many irrelevant and redundant genes also decrease performance of classification algorithm .Mutual information is very effective method and has widely been used in feature gene selection, but it cannot directly deal with continuous features. Therefore, this paper proposes a novel feature gene selection method to resolve this problem. Firstly, a lot of irrelevant genes are eliminated from original data by using reliefF algorithm , and the candidate subset of genes is obtained; Secondly, a algorithm based on neighborhood mutual information and forward greedy search strategy which deals with directly continuous features is proposed to select feature genes in above genes subset. Here, because radius of neighborhood greatly affects reduction performance, differential evolution algorithm is applied to optimize radius before reduction. The simulation results on six benchmark microarray datasets show that our method can obtain higher classification accuracy using as few genes as possible, especially neighborhood mutual information can directly continuous features. Feature genes selected has an important meaning for understanding microarray data and finding pathogenic genes of cancer. It is an effective and efficient method for feature genes selection.

목차

Abstract
 1. Introduction
 2. ReliefF Algorithm
 3. Neighborhood Mutual Information
  3.1 Mutual Information
  3.2 Neighborhood Mutual Information
  3.3 Feature Selection Based On Neighborhood Mutual Information and Forward Greedy Search Strategy
 4. Differential Evolution Algorithm
 5. Our Proposed Method
 6. Experimental Results and Analysis
  6.1 Experimental Datasets and Methods
  6.2 Experimental Results and Analysis
 7. Conclusion
 Acknowledgements
 References

저자

  • Tao Chen [ School of Automation, Northwestern Polytechnical University, Xi’an, Shaanxi, 710072, China, School of Mathematics and Computer Science, Shaanxi University of Technology, Hanzhong, Shaanxi, 723000, China ] Corresponding author
  • Zenglin Hong [ School of Automation, Northwestern Polytechnical University, Xi’an, Shaanxi, 710072, China ]
  • Hui Zhao [ School of Mathematics and Computer Science, Shaanxi University of Technology, Hanzhong, Shaanxi, 723000, China ]
  • Xiao Yang [ School of Mathematics and Computer Science, Shaanxi University of Technology, Hanzhong, Shaanxi, 723000, China ]
  • Jun Wei [ School of Mathematics and Computer Science, Shaanxi University of Technology, Hanzhong, Shaanxi, 723000, China ]

참고문헌

자료제공 : 네이버학술정보

간행물 정보

발행기관

  • 발행기관명
    보안공학연구지원센터(IJHIT) [Science & Engineering Research Support Center, Republic of Korea(IJHIT)]
  • 설립연도
    2006
  • 분야
    공학>컴퓨터학
  • 소개
    1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업

간행물

  • 간행물명
    International Journal of Hybrid Information Technology
  • 간기
    격월간
  • pISSN
    1738-9968
  • 수록기간
    2008~2016
  • 십진분류
    KDC 505 DDC 605

이 권호 내 다른 논문 / International Journal of Hybrid Information Technology Vol.8 No.7

    피인용수 : 0(자료제공 : 네이버학술정보)

    함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.

      페이지 저장