{"id":{"repo_id":"unm","oai_identifier":"oai:digitalrepository.unm.edu:cs_etds-1040"},"canonical_url":"https://search.dev.ndltd.org/etd/unm/oai:digitalrepository.unm.edu:cs_etds-1040","repository":{"repo_id":"unm","name":"University of New Mexico","base_url":"https://digitalrepository.unm.edu/do/oai/"},"display":{"title":"Matrix Factorization: Nonnegativity, Sparsity and Independence","abstract":"Matrix factorization arises in a wide range of application domains and is useful for extracting the latent features in the dataset. Examples include recommender systems, brain data analysis, and document clustering. In this dissertation, we are interested in matrix factorizations which impose the requirements of nonnegativity, sparsity or independence.","abstract_html":"Matrix factorization arises in a wide range of application domains and is useful for extracting the latent features in the dataset. Examples include recommender systems, brain data analysis, and document clustering. In this dissertation, we are interested in matrix factorizations which impose the requirements of nonnegativity, sparsity or independence.","abstract_has_math":false,"creators":["Potluru, Vamsi"],"institution":null,"degree_name":"Computer Science","degree_level":"Dissertation","degree_discipline":"Department of Computer Science","degree_department":null,"school":null,"contributors":["Hayes, Thomas","Calhoun, Vince","Lane, Terran","Pearlmutter, Barak"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-05-01T07:00:00Z","date_published":"2014-05-01T07:00:00Z","updated_at":"2026-07-24T05:26:00Z","subjects":["Matrix factorization","Nonnegativity","Sparsity","Independence"],"languages":["English"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalrepository.unm.edu/cs_etds/41"],"render_values":[{"text":"https://digitalrepository.unm.edu/cs_etds/41","href":"https://digitalrepository.unm.edu/cs_etds/41","code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/1928/24336","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Hayes, Thomas","Calhoun, Vince","Lane, Terran","Pearlmutter, Barak"]},{"key":"dc:creator","label":"Author","values":["Potluru, Vamsi"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"thesis:degree_discipline","label":"Discipline","values":["Department of Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation","Doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Computer Science"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Matrix factorization","Nonnegativity","Sparsity","Independence"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/1928/24336","https://digitalrepository.unm.edu/cs_etds/41"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Matrix factorization arises in a wide range of application domains and is useful for extracting the latent features in the dataset. Examples include recommender systems, brain data analysis, and document clustering. In this dissertation, we are interested in matrix factorizations which impose the requirements of nonnegativity, sparsity or independence."]},{"key":"dc:title","label":"Title","values":["Matrix Factorization: Nonnegativity, Sparsity and Independence"]}]}],"canonical_facts":{"dc:contributor":["Hayes, Thomas","Calhoun, Vince","Lane, Terran","Pearlmutter, Barak"],"dc:creator":["Potluru, Vamsi"],"dc:description.abstract":["Matrix factorization arises in a wide range of application domains and is useful for extracting the latent features in the dataset. Examples include recommender systems, brain data analysis, and document clustering. In this dissertation, we are interested in matrix factorizations which impose the requirements of nonnegativity, sparsity or independence."],"dc:identifier":["http://hdl.handle.net/1928/24336","https://digitalrepository.unm.edu/cs_etds/41"],"dc:language":["English"],"dc:subject":["Matrix factorization","Nonnegativity","Sparsity","Independence"],"dc:title":["Matrix Factorization: Nonnegativity, Sparsity and Independence"],"thesis:degree_discipline":["Department of Computer Science"],"thesis:degree_level":["Dissertation","Doctoral"],"thesis:degree_name":["Computer Science"]},"updated_at":"2026-07-24T05:26:00Z"}