{"id":"https://openalex.org/W2959339346","doi":"https://doi.org/10.1109/access.2019.2929189","title":"Nonnegative Tensor Completion via Low-Rank Tucker Decomposition: Model and Algorithm","display_name":"Nonnegative Tensor Completion via Low-Rank Tucker Decomposition: Model and Algorithm","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2959339346","doi":"https://doi.org/10.1109/access.2019.2929189","mag":"2959339346"},"language":"en","primary_location":{"id":"doi:10.1109/access.2019.2929189","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2019.2929189","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8600701/08764328.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://ieeexplore.ieee.org/ielx7/6287639/8600701/08764328.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023647082","display_name":"Bilian Chen","orcid":"https://orcid.org/0000-0001-5805-072X"},"institutions":[{"id":"https://openalex.org/I191208505","display_name":"Xiamen University","ror":"https://ror.org/00mcjh785","country_code":"CN","type":"education","lineage":["https://openalex.org/I191208505"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bilian Chen","raw_affiliation_strings":["Department of Automation, Xiamen University, Xiamen, China"],"raw_orcid":"https://orcid.org/0000-0001-5805-072X","affiliations":[{"raw_affiliation_string":"Department of Automation, Xiamen University, Xiamen, China","institution_ids":["https://openalex.org/I191208505"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058087737","display_name":"Ting Sun","orcid":"https://orcid.org/0000-0002-9721-1861"},"institutions":[{"id":"https://openalex.org/I191208505","display_name":"Xiamen University","ror":"https://ror.org/00mcjh785","country_code":"CN","type":"education","lineage":["https://openalex.org/I191208505"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ting Sun","raw_affiliation_strings":["Department of Automation, Xiamen University, Xiamen, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Automation, Xiamen University, Xiamen, China","institution_ids":["https://openalex.org/I191208505"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001762633","display_name":"Zhehao Zhou","orcid":null},"institutions":[{"id":"https://openalex.org/I191208505","display_name":"Xiamen University","ror":"https://ror.org/00mcjh785","country_code":"CN","type":"education","lineage":["https://openalex.org/I191208505"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhehao Zhou","raw_affiliation_strings":["Department of Automation, Xiamen University, Xiamen, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Automation, Xiamen University, Xiamen, China","institution_ids":["https://openalex.org/I191208505"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100653058","display_name":"Yifeng Zeng","orcid":"https://orcid.org/0000-0002-5246-403X"},"institutions":[{"id":"https://openalex.org/I874055015","display_name":"Teesside University","ror":"https://ror.org/03z28gk75","country_code":"GB","type":"education","lineage":["https://openalex.org/I874055015"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Yifeng Zeng","raw_affiliation_strings":["School of Computing, Teesside University, Middlesbrough, U.K"],"raw_orcid":"https://orcid.org/0000-0002-5246-403X","affiliations":[{"raw_affiliation_string":"School of Computing, Teesside University, Middlesbrough, U.K","institution_ids":["https://openalex.org/I874055015"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101936719","display_name":"Langcai Cao","orcid":"https://orcid.org/0000-0001-6388-1413"},"institutions":[{"id":"https://openalex.org/I191208505","display_name":"Xiamen University","ror":"https://ror.org/00mcjh785","country_code":"CN","type":"education","lineage":["https://openalex.org/I191208505"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Langcai Cao","raw_affiliation_strings":["Department of Automation, Xiamen University, Xiamen, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Automation, Xiamen University, Xiamen, China","institution_ids":["https://openalex.org/I191208505"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":1.3246,"has_fulltext":true,"cited_by_count":16,"citation_normalized_percentile":{"value":0.77941176,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"7","issue":null,"first_page":"95903","last_page":"95914"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9998999834060669,"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.9998999834060669,"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.9969000220298767,"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/T11233","display_name":"Advanced Adaptive Filtering Techniques","score":0.954200029373169,"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/tucker-decomposition","display_name":"Tucker decomposition","score":0.8862869143486023},{"id":"https://openalex.org/keywords/inpainting","display_name":"Inpainting","score":0.6879987716674805},{"id":"https://openalex.org/keywords/coordinate-descent","display_name":"Coordinate descent","score":0.6082425713539124},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5666635632514954},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5257048010826111},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5231550931930542},{"id":"https://openalex.org/keywords/tensor","display_name":"Tensor (intrinsic definition)","score":0.5195056200027466},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5073675513267517},{"id":"https://openalex.org/keywords/tensor-decomposition","display_name":"Tensor decomposition","score":0.477854460477829},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.45611071586608887},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38519060611724854},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.36714109778404236},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33187657594680786},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2795710563659668},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07768386602401733}],"concepts":[{"id":"https://openalex.org/C42704193","wikidata":"https://www.wikidata.org/wiki/Q7851097","display_name":"Tucker decomposition","level":4,"score":0.8862869143486023},{"id":"https://openalex.org/C11727466","wikidata":"https://www.wikidata.org/wiki/Q1628157","display_name":"Inpainting","level":3,"score":0.6879987716674805},{"id":"https://openalex.org/C157553263","wikidata":"https://www.wikidata.org/wiki/Q5168004","display_name":"Coordinate descent","level":2,"score":0.6082425713539124},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5666635632514954},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5257048010826111},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5231550931930542},{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.5195056200027466},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5073675513267517},{"id":"https://openalex.org/C2986737658","wikidata":"https://www.wikidata.org/wiki/Q30103009","display_name":"Tensor decomposition","level":3,"score":0.477854460477829},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.45611071586608887},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38519060611724854},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.36714109778404236},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33187657594680786},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2795710563659668},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07768386602401733},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/access.2019.2929189","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2019.2929189","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8600701/08764328.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:https://research.tees.ac.uk/ws/oai:openaire/aaa9ce55-f80c-483d-b3ea-66ef0ad6f08d","is_oa":true,"landing_page_url":"https://research.tees.ac.uk/en/publications/aaa9ce55-f80c-483d-b3ea-66ef0ad6f08d","pdf_url":null,"source":{"id":"https://openalex.org/S4306401198","display_name":"TeesRep (Teesside University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I874055015","host_organization_name":"Teesside University","host_organization_lineage":["https://openalex.org/I874055015"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Chen, B, Sun, T, Zhou, Z, Zeng, Y & Cao, L 2019, 'Nonnegative tensor completion via low-rank Tucker decomposition: model and algorithm', IEEE Access, vol. 7, pp. 95903-95914. https://doi.org/10.1109/ACCESS.2019.2929189","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:doaj.org/article:bec28b102c8c4e6195e394fb70066ed7","is_oa":true,"landing_page_url":"https://doaj.org/article/bec28b102c8c4e6195e394fb70066ed7","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"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":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 7, Pp 95903-95914 (2019)","raw_type":"article"},{"id":"pmh:oai:https://research.tees.ac.uk/ws/oai:openaire_cris_publications/aaa9ce55-f80c-483d-b3ea-66ef0ad6f08d","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85070276622&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306401198","display_name":"TeesRep (Teesside University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I874055015","host_organization_name":"Teesside University","host_organization_lineage":["https://openalex.org/I874055015"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Chen, B, Sun, T, Zhou, Z, Zeng, Y & Cao, L 2019, 'Nonnegative tensor completion via low-rank Tucker decomposition: model and algorithm', IEEE Access, vol. 7, pp. 95903-95914. https://doi.org/10.1109/ACCESS.2019.2929189","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1109/access.2019.2929189","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2019.2929189","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8600701/08764328.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.6399999856948853,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G5101471005","display_name":null,"funder_award_id":"11671335","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G7833536237","display_name":"\u57fa\u4e8e\u503c\u7b49\u4ef7\u7684\u4ea4\u4e92\u5f0f\u52a8\u6001\u5f71\u54cd\u56fe\u7684\u6c42\u89e3\u65b9\u6cd5\u7814\u7a76\u4e0e\u5e94\u7528","funder_award_id":"61772442","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320329332","display_name":"Central Military Commission","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2959339346.pdf","grobid_xml":"https://content.openalex.org/works/W2959339346.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W191001584","https://openalex.org/W1562772298","https://openalex.org/W1568416770","https://openalex.org/W1846534543","https://openalex.org/W1968154520","https://openalex.org/W1976801265","https://openalex.org/W1978611515","https://openalex.org/W2024165284","https://openalex.org/W2032024719","https://openalex.org/W2033560557","https://openalex.org/W2042048367","https://openalex.org/W2060204507","https://openalex.org/W2091449379","https://openalex.org/W2094845866","https://openalex.org/W2095729436","https://openalex.org/W2103560185","https://openalex.org/W2106005123","https://openalex.org/W2145179194","https://openalex.org/W2159203540","https://openalex.org/W2159514083","https://openalex.org/W2166135831","https://openalex.org/W2174934803","https://openalex.org/W2342643507","https://openalex.org/W2498136258","https://openalex.org/W2566608758","https://openalex.org/W2605190428","https://openalex.org/W2739263443","https://openalex.org/W2761307742","https://openalex.org/W2788854599","https://openalex.org/W2952066970","https://openalex.org/W3101457173","https://openalex.org/W3103299328","https://openalex.org/W3105489725","https://openalex.org/W4298884670","https://openalex.org/W6633644614","https://openalex.org/W6680702173","https://openalex.org/W6681668096","https://openalex.org/W6729246985","https://openalex.org/W6735741519","https://openalex.org/W6741483654"],"related_works":["https://openalex.org/W2891735857","https://openalex.org/W4214526161","https://openalex.org/W47805180","https://openalex.org/W2093953080","https://openalex.org/W3127610061","https://openalex.org/W2891277085","https://openalex.org/W2347172331","https://openalex.org/W4226375746","https://openalex.org/W4379519626","https://openalex.org/W4281643854"],"abstract_inverted_index":{"We":[0,97],"consider":[1],"the":[2,54,71,82,99,108,114,127],"problem":[3],"of":[4,8,49,56,70,101],"low-rank":[5,40],"tensor":[6,37],"decomposition":[7,42,59],"incomplete":[9],"tensors":[10],"that":[11,53,113],"has":[12],"applications":[13],"in":[14],"many":[15],"data":[16,128],"analysis":[17],"problems,":[18],"such":[19],"as":[20],"recommender":[21],"systems,":[22],"signal":[23],"processing,":[24],"machine":[25],"learning,":[26],"and":[27,85],"image":[28,110],"inpainting.":[29],"In":[30],"this":[31],"paper,":[32],"we":[33],"focus":[34],"on":[35,81,107],"nonnegative":[36,57],"completion":[38],"via":[39],"Tucker":[41,58],"for":[43,93],"dealing":[44],"with":[45,90,121],"it.":[46],"The":[47,104],"specialty":[48],"our":[50,102],"model":[51],"is":[52,79,129],"ranks":[55],"are":[60],"no":[61],"longer":[62],"constants,":[63],"while":[64],"they":[65],"all":[66],"become":[67],"a":[68],"part":[69],"decisions":[72],"to":[73],"be":[74],"optimized.":[75],"Our":[76],"solving":[77],"approach":[78],"based":[80],"penalty":[83],"method":[84,89],"blocks":[86],"coordinate":[87],"descent":[88],"prox-linear":[91],"updates":[92],"regularized":[94],"multiconvex":[95],"optimization.":[96],"demonstrate":[98],"convergence":[100],"algorithm.":[103],"numerical":[105],"results":[106],"three":[109],"datasets":[111],"show":[112],"proposed":[115],"algorithm":[116],"offers":[117],"competitive":[118],"performance":[119],"compared":[120],"other":[122],"existing":[123],"algorithms":[124],"even":[125],"though":[126],"highly":[130],"sparse.":[131]},"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}