Show simple item record

dc.contributor.authorWang, Shu-Lin
dc.contributor.authorLi, Xue-Ling
dc.contributor.authorFang, Jianwen
dc.date.accessioned2014-01-31T23:14:03Z
dc.date.available2014-01-31T23:14:03Z
dc.date.issued2012-07-25
dc.identifier.citationWang, Shu-Lin, Xue-Ling Li, and Jianwen Fang. 2012. “Finding Minimum Gene Subsets with Heuristic Breadth-First Search Algorithm for Robust Tumor Classification.” BMC Bioinformatics 13:178. http://dx.doi.org/10.1186/1471-2105-13-178.
dc.identifier.urihttp://hdl.handle.net/1808/12914
dc.description.abstractBackground: Previous studies on tumor classification based on gene expression profiles suggest that gene selection plays a key role in improving the classification performance. Moreover, finding important tumor-related genes with the highest accuracy is a very important task because these genes might serve as tumor biomarkers, which is of great benefit to not only tumor molecular diagnosis but also drug development. Results: This paper proposes a novel gene selection method with rich biomedical meaning based on Heuristic Breadth-first Search Algorithm (HBSA) to find as many optimal gene subsets as possible. Due to the curse of dimensionality, this type of method could suffer from over-fitting and selection bias problems. To address these potential problems, a HBSA-based ensemble classifier is constructed using majority voting strategy from individual classifiers constructed by the selected gene subsets, and a novel HBSA-based gene ranking method is designed to find important tumor-related genes by measuring the significance of genes using their occurrence frequencies in the selected gene subsets. The experimental results on nine tumor datasets including three pairs of cross-platform datasets indicate that the proposed method can not only obtain better generalization performance but also find many important tumor-related genes. Conclusions: It is found that the frequencies of the selected genes follow a power-law distribution, indicating that only a few top-ranked genes can be used as potential diagnosis biomarkers. Moreover, the top-ranked genes leading to very high prediction accuracy are closely related to specific tumor subtype and even hub genes. Compared with other related methods, the proposed method can achieve higher prediction accuracy with fewer genes. Moreover, they are further justified by analyzing the top-ranked genes in the context of individual gene function, biological pathway, and protein-protein interaction network. Keywords: Gene expression profiles; Gene selection; Tumor classification; Heuristic breadth-first search; Power-law distribution
dc.publisherBioMed Central
dc.rightsThis is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
dc.rights.urihttp://creativecommons.org/licenses/by/2.0
dc.subjectGene-expression-profiles
dc.subjectGene-selection
dc.subjectTumor-classification
dc.subjectHeuristic-breadth-first-search
dc.subjectPower-law distribution
dc.titleFinding minimum gene subsets with heuristic breadth-first search algorithm for robust tumor classification
dc.typeArticle
kusw.kuauthorWang, Shu-Lin
kusw.kuauthorFang, Jianwen
kusw.kudepartmentElectrical Engineering and Computer Science
kusw.oastatusfullparticipation
dc.identifier.doi10.1186/1471-2105-13-178
kusw.oaversionScholarly/refereed, publisher version
kusw.oapolicyThis item meets KU Open Access policy criteria.
dc.rights.accessrightsopenAccess


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

This is an Open Access article distributed under the terms of the Creative Commons Attribution License
(http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Except where otherwise noted, this item's license is described as: This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.