Abstract
This paper presents an application of machine learning algorithms based on inductive learning by logic minimization to the analysis of gene expression data. The characteristic properties of these data are a very large number of attributes (genes) and a relatively small number of examples (samples). Approaches to gene set reduction and to the detection of important disease markers are described. The results obtained on two well known publicly available gene expression classification problems are presented.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Gamberger, D., Lavrač, N.: Expert-guided subgroup discovery: Methodology and application. Journal of Artficial Intelligence Research 17, 501–527 (2002)
Golub, T.R., et al.: Molecular classification of cancer: Class discovery and class prediction by gene expression monitoring. Science 286, 531–537 (1999)
Lavrač, N., Gamberger, D., Turney, P.: A relevancy filter for constructive induction. IEEE Intelligent Systems & Their Applications 13, 50–56 (1997)
Li, J., Wong, L.: Geography of differences between two classes of data. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol. 2431, pp. 325–337. Springer, Heidelberg (2002)
Ramaswamy, S., et al.: Multiclass cancer diagnosis using tumor gene expression signitures. Proc. Natl. Acad. Sci USA 98(26), 15149–15154 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gamberger, D., Lavrač, N. (2003). Analysis of Gene Expression Data by the Logic Minimization Approach. In: Dojat, M., Keravnou, E.T., Barahona, P. (eds) Artificial Intelligence in Medicine. AIME 2003. Lecture Notes in Computer Science(), vol 2780. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39907-0_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-39907-0_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20129-8
Online ISBN: 978-3-540-39907-0
eBook Packages: Springer Book Archive