{"id":"https://openalex.org/W2156845379","doi":"https://doi.org/10.1109/icpr.2008.4761256","title":"FastNMF: A fast monotonic fixed-point non-negative Matrix Factorization algorithm with high ease of use","display_name":"FastNMF: A fast monotonic fixed-point non-negative Matrix Factorization algorithm with high ease of use","publication_year":2008,"publication_date":"2008-12-01","ids":{"openalex":"https://openalex.org/W2156845379","doi":"https://doi.org/10.1109/icpr.2008.4761256","mag":"2156845379"},"language":"en","primary_location":{"id":"doi:10.1109/icpr.2008.4761256","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpr.2008.4761256","pdf_url":null,"source":{"id":"https://openalex.org/S4393916651","display_name":"Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition","issn_l":"1041-3278","issn":["1041-3278","1051-4651"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 19th International Conference on Pattern Recognition","raw_type":"proceedings-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/A5100450309","display_name":"Le Li","orcid":"https://orcid.org/0000-0003-3849-4854"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Le Li","raw_affiliation_strings":["Department of Electronic Engineering, Tsinghua University, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100684571","display_name":"Yu\u2010Jin Zhang","orcid":"https://orcid.org/0000-0002-2372-1180"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yu-Jin Zhang","raw_affiliation_strings":["Tsinghua University, Beijing, Beijing, CN"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tsinghua University, Beijing, Beijing, CN","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1556,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.33333333,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"401","issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9527000188827515,"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"}},"topics":[{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9527000188827515,"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/T11447","display_name":"Blind Source Separation Techniques","score":0.9472000002861023,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9465000033378601,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/non-negative-matrix-factorization","display_name":"Non-negative matrix factorization","score":0.7732748985290527},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.6064408421516418},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6035683751106262},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.601207435131073},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.6011825203895569},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.5676639676094055},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.5013296604156494},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.4677935242652893},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3238314390182495},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30510658025741577},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18960899114608765}],"concepts":[{"id":"https://openalex.org/C152671427","wikidata":"https://www.wikidata.org/wiki/Q10843505","display_name":"Non-negative matrix factorization","level":4,"score":0.7732748985290527},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.6064408421516418},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6035683751106262},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.601207435131073},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.6011825203895569},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.5676639676094055},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.5013296604156494},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.4677935242652893},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3238314390182495},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30510658025741577},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18960899114608765},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icpr.2008.4761256","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpr.2008.4761256","pdf_url":null,"source":{"id":"https://openalex.org/S4393916651","display_name":"Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition","issn_l":"1041-3278","issn":["1041-3278","1051-4651"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 19th International Conference on Pattern Recognition","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.214.5572","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.214.5572","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://figment.cse.usf.edu/~sfefilat/data/papers/ThBCT8.15.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1508694032","https://openalex.org/W1538685017","https://openalex.org/W1565719317","https://openalex.org/W1902027874","https://openalex.org/W2002519017","https://openalex.org/W2002744657","https://openalex.org/W2100493539","https://openalex.org/W2118718620","https://openalex.org/W2146913572","https://openalex.org/W2168446235","https://openalex.org/W6630391810","https://openalex.org/W6633889955"],"related_works":["https://openalex.org/W4390394189","https://openalex.org/W2149305241","https://openalex.org/W2037504162","https://openalex.org/W2539013788","https://openalex.org/W2792706544","https://openalex.org/W1568451138","https://openalex.org/W2156699640","https://openalex.org/W2902260311","https://openalex.org/W2045265907","https://openalex.org/W2972997031"],"abstract_inverted_index":{"Non-negative":[0],"Matrix":[1],"Factorization":[2],"(NMF)":[3],"is":[4,83,97,112],"a":[5,42,100],"recently":[6],"developed":[7],"method":[8],"for":[9,26],"dimensionality":[10],"reduction,":[11],"feature":[12],"extraction":[13],"and":[14,28,124,131],"data":[15],"mining,":[16],"etc.":[17],"Currently":[18],"no":[19],"NMF":[20,116],"algorithm":[21,46],"holds":[22,92],"both":[23],"satisfactory":[24],"efficiency":[25],"applications":[27],"enough":[29],"ease":[30],"of":[31,37,62,102,108,115],"use.":[32],"To":[33],"improve":[34],"the":[35,59,106,120,125,145],"applicability":[36],"NMF,":[38],"this":[39,80],"paper":[40],"proposes":[41],"new":[43],"monotonic,":[44],"fixed-point":[45],"coined":[47],"FastNMF":[48,73,91,111,137],"by":[49,79,99],"implementing":[50],"least":[51],"squares":[52],"error-based":[53],"non-negative":[54],"factorization":[55],"essentially":[56],"according":[57],"to":[58,69,122,139,141],"basic":[60],"properties":[61],"parabola":[63],"functions.":[64],"The":[65],"minimization":[66],"problem":[67],"corresponding":[68],"an":[70],"operation":[71],"in":[72],"can":[74],"be":[75],"analytically":[76],"solved":[77],"just":[78],"algorithm,":[81],"which":[82,96],"far":[84],"beyond":[85],"all":[86],"existing":[87],"algorithmspsila":[88],"power.":[89],"Therefore,":[90],"much":[93],"higher":[94],"efficiency,":[95],"validated":[98],"number":[101],"experimental":[103,132],"results.":[104],"For":[105],"simplicity":[107],"design":[109],"philosophy,":[110],"still":[113],"one":[114],"algorithms":[117],"that":[118,136],"are":[119],"easiest":[121],"use":[123],"most":[126],"comprehensible.":[127],"Besides,":[128],"theoretical":[129],"analysis":[130],"results":[133],"also":[134],"show":[135],"tends":[138],"converge":[140],"better":[142],"solutions":[143],"than":[144],"popular":[146],"multiplicative":[147],"update-based":[148],"algorithms.":[149]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}