Pareto-Optimal Methods for Gene Ranking
dc.contributor.author | Hero, Alfred O. III | en_US |
dc.contributor.author | Fleury, Gilles | en_US |
dc.date.accessioned | 2006-09-08T19:09:01Z | |
dc.date.available | 2006-09-08T19:09:01Z | |
dc.date.issued | 2004-11 | en_US |
dc.identifier.citation | Hero, Alfred O.; Fleury, Gilles; (2004). "Pareto-Optimal Methods for Gene Ranking." The Journal of VLSI Signal Processing 38(3): 259-275. <http://hdl.handle.net/2027.42/41339> | en_US |
dc.identifier.issn | 0922-5773 | en_US |
dc.identifier.issn | 1573-109X | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/41339 | |
dc.description.abstract | The massive scale and variability of microarray gene data creates new and challenging problems of signal extraction, gene clustering, and data mining, especially for temporal gene profiles. Many data mining methods for finding interesting gene expression patterns are based on thresholding single discriminants, e.g. the ratio of between-class to within-class variation or correlation to a template. Here a different approach is introduced for extracting information from gene microarrays. The approach is based on multiple objective optimization and we call it Pareto front analysis (PFA). This method establishes a ranking of genes according to estimated probabilities that each gene is Pareto-optimal, i.e., that it lies on the Pareto front of the multiple objective scattergram. Both a model-driven Bayesian Pareto method and a data-driven non-parametric Pareto method, based on rank-order statistics, are presented. The methods are illustrated for two gene microarray experiments. | en_US |
dc.format.extent | 830581 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Kluwer Academic Publishers; Springer Science+Business Media | en_US |
dc.subject.other | Engineering | en_US |
dc.subject.other | Electronic and Computer Engineering | en_US |
dc.subject.other | Signal, Image and Speech Processing | en_US |
dc.subject.other | Circuits and Systems | en_US |
dc.subject.other | Gene Filtering | en_US |
dc.subject.other | Gene Screening | en_US |
dc.subject.other | Multicriterion Scattergram | en_US |
dc.subject.other | Data Mining | en_US |
dc.subject.other | Posterior Pareto Fronts | en_US |
dc.title | Pareto-Optimal Methods for Gene Ranking | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Computer Science | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of EECS, University of Michigan, Ann Arbor, MI, USA | en_US |
dc.contributor.affiliationother | Ecole Supérieure d'Electricité, Gif-sur-Yvette, France | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/41339/1/11265_2005_Article_5273219.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1023/B:VLSI.0000042491.03225.cf | en_US |
dc.identifier.source | The Journal of VLSI Signal Processing | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.