{"id":"https://openalex.org/W2788854599","doi":"https://doi.org/10.1137/16m1102744","title":"Parallel Candecomp/Parafac Decomposition of Sparse Tensors Using Dimension Trees","display_name":"Parallel Candecomp/Parafac Decomposition of Sparse Tensors Using Dimension Trees","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2788854599","doi":"https://doi.org/10.1137/16m1102744","mag":"2788854599"},"language":"en","primary_location":{"id":"doi:10.1137/16m1102744","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1102744","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-01397464","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114888641","display_name":"Oguz Kaya","orcid":"https://orcid.org/0000-0002-4444-1516"},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Oguz Kaya","raw_affiliation_strings":["LIP - Laboratoire de l'Informatique du Parall\u00e9lisme (46 All\u00e9e d'Italie 69364 LYON CEDEX 07 - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIP - Laboratoire de l'Informatique du Parall\u00e9lisme (46 All\u00e9e d'Italie 69364 LYON CEDEX 07 - France)","institution_ids":["https://openalex.org/I113428412","https://openalex.org/I4210144566"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5106455635","display_name":"Bora U\u00e7ar","orcid":"https://orcid.org/0000-0002-4960-3545"},"institutions":[{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Bora U\u00e7ar","raw_affiliation_strings":["ROMA - Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement (Laboratoire de l'Informatique du Parall\u00e9lisme 46 All\u00e9e d'Italie 69364 Lyon - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ROMA - Optimisation des ressources : mod\u00e8les, algorithmes et ordonnancement (Laboratoire de l'Informatique du Parall\u00e9lisme 46 All\u00e9e d'Italie 69364 Lyon - France)","institution_ids":["https://openalex.org/I4210144566"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.1435,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.92607004,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"40","issue":"1","first_page":"C99","last_page":"C130"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9259999990463257,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/computer-science","display_name":"Computer science","score":0.7708396911621094},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6787893772125244},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6664291620254517},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6607382297515869},{"id":"https://openalex.org/keywords/distributed-memory","display_name":"Distributed memory","score":0.5439817905426025},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.5178697109222412},{"id":"https://openalex.org/keywords/supercomputer","display_name":"Supercomputer","score":0.4836938977241516},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.47250354290008545},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.45915594696998596},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.4476913809776306},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4350598454475403},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3005284070968628},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.1561255156993866}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7708396911621094},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6787893772125244},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6664291620254517},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6607382297515869},{"id":"https://openalex.org/C91481028","wikidata":"https://www.wikidata.org/wiki/Q1054686","display_name":"Distributed memory","level":3,"score":0.5439817905426025},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.5178697109222412},{"id":"https://openalex.org/C83283714","wikidata":"https://www.wikidata.org/wiki/Q121117","display_name":"Supercomputer","level":2,"score":0.4836938977241516},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.47250354290008545},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.45915594696998596},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.4476913809776306},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4350598454475403},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3005284070968628},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.1561255156993866},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/16m1102744","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1102744","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01397464v2","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01397464","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Scientific Computing, 2018, 40 (1), pp.C99 - C130. ⟨10.1137/16M1102744⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01397464v2","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01397464","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Scientific Computing, 2018, 40 (1), pp.C99 - C130. ⟨10.1137/16M1102744⟩","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8202401417","display_name":null,"funder_award_id":"2016-i2016067501","funder_id":"https://openalex.org/F4320326256","funder_display_name":"Grand \u00c9quipement National De Calcul Intensif"}],"funders":[{"id":"https://openalex.org/F4320326256","display_name":"Grand \u00c9quipement National De Calcul Intensif","ror":"https://ror.org/0010d1q40"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W94565353","https://openalex.org/W1512387364","https://openalex.org/W1521626219","https://openalex.org/W2000215628","https://openalex.org/W2008972618","https://openalex.org/W2024165284","https://openalex.org/W2038198231","https://openalex.org/W2042901969","https://openalex.org/W2047680880","https://openalex.org/W2056088289","https://openalex.org/W2069277577","https://openalex.org/W2071729267","https://openalex.org/W2079487069","https://openalex.org/W2089349245","https://openalex.org/W2095729436","https://openalex.org/W2103392911","https://openalex.org/W2106221905","https://openalex.org/W2108138101","https://openalex.org/W2145124007","https://openalex.org/W2158598102","https://openalex.org/W2167143366","https://openalex.org/W2245094585","https://openalex.org/W2523567745","https://openalex.org/W2731053425","https://openalex.org/W2739912219","https://openalex.org/W2915098601"],"related_works":["https://openalex.org/W2026512611","https://openalex.org/W1985165680","https://openalex.org/W4245497162","https://openalex.org/W2091883426","https://openalex.org/W2353146130","https://openalex.org/W2174948646","https://openalex.org/W3173235360","https://openalex.org/W1990817968","https://openalex.org/W2150064838","https://openalex.org/W1933089384"],"abstract_inverted_index":{"CANDECOMP/PARAFAC":[0],"(CP)":[1],"decomposition":[2,35,65,90],"of":[3,36,51,62,66,82,110,179],"sparse":[4,37,67],"tensors":[5,38,68,144],"has":[6],"been":[7],"successfully":[8],"applied":[9],"to":[10,43,46,160,187],"many":[11,25],"problems":[12],"in":[13,41,86,107,112,166],"web":[14],"search,":[15],"graph":[16],"analytics,":[17,23],"recommender":[18],"systems,":[19],"health":[20],"care":[21],"data":[22,50,120],"and":[24,48,69,114,118,121,133,148,155,163,171,182],"other":[26],"domains.":[27],"In":[28],"these":[29],"applications,":[30],"efficiently":[31],"computing":[32,87],"the":[33,63,80,88,92,108,177,180],"CP":[34,64,89],"is":[39],"essential":[40],"order":[42],"be":[44],"able":[45],"process":[47],"analyze":[49],"massive":[52],"scale.":[53],"For":[54],"this":[55,104],"purpose,":[56],"we":[57,157],"investigate":[58],"an":[59,138,191],"efficient":[60,139],"computation":[61],"its":[70],"parallelization.":[71],"We":[72,100,128],"propose":[73,119],"a":[74,83],"novel":[75],"computational":[76,105],"scheme":[77,106],"for":[78,125],"reducing":[79],"cost":[81],"core":[84],"operation":[85],"with":[91,137],"traditional":[93],"alternating":[94],"least":[95],"squares":[96],"(CP-ALS)":[97],"based":[98],"algorithm.":[99],"then":[101],"effectively":[102],"parallelize":[103],"context":[109],"CP-ALS":[111,131],"shared":[113,168],"distributed":[115,172],"memory":[116,169,173],"environments":[117],"task":[122],"distribution":[123],"models":[124],"better":[126],"scalability.":[127],"implement":[129],"parallel":[130,174],"algorithms":[132],"compare":[134],"our":[135,152],"implementations":[136],"tensor":[140],"factorization":[141],"library":[142],"using":[143],"formed":[145],"from":[146],"real-world":[147],"synthetic":[149],"datasets.":[150],"With":[151],"algorithmic":[153],"contributions":[154],"implementations,":[156],"report":[158],"up":[159,186],"5.96x,":[161],"5.65x,":[162],"3.9x":[164],"speedup":[165],"sequential,":[167],"parallel,":[170],"executions":[175],"over":[176],"state":[178],"art":[181],"achieve":[183],"strong":[184],"scalability":[185],"4096":[188],"cores":[189],"on":[190],"IBM":[192],"BlueGene/Q":[193],"supercomputer.":[194]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":3}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}