{"id":"https://openalex.org/W2093492509","doi":"https://doi.org/10.1137/110821172","title":"Fast Nonnegative Matrix Factorization: An Active-Set-Like Method and Comparisons","display_name":"Fast Nonnegative Matrix Factorization: An Active-Set-Like Method and Comparisons","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2093492509","doi":"https://doi.org/10.1137/110821172","mag":"2093492509"},"language":"en","primary_location":{"id":"doi:10.1137/110821172","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110821172","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019788649","display_name":"Jingu Kim","orcid":"https://orcid.org/0000-0002-6446-0108"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jingu Kim","raw_affiliation_strings":["jingu@cc.gatech.edu and hpark@cc.gatech.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"jingu@cc.gatech.edu and hpark@cc.gatech.edu#TAB#","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101728710","display_name":"Haesun Park","orcid":"https://orcid.org/0000-0001-6259-7170"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Haesun Park","raw_affiliation_strings":["School of Computational Science and Engineering, College of Computing, Georgia Institute of Technology, Atlanta, GA, 30332"],"affiliations":[{"raw_affiliation_string":"School of Computational Science and Engineering, College of Computing, Georgia Institute of Technology, Atlanta, GA, 30332","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101728710"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":24.9994,"has_fulltext":false,"cited_by_count":338,"citation_normalized_percentile":{"value":0.99768331,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"33","issue":"6","first_page":"3261","last_page":"3281"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9861000180244446,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9861000180244446,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.9629999995231628,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9355000257492065,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/coordinate-descent","display_name":"Coordinate descent","score":0.8353977799415588},{"id":"https://openalex.org/keywords/non-negative-matrix-factorization","display_name":"Non-negative matrix factorization","score":0.8262739181518555},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5365156531333923},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5306305885314941},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5109695196151733},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4788641631603241},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4588587284088135},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.45562222599983215},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43521809577941895},{"id":"https://openalex.org/keywords/least-squares-function-approximation","display_name":"Least-squares function approximation","score":0.42524275183677673},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41757553815841675},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.38580644130706787},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3278336822986603}],"concepts":[{"id":"https://openalex.org/C157553263","wikidata":"https://www.wikidata.org/wiki/Q5168004","display_name":"Coordinate descent","level":2,"score":0.8353977799415588},{"id":"https://openalex.org/C152671427","wikidata":"https://www.wikidata.org/wiki/Q10843505","display_name":"Non-negative matrix factorization","level":4,"score":0.8262739181518555},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5365156531333923},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5306305885314941},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5109695196151733},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4788641631603241},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4588587284088135},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.45562222599983215},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43521809577941895},{"id":"https://openalex.org/C9936470","wikidata":"https://www.wikidata.org/wiki/Q6510405","display_name":"Least-squares function approximation","level":3,"score":0.42524275183677673},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41757553815841675},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.38580644130706787},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3278336822986603},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/110821172","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110821172","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.419.798","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.419.798","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cc.gatech.edu/~hpark/papers/SISC_082117RR_Kim_Park.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"id":"https://metadata.un.org/sdg/12","display_name":"Responsible consumption and production"}],"awards":[{"id":"https://openalex.org/G2121570933","display_name":"MSPA-MCS: Collaborative Research: Fast Nonnegative Matrix Factorizations: Theory, Algorithms, and Applications","funder_award_id":"0732318","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2493981525","display_name":null,"funder_award_id":"CCF-0808863","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G798061573","display_name":"FODAVA-Lead: Dimension Reduction and Data Reduction: Foundations for Visualization","funder_award_id":"0808863","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309036","display_name":"Purdue University","ror":"https://ror.org/02dqehb95"},{"id":"https://openalex.org/F4320332195","display_name":"Samsung","ror":"https://ror.org/04w3jy968"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W88153722","https://openalex.org/W206759535","https://openalex.org/W1246381107","https://openalex.org/W1491548974","https://openalex.org/W1594523130","https://openalex.org/W1882755666","https://openalex.org/W1902027874","https://openalex.org/W1976391658","https://openalex.org/W1991870281","https://openalex.org/W2013029404","https://openalex.org/W2017288758","https://openalex.org/W2026034143","https://openalex.org/W2048584787","https://openalex.org/W2056857971","https://openalex.org/W2059745395","https://openalex.org/W2075665712","https://openalex.org/W2076566842","https://openalex.org/W2082639035","https://openalex.org/W2098098075","https://openalex.org/W2106789617","https://openalex.org/W2110096996","https://openalex.org/W2117513548","https://openalex.org/W2120816706","https://openalex.org/W2124172487","https://openalex.org/W2132692097","https://openalex.org/W2135029798","https://openalex.org/W2135046866","https://openalex.org/W2136171036","https://openalex.org/W2136787567","https://openalex.org/W2165685007","https://openalex.org/W2168446235","https://openalex.org/W2482276862","https://openalex.org/W2497464837","https://openalex.org/W3143596294","https://openalex.org/W4245456352"],"related_works":["https://openalex.org/W2022712430","https://openalex.org/W2127243424","https://openalex.org/W2037504162","https://openalex.org/W2792706544","https://openalex.org/W1568451138","https://openalex.org/W2539013788","https://openalex.org/W2156699640","https://openalex.org/W2045265907","https://openalex.org/W2972997031","https://openalex.org/W2075222291"],"abstract_inverted_index":{"Nonnegative":[0],"matrix":[1],"factorization":[2],"(NMF)":[3],"is":[4,56],"a":[5,33,57,81,109],"dimension":[6],"reduction":[7],"method":[8,100,126],"that":[9,107,119,159,172],"has":[10],"been":[11,43],"widely":[12],"used":[13],"for":[14,29,62,84,101],"numerous":[15],"applications,":[16],"including":[17],"text":[18],"mining,":[19],"computer":[20],"vision,":[21],"pattern":[22],"discovery,":[23],"and":[24,37,73,143],"bioinformatics.":[25],"A":[26],"mathematical":[27],"formulation":[28],"NMF":[30,85,131,151],"appears":[31],"as":[32,165,167],"nonconvex":[34],"optimization":[35],"problem,":[36],"various":[38],"types":[39],"of":[40,111,130,139,181],"algorithms":[41],"have":[42],"devised":[44],"to":[45,69,148],"solve":[46],"the":[47,88,96,102,112,122,128,136,140,173],"problem.":[48],"The":[49],"alternating":[50],"nonnegative":[51],"least":[52,104],"squares":[53,105],"(ANLS)":[54],"framework":[55,142],"block":[58,97,123],"coordinate":[59],"descent":[60],"approach":[61],"solving":[63],"NMF,":[64],"which":[65],"was":[66],"recently":[67],"shown":[68],"be":[70,146],"theoretically":[71],"sound":[72],"empirically":[74],"efficient.":[75],"In":[76],"this":[77],"paper,":[78],"we":[79],"present":[80],"novel":[82],"algorithm":[83,93,134,175],"based":[86],"on":[87],"ANLS":[89,141],"framework.":[90],"Our":[91,133],"new":[92],"builds":[94],"upon":[95],"principal":[98,124],"pivoting":[99,125],"nonnegativity-constrained":[103],"problem":[106],"overcomes":[108],"limitation":[110],"active":[113],"set":[114],"method.":[115],"We":[116],"introduce":[117],"ideas":[118],"efficiently":[120],"extend":[121],"within":[127],"context":[129],"computation.":[132],"inherits":[135],"convergence":[137],"property":[138],"can":[144],"easily":[145],"extended":[147],"other":[149],"constrained":[150],"formulations.":[152],"Extensive":[153],"computational":[154,182],"comparisons":[155],"using":[156],"data":[157],"sets":[158],"are":[160],"from":[161],"real":[162],"life":[163],"applications":[164],"well":[166],"those":[168],"artificially":[169],"generated":[170],"show":[171],"proposed":[174],"provides":[176],"state-of-the-art":[177],"performance":[178],"in":[179],"terms":[180],"speed.":[183]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":13},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":20},{"year":2021,"cited_by_count":22},{"year":2020,"cited_by_count":32},{"year":2019,"cited_by_count":29},{"year":2018,"cited_by_count":39},{"year":2017,"cited_by_count":33},{"year":2016,"cited_by_count":27},{"year":2015,"cited_by_count":27},{"year":2014,"cited_by_count":34},{"year":2013,"cited_by_count":19},{"year":2012,"cited_by_count":17}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}
