Document Type


Date of Award

Summer 8-31-2017

Degree Name

Master of Science in Computer Science - (M.S.)


Computer Science

First Advisor

Jason T. L. Wang

Second Advisor

Xiaoning Ding

Third Advisor

Chase Qishi Wu


This thesis investigates matrix completion algorithms with applications in biomedicine, e-commerce and social science. In general, matrix completion algorithms work well for low rank matrices. Such matrices find many applications in recommender systems and social network analysis. On the other hand, biological networks often yield high rank matrices. For example, the adjacency matrix representing interactions between transcription factors and target genes in the cell is a highly sparse matrix, in which most entries correspond to absent interactions and only a few entries correspond to present interactions. This sparse matrix is a high rank or even full rank matrix. Matrix completion algorithms do not work well for high rank matrices. In this thesis, several experiments are conducted to evaluate the performance of matrix completion algorithms for both low rank and high rank matrices. A new high rank matrix completion method is proposed, which is designed to process adjacency matrices representing interactions between transcription factors and target genes in cells.



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.