{"id":"https://openalex.org/W2170293972","doi":"https://doi.org/10.1109/iscas.2008.4541671","title":"Approximate L0 constrained non-negative matrix and tensor factorization","display_name":"Approximate L0 constrained non-negative matrix and tensor factorization","publication_year":2008,"publication_date":"2008-05-01","ids":{"openalex":"https://openalex.org/W2170293972","doi":"https://doi.org/10.1109/iscas.2008.4541671","mag":"2170293972"},"language":"en","primary_location":{"id":"doi:10.1109/iscas.2008.4541671","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2008.4541671","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Circuits and Systems (ISCAS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://orbit.dtu.dk/en/publications/51802a42-aea5-4da9-85cc-2e53a7590977","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059840085","display_name":"Morten M\u00f8rup","orcid":"https://orcid.org/0000-0003-4985-4368"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Morten Morup","raw_affiliation_strings":["Informatics and Mathematical Modelling, Technical University of Denmark, 2800 Kgs Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"Informatics and Mathematical Modelling, Technical University of Denmark, 2800 Kgs Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032991538","display_name":"Kristoffer H. Madsen","orcid":"https://orcid.org/0000-0001-8606-7641"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Kristoffer Hougaard Madsen","raw_affiliation_strings":["Informatics and Mathematical Modelling, Technical University of Denmark, 2800 Kgs Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"Informatics and Mathematical Modelling, Technical University of Denmark, 2800 Kgs Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018292103","display_name":"Lars Kai Hansen","orcid":"https://orcid.org/0000-0003-0442-5877"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Lars Kai Hansen","raw_affiliation_strings":["Informatics and Mathematical Modelling, Technical University of Denmark, 2800 Kgs Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"Informatics and Mathematical Modelling, Technical University of Denmark, 2800 Kgs Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5059840085"],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":null,"apc_paid":null,"fwci":3.7326,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.93708433,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1328","last_page":"1331"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9998999834060669,"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.998199999332428,"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"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9977999925613403,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/non-negative-matrix-factorization","display_name":"Non-negative matrix factorization","score":0.6053229570388794},{"id":"https://openalex.org/keywords/uniqueness","display_name":"Uniqueness","score":0.5235918760299683},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.5000696182250977},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.4926069378852844},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46222081780433655},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4147224426269531},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.38963794708251953},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3350805342197418},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.32685405015945435},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3240193724632263},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31684449315071106},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.11218330264091492},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.09435716271400452},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09031468629837036},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.07715818285942078}],"concepts":[{"id":"https://openalex.org/C152671427","wikidata":"https://www.wikidata.org/wiki/Q10843505","display_name":"Non-negative matrix factorization","level":4,"score":0.6053229570388794},{"id":"https://openalex.org/C2777021972","wikidata":"https://www.wikidata.org/wiki/Q22976830","display_name":"Uniqueness","level":2,"score":0.5235918760299683},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.5000696182250977},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.4926069378852844},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46222081780433655},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4147224426269531},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.38963794708251953},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3350805342197418},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32685405015945435},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3240193724632263},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31684449315071106},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.11218330264091492},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.09435716271400452},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09031468629837036},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.07715818285942078},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iscas.2008.4541671","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2008.4541671","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Circuits and Systems (ISCAS)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/51802a42-aea5-4da9-85cc-2e53a7590977","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/51802a42-aea5-4da9-85cc-2e53a7590977","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"M\u00f8rup , M , Madsen , K H &amp; Hansen , L K 2008 , Approximate L0 constrained Non-negative Matrix and Tensor Factorization . in 2008 IEEE International Symposium on Circuits and Systems : ISCAS 2008 (Special Session on Non-negative matix and Tensor Factorization) . IEEE , 2008 IEEE International Symposium on Circuits and Systems , Seattle, WA , United States , 18/05/2008 . https://doi.org/10.1109/ISCAS.2008.4541671","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/51802a42-aea5-4da9-85cc-2e53a7590977","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/51802a42-aea5-4da9-85cc-2e53a7590977","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"M\u00f8rup , M , Madsen , K H &amp; Hansen , L K 2008 , Approximate L0 constrained Non-negative Matrix and Tensor Factorization . in 2008 IEEE International Symposium on Circuits and Systems : ISCAS 2008 (Special Session on Non-negative matix and Tensor Factorization) . IEEE , 2008 IEEE International Symposium on Circuits and Systems , Seattle, WA , United States , 18/05/2008 . https://doi.org/10.1109/ISCAS.2008.4541671","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1902027874","https://openalex.org/W1963826206","https://openalex.org/W2000215628","https://openalex.org/W2050834445","https://openalex.org/W2059745395","https://openalex.org/W2062102668","https://openalex.org/W2063978378","https://openalex.org/W2073502026","https://openalex.org/W2074376560","https://openalex.org/W2098098075","https://openalex.org/W2104298926","https://openalex.org/W2108837778","https://openalex.org/W2116216716","https://openalex.org/W2118718620","https://openalex.org/W2121739212","https://openalex.org/W2130789253","https://openalex.org/W2135029798","https://openalex.org/W2135046866","https://openalex.org/W2140318696","https://openalex.org/W2294690908","https://openalex.org/W3143596294","https://openalex.org/W4237234927","https://openalex.org/W6677759377","https://openalex.org/W6680012447"],"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":{"Non-negative":[0],"matrix":[1],"factorization":[2],"(NMF),":[3],"i.e.":[4],"V":[5],"ap":[6],"WH":[7],"where":[8],"both":[9,49],"V,":[10],"W":[11,178],"and":[12,39,56,84,200,236],"H":[13],"are":[14],"non-negative":[15],"has":[16],"become":[17],"a":[18,40,79,102,161,193,205,226],"widely":[19],"used":[20,239],"blind":[21],"source":[22],"separation":[23],"technique":[24],"due":[25],"to":[26,86,117,149,240],"its":[27],"part":[28,41,58],"based":[29,42,59,191],"representation.":[30,60],"The":[31,246],"NMF":[32,175],"decomposition":[33,55],"is":[34,76,109,126,148,253],"not":[35,44],"in":[36,62,71,237],"general":[37],"unique":[38],"representation":[43],"guaranteed.":[45],"However,":[46],"imposing":[47],"sparseness":[48],"improves":[50],"the":[51,54,63,72,120,151,166,183,196,211,215,242,250],"uniqueness":[52],"of":[53,65,82,153,185,195,244],"favors":[57],"Sparseness":[61],"form":[64],"attaining":[66],"as":[67,74],"many":[68],"zero":[69],"elements":[70],"solution":[73,190],"possible":[75],"appealing":[77],"from":[78],"conceptional":[80],"point":[81],"view":[83],"corresponds":[85],"minimizing":[87,130],"reconstruction":[88],"error":[89],"with":[90],"an":[91,110,186],"L":[92,104,121,167,216,228],"<sub":[93,105,122,134,142,168,217,229],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[94,106,123,135,138,143,169,218,230],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">0</sub>":[95,107,231],"norm":[96,108,125,171],"constraint.":[97],"In":[98],"general,":[99],"solving":[100],"for":[101,165,176,249,255],"given":[103,227],"NP":[111],"hard":[112],"problem":[113,147],"thus":[114],"convex":[115],"relaxation":[116],"regularization":[118,163,213,220],"by":[119],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sub>":[124,144,170,219],"often":[127],"considered,":[128],"i.e.,":[129],"(1/2||V":[131],"-":[132],"WH||":[133],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">F</sub>":[136],"<sup":[137],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[139],"+":[140],"lambda||H||":[141],").An":[145],"open":[146],"control":[150,241],"degree":[152],"sparsity":[154,243],"lambda":[155,222],"imposed.":[156],"We":[157],"here":[158],"demonstrate":[159],"that":[160,223],"full":[162,212],"path":[164],"regularized":[172],"least":[173,188,197],"squares":[174,189],"fixed":[177],"can":[179,232],"be":[180,233],"calculated":[181],"at":[182],"cost":[184],"ordinary":[187],"on":[192],"modification":[194],"angle":[198],"regression":[199],"selection":[201],"(LARS)":[202],"algorithm":[203,252],"forming":[204],"non-negativity":[206],"constrained":[207],"LARS":[208],"(NLARS).":[209],"With":[210],"path,":[214],"strength":[221],"best":[224],"approximates":[225],"directly":[234],"accessed":[235],"effect":[238],"H.":[245],"MATLAB":[247],"code":[248],"NLARS":[251],"available":[254],"download.":[256]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}