DocumentCode
2925336
Title
Gene selection algorithm combining ReliefF and relative neighborhood rough set
Author
Xu, Jiu-cheng ; Zhang, Ling-jun ; Sun, Lin ; Gao, Yun-peng
Author_Institution
Coll. of Comput. & Inf. Technol., Henan Normal Univ., Xinxiang, China
fYear
2011
fDate
8-10 Nov. 2011
Firstpage
745
Lastpage
749
Abstract
The curse of dimensionality, caused by high-dimensionality gene and small-size sample of gene expression dataset, may degrade the accuracy of tumor classification. To solve the issue, in this paper, the neighborhood rough set theory is introduced, and through expanding neighborhood threshold, the relative neighborhood rough set theory is proposed. Some corresponding theorems are drawn, and a gene selection algorithm of multi-class problem, by combining ReliefF and relative neighborhood rough set, is constructed. Finally, through comparing with other methods on four opened gene expression datasets, our method shows that only few genes could achieve higher tumor classification accuracy.
Keywords
data handling; genetics; medical computing; pattern classification; rough set theory; tumours; gene expression dataset; high dimensionality gene selection algorithm; multiclass problem; neighborhood threshold; relative neighborhood rough set theory; small-size sample; tumor classification; tumor classification accuracy; Classification algorithms; Computers; Diversity reception; Educational institutions; Gene expression; Set theory; Tumors; Gene selection; Neighborhood threshold; Relative neighborhood rough; ReliefF;
fLanguage
English
Publisher
ieee
Conference_Titel
Granular Computing (GrC), 2011 IEEE International Conference on
Conference_Location
Kaohsiung
Print_ISBN
978-1-4577-0372-0
Type
conf
DOI
10.1109/GRC.2011.6122691
Filename
6122691
Link To Document