Convex matrix factorization for gene expression analysis
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/30098 |
| _version_ | 1811097471982501888 |
|---|---|
| author | Barnett, John D. (John Derek), 1970- |
| author2 | Tommi S. Jaakkola. |
| author_facet | Tommi S. Jaakkola. Barnett, John D. (John Derek), 1970- |
| author_sort | Barnett, John D. (John Derek), 1970- |
| collection | MIT |
| description | Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004. |
| first_indexed | 2024-09-23T17:00:02Z |
| format | Thesis |
| id | mit-1721.1/30098 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T17:00:02Z |
| publishDate | 2006 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/300982019-04-12T15:22:21Z Convex matrix factorization for gene expression analysis CMF for gene expression analysis Barnett, John D. (John Derek), 1970- Tommi S. Jaakkola. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004. Includes bibliographical references (p. 68-71). A method is proposed for gene expression analysis relying upon convex matrix factorization (CMF). In CMF, one of the matrix factors has a convexity constraint, that is, each row is nonnegative and sums to one, and hence can be interpreted as a probability distribution. This is motivated biologically by expression data resulting from a mixture of different cell types. This thesis investigates implementing CMF with various constraints applied to the expression matrix, and applies the technique to a problem in analysis of the cell cycle and two problems in cancer classification. by John D. Barnett. S.M. 2006-03-24T18:19:19Z 2006-03-24T18:19:19Z 2004 2004 Thesis http://hdl.handle.net/1721.1/30098 55693287 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 71 p. 2289132 bytes 2288940 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. Barnett, John D. (John Derek), 1970- Convex matrix factorization for gene expression analysis |
| title | Convex matrix factorization for gene expression analysis |
| title_full | Convex matrix factorization for gene expression analysis |
| title_fullStr | Convex matrix factorization for gene expression analysis |
| title_full_unstemmed | Convex matrix factorization for gene expression analysis |
| title_short | Convex matrix factorization for gene expression analysis |
| title_sort | convex matrix factorization for gene expression analysis |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/30098 |
| work_keys_str_mv | AT barnettjohndjohnderek1970 convexmatrixfactorizationforgeneexpressionanalysis AT barnettjohndjohnderek1970 cmfforgeneexpressionanalysis |