{"id":"https://openalex.org/W7140360121","doi":"https://doi.org/10.48550/arxiv.2603.24227","title":"Identification of NMF by choosing maximum-volume basis vectors","display_name":"Identification of NMF by choosing maximum-volume basis vectors","publication_year":2026,"publication_date":"2026-03-25","ids":{"openalex":"https://openalex.org/W7140360121","doi":"https://doi.org/10.48550/arxiv.2603.24227"},"language":"en","primary_location":{"id":"pmh:oai:eprints.soton.ac.uk:510769","is_oa":true,"landing_page_url":null,"pdf_url":"https://eprints.soton.ac.uk/510769/1/2603.24227v1.pdf","source":{"id":"https://openalex.org/S4306401019","display_name":"ePrints Soton (University of Southampton)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I43439940","host_organization_name":"University of Southampton","host_organization_lineage":["https://openalex.org/I43439940"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"NonPeerReviewed"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://eprints.soton.ac.uk/510769/1/2603.24227v1.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101620144","display_name":"Qianqian Qi","orcid":"https://orcid.org/0000-0003-1058-476X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Qi, Qianqian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102000998","display_name":"Zhongming Chen","orcid":"https://orcid.org/0000-0002-7495-1365"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Zhongming","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5083267743","display_name":"PETER G. M. VAN DER HEIJDEN","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"van der Heijden, Peter G. M.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.4120999872684479,"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"}},"topics":[{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.4120999872684479,"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/T11034","display_name":"Digital Filter Design and Implementation","score":0.05689999833703041,"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"}},{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.054099999368190765,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/non-negative-matrix-factorization","display_name":"Non-negative matrix factorization","score":0.8977000117301941},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.7843999862670898},{"id":"https://openalex.org/keywords/identifiability","display_name":"Identifiability","score":0.7299000024795532},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.5795999765396118},{"id":"https://openalex.org/keywords/identification","display_name":"Identification (biology)","score":0.5200999975204468},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.5171999931335449}],"concepts":[{"id":"https://openalex.org/C152671427","wikidata":"https://www.wikidata.org/wiki/Q10843505","display_name":"Non-negative matrix factorization","level":4,"score":0.8977000117301941},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.7843999862670898},{"id":"https://openalex.org/C122770356","wikidata":"https://www.wikidata.org/wiki/Q1656753","display_name":"Identifiability","level":2,"score":0.7299000024795532},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.5795999765396118},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5526999831199646},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.5200999975204468},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.5171999931335449},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.491100013256073},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45809999108314514},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34769999980926514},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.34139999747276306},{"id":"https://openalex.org/C5917680","wikidata":"https://www.wikidata.org/wiki/Q2621825","display_name":"Basis function","level":2,"score":0.31520000100135803},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.3111000061035156},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.28189998865127563},{"id":"https://openalex.org/C110083411","wikidata":"https://www.wikidata.org/wiki/Q1744628","display_name":"Statistical classification","level":2,"score":0.2508000135421753}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:eprints.soton.ac.uk:510769","is_oa":true,"landing_page_url":null,"pdf_url":"https://eprints.soton.ac.uk/510769/1/2603.24227v1.pdf","source":{"id":"https://openalex.org/S4306401019","display_name":"ePrints Soton (University of Southampton)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I43439940","host_organization_name":"University of Southampton","host_organization_lineage":["https://openalex.org/I43439940"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"NonPeerReviewed"},{"id":"doi:10.48550/arxiv.2603.24227","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.24227","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:eprints.soton.ac.uk:510769","is_oa":true,"landing_page_url":null,"pdf_url":"https://eprints.soton.ac.uk/510769/1/2603.24227v1.pdf","source":{"id":"https://openalex.org/S4306401019","display_name":"ePrints Soton (University of Southampton)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I43439940","host_organization_name":"University of Southampton","host_organization_lineage":["https://openalex.org/I43439940"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"NonPeerReviewed"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7140360121.pdf","grobid_xml":"https://content.openalex.org/works/W7140360121.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"nonnegative":[1],"matrix":[2],"factorization":[3],"(NMF),":[4],"minimum-volume-constrained":[5,41,61],"NMF":[6,17,42,62,90,112],"is":[7],"a":[8,88],"widely":[9],"used":[10],"framework":[11],"for":[12,45,110],"identifying":[13],"the":[14,31,56,74,97,123,126],"solution":[15],"of":[16,73,125],"by":[18],"making":[19],"basis":[20,58,77,98],"vectors":[21,59,99],"as":[22,24,68,100,102],"similar":[23],"possible.":[25,103],"This":[26],"typically":[27],"induces":[28],"sparsity":[29,51],"in":[30,60,83],"coefficient":[32],"matrix,":[33],"with":[34],"each":[35],"row":[36],"containing":[37],"zero":[38],"entries.":[39],"Consequently,":[40],"may":[43,63,70],"fail":[44],"highly":[46],"mixed":[47],"data,":[48],"where":[49],"such":[50],"does":[52],"not":[53],"hold.":[54],"Moreover,":[55],"estimated":[57],"be":[64,71],"difficult":[65],"to":[66,117],"interpret":[67],"they":[69],"mixtures":[72],"ground":[75],"truth":[76],"vectors.":[78],"To":[79],"address":[80],"these":[81],"limitations,":[82],"this":[84],"paper":[85],"we":[86],"propose":[87],"new":[89],"framework,":[91],"called":[92],"maximum-volume-constrained":[93,111],"NMF,":[94],"which":[95],"makes":[96],"distinct":[101],"We":[104],"further":[105],"establish":[106],"an":[107,115],"identifiability":[108],"theorem":[109],"and":[113],"provide":[114],"algorithm":[116],"estimate":[118],"it.":[119],"Experimental":[120],"results":[121],"demonstrate":[122],"effectiveness":[124],"proposed":[127],"method.":[128]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-27T00:00:00"}