{"id":15546,"date":"2014-09-17T10:38:02","date_gmt":"2014-09-17T14:38:02","guid":{"rendered":"http:\/\/www.bu.edu\/systems\/?p=15546"},"modified":"2020-11-11T19:08:17","modified_gmt":"2020-11-12T00:08:17","slug":"mark-crovella-and-evimaria-terzi-awarded-nsf-grant","status":"publish","type":"post","link":"https:\/\/www.bu.edu\/cise\/mark-crovella-and-evimaria-terzi-awarded-nsf-grant\/","title":{"rendered":"Mark Crovella and Evimaria Terzi awarded NSF grant"},"content":{"rendered":"<p class=\"p1\">Professors Mark Crovella (PI) and Evimaria Terzi (co-PI) of the Computer Science Department received a National Science Foundation award entitled \u201cStructural Matrix Completion for Data Mining Applications.\u201d Congratulations to Mark and Evimaria!<\/p>\n<p class=\"p1\"><b>Abstract<\/b><br \/>\nA common problem arising in science and engineering is that a dataset may only be partially measured. Often the complete dataset is naturally expressed as a matrix \u2013 for example, traffic flows in a city, gene expression across a set of treatments, or ratings of movies for users. The matrix completion problem seeks to infer the missing entries of a matrix, under a low-rank assumption. To date, most matrix completion methods do not actually check whether the known entries contain sufficient information to complete the matrix. Recently, however, a new and very different class of \u201cstructural\u201d methods have emerged, which analyze the information content of the visible matrix entries, and so can determine whether accurate completion is possible. From a data mining standpoint, the implications of structural matrix completion methods are largely unexplored. This project will investigate how to leverage structural matrix completion methods to attack a host of data analysis problems, including developing new methods for active matrix completion, new approaches to cross-validating matrix completion results, and new strategies for general matrix completion.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Professors Mark Crovella (PI) and Evimaria Terzi (co-PI) of the Computer Science Department received a National Science Foundation award entitled \u201cStructural Matrix Completion for Data Mining Applications.\u201d Congratulations to Mark and Evimaria! Abstract A common problem arising in science and engineering is that a dataset may only be partially measured. Often the complete dataset is [&hellip;]<\/p>\n","protected":false},"author":1500,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":[],"categories":[26],"tags":[169,177],"_links":{"self":[{"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/posts\/15546"}],"collection":[{"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/users\/1500"}],"replies":[{"embeddable":true,"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/comments?post=15546"}],"version-history":[{"count":1,"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/posts\/15546\/revisions"}],"predecessor-version":[{"id":28663,"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/posts\/15546\/revisions\/28663"}],"wp:attachment":[{"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/media?parent=15546"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/categories?post=15546"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.bu.edu\/cise\/wp-json\/wp\/v2\/tags?post=15546"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}