Skip to main content

Gene Selection Using Rough Set Theory

  • Conference paper
Rough Sets and Knowledge Technology (RSKT 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4062))

Included in the following conference series:

Abstract

The generic approach to cancer classification based on gene expression data is important for accurate cancer diagnosis, instead of using all genes in the dataset, we select a small gene subset out of thousands of genes for classification. Rough set theory is a tool for reducing redundancy in information systems, thus Application of Rough Set to gene selection is interesting. In this paper, a novel gene selection method called RMIMR is proposed for gene selection, which searches for the subset through maximum relevance and maximum positive interaction of genes. Compared with the classical methods based on statistics,information theory and regression, Our method leads to significantly improved classification in experiments on 4 gene expression datasets.

Supported by the National Key Research Program of China (No. 2003CSCA00200) and the National Key Lab Open Research Foundation (No. 2005C012).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Golub, T.R., Slonim, D.K., Tamayo, P., et al.: Classification of Cancer: Class discovery and Class Prediction by Gene Expression Monitoring. Science 286, 315–333 (1999)

    Article  Google Scholar 

  2. Ben-Dor, A., Bruhm, L., Friedman, N., et al.: Tissue Classification with Gene Expression Profiles. Computational Biology 7, 559–584 (2000)

    Article  Google Scholar 

  3. Jaeger, J., Sengupta, R., Ruzzo, W.L.: Improved gene selection for classification of microarrays. In: Pacific Symposium on Biocomputing, pp. 53–64 (2003)

    Google Scholar 

  4. Blum, A., Langley, P.: Selection of relevant features and examples in machine learning. Artificial Intelligence 97, 245–271 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  5. Kohavi, R., John, G.H.: Wrappers for feature subset selection. Artificial Intelligence 97, 273–324 (1997)

    Article  MATH  Google Scholar 

  6. Oh, I.S., Lee, J.S., Moon, B.R.: Hybrid genetic algorithms for feature selection. IEEE Transactions on Pattern Analysis and Machine Intelligence 26, 1424–1437 (1982)

    Google Scholar 

  7. Ding, C., Peng, H.: Minimum redundancy feature selection from microarray gene expression data. In: IEEE Computer Society Bioinformatics Conference, pp. 523–529 (2003)

    Google Scholar 

  8. Nguyen, D.V., Rocke, D.M.: Multi-class cancer classification via partial least squares with gene expression profiles. Bioinformatics 18, 1216–1226 (2002)

    Article  Google Scholar 

  9. Pawlak, Z.: Rough sets: present state and the future. Foundations of Computing and Decision Sciences 18, 157–166 (1993)

    MATH  MathSciNet  Google Scholar 

  10. Quafafou, M., Boussouf, M.: Generalized rough sets based feature selection. Intelligent Data Analysis 4, 3–17 (2000)

    MATH  Google Scholar 

  11. Han, J.C., Hu, X.H., Lin, T.Y.: Feature Subset Selection Based on Relative Dependency of Attributes[C]. In: Rough Sets and Current Trends in Computing: 4th International Conference, Uppsala, Sweden, pp. 176–185 (2004)

    Google Scholar 

  12. Kohavi, R., Frasca, B.: Useful feature subset and rough set reducts. In: Proceedings of the Third International Workshop on Rough Sets and Soft Computing, pp. 310–317 (1994)

    Google Scholar 

  13. Torgeir, R.H., Bartosz, W., Andriy, K., Jerzy, T., Jan, K., Krzysztof, F.: Discovering regulatory binding-site modules using rule-based learning. Genome Research 11, 855–865 (2005)

    Google Scholar 

  14. Alon, U., Barkai, N., Notterman, D.A., Gish, K., Ybarra, S., Mack, D., Levine, A.J.: Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays. Proc. Natl. Acad. Sci. 96, 6745–6750 (1998)

    Article  Google Scholar 

  15. Stefano, M., Pablo, T., Jill, M., Todd, G.: A resampling-based method for class discovery and visualization of gene expression microarray data. Machine Learning Journal 52, 91–118 (2003)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, D., Zhang, W. (2006). Gene Selection Using Rough Set Theory. In: Wang, GY., Peters, J.F., Skowron, A., Yao, Y. (eds) Rough Sets and Knowledge Technology. RSKT 2006. Lecture Notes in Computer Science(), vol 4062. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11795131_113

Download citation

  • DOI: https://doi.org/10.1007/11795131_113

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36297-5

  • Online ISBN: 978-3-540-36299-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics