Convex matrix factorization for gene expression analysis
Name
55693287-MIT.pdf
Description
Full printable version
Size
2.18 MB
Format
Adobe PDF
Checksum (MD5)
8d6b23670e757ff8e308b4cc1fb4bec4
Author(s)
Barnett, John D. (John Derek), 1970-
Advisor(s)
Tommi S. Jaakkola.
Alternative Title
CMF for gene expression analysis
Date Issued
2004
Publisher
Massachusetts Institute of Technology
Abstract
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.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Includes bibliographical references (p. 68-71).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
Persistent DSpace Link
