{"id":"https://openalex.org/W2347000901","doi":"https://doi.org/10.1162/neco_a_00836","title":"Efficient Nonnegative Matrix Factorization by DC Programming and DCA","display_name":"Efficient Nonnegative Matrix Factorization by DC Programming and DCA","publication_year":2016,"publication_date":"2016-05-03","ids":{"openalex":"https://openalex.org/W2347000901","doi":"https://doi.org/10.1162/neco_a_00836","mag":"2347000901","pmid":"https://pubmed.ncbi.nlm.nih.gov/27136704"},"language":"en","primary_location":{"id":"doi:10.1162/neco_a_00836","is_oa":false,"landing_page_url":"https://doi.org/10.1162/neco_a_00836","pdf_url":null,"source":{"id":"https://openalex.org/S207023548","display_name":"Neural Computation","issn_l":"0899-7667","issn":["0899-7667","1530-888X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Neural Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"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/A5042936176","display_name":"Hoai An Le Thi","orcid":"https://orcid.org/0000-0002-2239-2100"},"institutions":[{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]},{"id":"https://openalex.org/I141445968","display_name":"Ton Duc Thang University","ror":"https://ror.org/01drq0835","country_code":"VN","type":"education","lineage":["https://openalex.org/I141445968"]}],"countries":["FR","VN"],"is_corresponding":true,"raw_author_name":"Hoai An Le Thi","raw_affiliation_strings":["Department for Management of Science and Technology Development and Faculty of Mathematics and Statistics, Ton Duc Thang University, Ho Chi Minh City, Vietnam, and Laboratory of Theoretical and Applied Computer Science EA 3097, University of Lorraine, Ile du Saulcy, 57045 Metz, France"],"affiliations":[{"raw_affiliation_string":"Department for Management of Science and Technology Development and Faculty of Mathematics and Statistics, Ton Duc Thang University, Ho Chi Minh City, Vietnam, and Laboratory of Theoretical and Applied Computer Science EA 3097, University of Lorraine, Ile du Saulcy, 57045 Metz, France","institution_ids":["https://openalex.org/I141445968","https://openalex.org/I90183372"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089558322","display_name":"Xuan Thanh Vo","orcid":"https://orcid.org/0000-0001-9147-724X"},"institutions":[{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Xuan Thanh Vo","raw_affiliation_strings":["Laboratory of Theoretical and Applied Computer Science EA 3097, University of Lorraine, Ile du Saulcy, 57045 Metz, France"],"affiliations":[{"raw_affiliation_string":"Laboratory of Theoretical and Applied Computer Science EA 3097, University of Lorraine, Ile du Saulcy, 57045 Metz, France","institution_ids":["https://openalex.org/I90183372"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101473027","display_name":"Tao Pham Dinh","orcid":"https://orcid.org/0000-0002-2711-2163"},"institutions":[{"id":"https://openalex.org/I88814501","display_name":"Institut National des Sciences Appliqu\u00e9es Rouen Normandie","ror":"https://ror.org/020ws7586","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918","https://openalex.org/I88814501"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Tao Pham Dinh","raw_affiliation_strings":["Laboratory of Mathematics, INSA\u2013Rouen, University of Normandie, 76801 Saint-Etienne-du-Rouvray Cedex, France"],"affiliations":[{"raw_affiliation_string":"Laboratory of Mathematics, INSA\u2013Rouen, University of Normandie, 76801 Saint-Etienne-du-Rouvray Cedex, France","institution_ids":["https://openalex.org/I88814501"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042936176"],"corresponding_institution_ids":["https://openalex.org/I141445968","https://openalex.org/I90183372"],"apc_list":null,"apc_paid":null,"fwci":2.7375,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.8881716,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"28","issue":"6","first_page":"1163","last_page":"1216"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9947999715805054,"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/T12303","display_name":"Tensor decomposition and applications","score":0.9868000149726868,"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.9482589364051819},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5459039807319641},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5399287939071655},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.46899107098579407},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.42269012331962585},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.38742390275001526},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3873150646686554},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3612831234931946},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3373314440250397},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21563255786895752}],"concepts":[{"id":"https://openalex.org/C152671427","wikidata":"https://www.wikidata.org/wiki/Q10843505","display_name":"Non-negative matrix factorization","level":4,"score":0.9482589364051819},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5459039807319641},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5399287939071655},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.46899107098579407},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.42269012331962585},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.38742390275001526},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3873150646686554},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3612831234931946},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3373314440250397},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21563255786895752},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1162/neco_a_00836","is_oa":false,"landing_page_url":"https://doi.org/10.1162/neco_a_00836","pdf_url":null,"source":{"id":"https://openalex.org/S207023548","display_name":"Neural Computation","issn_l":"0899-7667","issn":["0899-7667","1530-888X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Neural Computation","raw_type":"journal-article"},{"id":"pmid:27136704","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/27136704","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Neural computation","raw_type":null},{"id":"pmh:oai:HAL:hal-01616987v1","is_oa":false,"landing_page_url":"https://hal.univ-lorraine.fr/hal-01616987","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Neural Computation, 2016, 28 (6), pp.1163 - 1216. ⟨10.1162/NECO_a_00836⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":61,"referenced_works":["https://openalex.org/W72893484","https://openalex.org/W88153722","https://openalex.org/W187184694","https://openalex.org/W1132721502","https://openalex.org/W1246381107","https://openalex.org/W1491548974","https://openalex.org/W1565987865","https://openalex.org/W1594523130","https://openalex.org/W1692592558","https://openalex.org/W1902027874","https://openalex.org/W1966881610","https://openalex.org/W1974136583","https://openalex.org/W1976391658","https://openalex.org/W1979657638","https://openalex.org/W1981276685","https://openalex.org/W1984754588","https://openalex.org/W1987423550","https://openalex.org/W1989830207","https://openalex.org/W1990494141","https://openalex.org/W1991380130","https://openalex.org/W2017288758","https://openalex.org/W2021974038","https://openalex.org/W2026034143","https://openalex.org/W2037164175","https://openalex.org/W2042476838","https://openalex.org/W2044297353","https://openalex.org/W2051664786","https://openalex.org/W2056385679","https://openalex.org/W2057797006","https://openalex.org/W2059745395","https://openalex.org/W2066651522","https://openalex.org/W2068726766","https://openalex.org/W2073389244","https://openalex.org/W2076566842","https://openalex.org/W2089343684","https://openalex.org/W2093492509","https://openalex.org/W2105431676","https://openalex.org/W2108840817","https://openalex.org/W2110096996","https://openalex.org/W2113359929","https://openalex.org/W2116216716","https://openalex.org/W2117513548","https://openalex.org/W2118718620","https://openalex.org/W2122929847","https://openalex.org/W2124172487","https://openalex.org/W2132538571","https://openalex.org/W2148365208","https://openalex.org/W2155151262","https://openalex.org/W2165685007","https://openalex.org/W2167686991","https://openalex.org/W2168103112","https://openalex.org/W2168446235","https://openalex.org/W2340859457","https://openalex.org/W2404400936","https://openalex.org/W2507840378","https://openalex.org/W2963769561","https://openalex.org/W2990138404","https://openalex.org/W2999905431","https://openalex.org/W3122703110","https://openalex.org/W3143596294","https://openalex.org/W4248027363"],"related_works":["https://openalex.org/W2127243424","https://openalex.org/W2037504162","https://openalex.org/W4390394189","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":{"In":[0],"this":[1],"letter,":[2],"we":[3],"consider":[4],"the":[5,35,59,77,81,91,120,123,127,131,134,138,161],"nonnegative":[6,121,186],"matrix":[7],"factorization":[8],"(NMF)":[9],"problem":[10],"and":[11,25,100,137,170],"several":[12,148],"NMF":[13,82,93,117,153],"variants.":[14],"Two":[15,95],"approaches":[16,163],"based":[17],"on":[18,90,167],"DC":[19,70],"(difference":[20],"of":[21,58,76,160],"convex":[22],"functions)":[23],"programming":[24],"DCA":[26,89],"(DC":[27],"algorithm)":[28],"are":[29,53,111],"developed.":[30],"The":[31,55,84,108,158],"first":[32],"approach":[33,86],"follows":[34],"alternating":[36,185],"framework":[37],"that":[38,67,144,177],"requires":[39],"solving,":[40],"at":[41],"each":[42],"iteration,":[43],"two":[44],"nonnegativity-constrained":[45],"least":[46,187],"squares":[47,188],"subproblems":[48],"for":[49,80,151],"which":[50],"DCA-based":[51],"schemes":[52],"investigated.":[54],"convergence":[56],"property":[57],"proposed":[60,109,162],"algorithm":[61,73],"is":[62,164],"carefully":[63],"studied.":[64],"We":[65,141],"show":[66,143],"with":[68,182],"suitable":[69],"decompositions,":[71],"our":[72,145,178],"generates":[74],"most":[75],"standard":[78],"methods":[79,110,150],"problem.":[83,94],"second":[85],"directly":[87],"applies":[88],"whole":[92],"algorithms-one":[96],"computing":[97],"all":[98],"variables":[99],"one":[101],"deploying":[102],"a":[103],"variable":[104],"selection":[105],"strategy-are":[106],"proposed.":[107],"then":[112],"adapted":[113],"to":[114],"solve":[115],"various":[116],"variants,":[118],"including":[119],"factorization,":[122],"smooth":[124],"regularization":[125,129],"NMF,":[126,130,133,136],"sparse":[128],"multilayer":[132],"convex/convex-hull":[135],"symmetric":[139],"NMF.":[140],"also":[142],"algorithms":[146,179],"include":[147],"existing":[149],"these":[152],"variants":[154],"as":[155],"special":[156],"versions.":[157],"efficiency":[159],"empirically":[165],"demonstrated":[166],"both":[168],"real-world":[169],"synthetic":[171],"data":[172],"sets.":[173],"It":[174],"turns":[175],"out":[176],"compete":[180],"favorably":[181],"five":[183],"state-of-the-art":[184],"algorithms.":[189]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}