{"id":"https://openalex.org/W3121908401","doi":"https://doi.org/10.1137/20m1378971","title":"A Sampling Algorithm to Compute the Set of Feasible Solutions for NonNegative Matrix Factorization with an Arbitrary Rank","display_name":"A Sampling Algorithm to Compute the Set of Feasible Solutions for NonNegative Matrix Factorization with an Arbitrary Rank","publication_year":2022,"publication_date":"2022-02-22","ids":{"openalex":"https://openalex.org/W3121908401","doi":"https://doi.org/10.1137/20m1378971","mag":"3121908401"},"language":"en","primary_location":{"id":"doi:10.1137/20m1378971","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1378971","pdf_url":null,"source":{"id":"https://openalex.org/S16958353","display_name":"SIAM Journal on Matrix Analysis and Applications","issn_l":"0895-4798","issn":["0895-4798","1095-7162"],"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 Matrix Analysis and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://arxiv.org/pdf/2101.07526.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015309944","display_name":"Ragnhild Laursen","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Ragnhild Laursen","raw_affiliation_strings":["Department of Mathematics, Aarhus University"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Aarhus University","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076669546","display_name":"Asger Hobolth","orcid":"https://orcid.org/0000-0003-4056-1286"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Asger Hobolth","raw_affiliation_strings":["Department of Mathematics, Aarhus University"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Aarhus University","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015309944"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":null,"apc_paid":null,"fwci":0.6078,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.62888564,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":"43","issue":"1","first_page":"257","last_page":"273"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10885","display_name":"Gene expression and cancer classification","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T10885","display_name":"Gene expression and cancer classification","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10222","display_name":"Genomics and Chromatin Dynamics","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11468","display_name":"Genetic Mapping and Diversity in Plants and Animals","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/non-negative-matrix-factorization","display_name":"Non-negative matrix factorization","score":0.8219208717346191},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.6416465044021606},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.5828555822372437},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5714672207832336},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5567806363105774},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.5450648665428162},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.525139331817627},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.4282689094543457},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4280989170074463},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33239948749542236},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15935635566711426}],"concepts":[{"id":"https://openalex.org/C152671427","wikidata":"https://www.wikidata.org/wiki/Q10843505","display_name":"Non-negative matrix factorization","level":4,"score":0.8219208717346191},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6416465044021606},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.5828555822372437},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5714672207832336},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5567806363105774},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.5450648665428162},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.525139331817627},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.4282689094543457},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4280989170074463},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33239948749542236},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15935635566711426},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","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/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/20m1378971","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1378971","pdf_url":null,"source":{"id":"https://openalex.org/S16958353","display_name":"SIAM Journal on Matrix Analysis and Applications","issn_l":"0895-4798","issn":["0895-4798","1095-7162"],"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 Matrix Analysis and Applications","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/8ec6e2ac-60c4-447f-aa8f-15ba5da67e41","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/8ec6e2ac-60c4-447f-aa8f-15ba5da67e41","pdf_url":"https://arxiv.org/pdf/2101.07526.pdf","source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Laursen, R & Hobolth, A 2022, 'A Sampling Algorithm to Compute the Set of Feasible Solutions for NonNegative Matrix Factorization with an Arbitrary Rank', SIAM Journal on Matrix Analysis and Applications, vol. 43, no. 1, pp. 257-273. https://doi.org/10.1137/20M1378971","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/8ec6e2ac-60c4-447f-aa8f-15ba5da67e41","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/8ec6e2ac-60c4-447f-aa8f-15ba5da67e41","pdf_url":"https://arxiv.org/pdf/2101.07526.pdf","source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Laursen, R & Hobolth, A 2022, 'A Sampling Algorithm to Compute the Set of Feasible Solutions for NonNegative Matrix Factorization with an Arbitrary Rank', SIAM Journal on Matrix Analysis and Applications, vol. 43, no. 1, pp. 257-273. https://doi.org/10.1137/20M1378971","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.4699999988079071,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3121908401.pdf","grobid_xml":"https://content.openalex.org/works/W3121908401.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W1511627810","https://openalex.org/W1586356005","https://openalex.org/W1595863776","https://openalex.org/W1972326413","https://openalex.org/W1988890359","https://openalex.org/W2008255210","https://openalex.org/W2016913783","https://openalex.org/W2022119055","https://openalex.org/W2048687561","https://openalex.org/W2070135644","https://openalex.org/W2083875149","https://openalex.org/W2124172487","https://openalex.org/W2126210866","https://openalex.org/W2129280250","https://openalex.org/W2140318696","https://openalex.org/W2152061559","https://openalex.org/W2158065648","https://openalex.org/W2237760025","https://openalex.org/W2512945549","https://openalex.org/W2566022181","https://openalex.org/W2621170119","https://openalex.org/W2808027454","https://openalex.org/W2941706436","https://openalex.org/W2953163445","https://openalex.org/W3143596294"],"related_works":["https://openalex.org/W2127243424","https://openalex.org/W4390394189","https://openalex.org/W2037504162","https://openalex.org/W2539013788","https://openalex.org/W2792706544","https://openalex.org/W1568451138","https://openalex.org/W2156699640","https://openalex.org/W2045265907","https://openalex.org/W2972997031","https://openalex.org/W34555840"],"abstract_inverted_index":{"Nonnegative":[0],"matrix":[1],"factorization":[2],"(NMF)":[3],"is":[4,21,49,57,79,96,101,114,150,180],"a":[5,32,87,167,175],"useful":[6],"method":[7],"to":[8,43,59,103,107,117,132,144,154],"extract":[9],"features":[10],"from":[11],"multivariate":[12],"data,":[13,85],"but":[14],"an":[15,108],"important":[16],"and":[17,86,105],"sometimes":[18],"neglected":[19],"concern":[20],"that":[22,91,139,149],"NMF":[23,56,124],"can":[24,92,165],"result":[25],"in":[26,52,67,115,152,182],"nonunique":[27],"solutions.":[28],"Often,":[29],"there":[30],"exist":[31],"set":[33],"of":[34,70,77,111,119,162,174],"feasible":[35],"solutions":[36],"(SFS),":[37],"which":[38],"makes":[39],"it":[40],"more":[41],"difficult":[42],"interpret":[44],"the":[45,63,68,75,94,120,123,145,160,163,171,183],"factorization.":[46],"This":[47,113],"problem":[48],"especially":[50],"ignored":[51],"cancer":[53],"genomics,":[54],"where":[55,122],"used":[58],"infer":[60],"information":[61],"about":[62],"mutational":[64,83],"processes":[65],"present":[66],"evolution":[69],"cancer.":[71],"In":[72],"this":[73],"paper":[74],"extent":[76],"nonuniqueness":[78],"investigated":[80],"for":[81],"two":[82],"counts":[84],"new":[88],"sampling":[89,99,178],"algorithm":[90,100,141,148,179],"find":[93],"SFS":[95,164,186],"introduced.":[97],"Our":[98,177],"easy":[102],"implement":[104],"applies":[106],"arbitrary":[109],"rank":[110,125],"NMF.":[112],"contrast":[116],"state":[118],"art,":[121],"must":[126],"be":[127],"smaller":[128],"than":[129],"or":[130],"equal":[131],"four.":[133],"For":[134],"lower":[135],"ranks":[136],"we":[137,157],"show":[138,158],"our":[140],"performs":[142],"similar":[143],"polygon":[146],"inflation":[147],"developed":[151],"relation":[153],"chemometrics.":[155],"Furthermore,":[156],"how":[159],"size":[161],"have":[166],"high":[168],"influence":[169],"on":[170],"appearing":[172],"variability":[173],"solution.":[176],"implemented":[181],"R":[184],"package":[185],"(https://github.com/ragnhildlaursen/SFS).":[187]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2}],"updated_date":"2026-03-13T16:22:10.518609","created_date":"2025-10-10T00:00:00"}