{"id":"https://openalex.org/W1981512030","doi":"https://doi.org/10.1109/icassp.2014.6853546","title":"A parallel algorithm for big tensor decomposition using randomly compressed cubes (PARACOMP)","display_name":"A parallel algorithm for big tensor decomposition using randomly compressed cubes (PARACOMP)","publication_year":2014,"publication_date":"2014-05-01","ids":{"openalex":"https://openalex.org/W1981512030","doi":"https://doi.org/10.1109/icassp.2014.6853546","mag":"1981512030"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2014.6853546","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2014.6853546","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","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/A5050186120","display_name":"Nicholas D. Sidiropoulos","orcid":"https://orcid.org/0000-0002-3385-7911"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"N. D. Sidiropoulos","raw_affiliation_strings":["Dept. of ECE, Univ. of Minnesota, Minneapolis, MN, USA","Department of ECE, University of Minnesota, Minneapolis, MN, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of ECE, Univ. of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]},{"raw_affiliation_string":"Department of ECE, University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054849323","display_name":"Evangelos E. Papalexakis","orcid":"https://orcid.org/0000-0002-3411-8483"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E. E. Papalexakis","raw_affiliation_strings":["Dept. of CS, Carnegie-Mellon Univ., Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of CS, Carnegie-Mellon Univ., Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035605036","display_name":"Christos Faloutsos","orcid":"https://orcid.org/0000-0003-2996-9790"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Faloutsos","raw_affiliation_strings":["Dept. of CS, Carnegie-Mellon Univ., Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of CS, Carnegie-Mellon Univ., Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5050186120"],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":null,"apc_paid":null,"fwci":1.1494,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.75,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"52","issue":null,"first_page":"1","last_page":"5"},"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.9610000252723694,"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/tensor","display_name":"Tensor (intrinsic definition)","score":0.8076996803283691},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.6748101711273193},{"id":"https://openalex.org/keywords/replica","display_name":"Replica","score":0.529444694519043},{"id":"https://openalex.org/keywords/identifiability","display_name":"Identifiability","score":0.5085827112197876},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48761382699012756},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46923333406448364},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44768476486206055},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4194566011428833},{"id":"https://openalex.org/keywords/big-data","display_name":"Big data","score":0.41400688886642456},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37614521384239197},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.29168733954429626},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.17266446352005005},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1167106032371521},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.10553586483001709}],"concepts":[{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.8076996803283691},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6748101711273193},{"id":"https://openalex.org/C2775937380","wikidata":"https://www.wikidata.org/wiki/Q1232589","display_name":"Replica","level":2,"score":0.529444694519043},{"id":"https://openalex.org/C122770356","wikidata":"https://www.wikidata.org/wiki/Q1656753","display_name":"Identifiability","level":2,"score":0.5085827112197876},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48761382699012756},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46923333406448364},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44768476486206055},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4194566011428833},{"id":"https://openalex.org/C75684735","wikidata":"https://www.wikidata.org/wiki/Q858810","display_name":"Big data","level":2,"score":0.41400688886642456},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37614521384239197},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29168733954429626},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.17266446352005005},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1167106032371521},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.10553586483001709},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.2014.6853546","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2014.6853546","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W101466088","https://openalex.org/W111803032","https://openalex.org/W227277429","https://openalex.org/W1970195563","https://openalex.org/W2000215628","https://openalex.org/W2008560788","https://openalex.org/W2009685860","https://openalex.org/W2027559251","https://openalex.org/W2057503509","https://openalex.org/W2063385922","https://openalex.org/W2095590702","https://openalex.org/W2098171862","https://openalex.org/W2108138101","https://openalex.org/W2119511382","https://openalex.org/W2121739212","https://openalex.org/W2136559714","https://openalex.org/W2142486198","https://openalex.org/W2150059498","https://openalex.org/W2170668800","https://openalex.org/W2490308495","https://openalex.org/W4285719527","https://openalex.org/W6604521660","https://openalex.org/W6681015807"],"related_works":["https://openalex.org/W2950186459","https://openalex.org/W2170114491","https://openalex.org/W2897298721","https://openalex.org/W2242624680","https://openalex.org/W2136127937","https://openalex.org/W4290987221","https://openalex.org/W2216309014","https://openalex.org/W2569661359","https://openalex.org/W3199841771","https://openalex.org/W4286971555"],"abstract_inverted_index":{"A":[0],"parallel":[1,22],"algorithm":[2,18,98],"for":[3,11,114],"low-rank":[4],"tensor":[5,52,66,84,117],"decomposition":[6],"that":[7],"is":[8,14,19,38,99],"especially":[9],"well-suited":[10],"big":[12,34,65,83,116],"tensors":[13],"proposed.":[15],"The":[16,54,96],"new":[17],"based":[20],"on":[21],"processing":[23],"of":[24,27,32,81,92,109,118,125],"a":[25,47,115],"set":[26],"randomly":[28],"compressed,":[29],"reduced-size":[30,94],"`replicas'":[31],"the":[33,42,64,71,78,82,90,93],"tensor.":[35],"Each":[36],"replica":[37],"independently":[39],"decomposed,":[40],"and":[41,70,106],"results":[43],"are":[44,74],"joined":[45],"via":[46],"master":[48],"linear":[49],"equation":[50],"per":[51],"mode.":[53],"approach":[55],"enables":[56],"massive":[57],"parallelism":[58],"with":[59,128],"guaranteed":[60],"identifiability":[61],"properties:":[62],"if":[63],"has":[67],"low":[68],"rank":[69,126],"system":[72],"parameters":[73],"appropriately":[75],"chosen,":[76],"then":[77],"rank-one":[79],"factors":[80],"will":[85],"be":[86],"exactly":[87],"recovered":[88],"from":[89],"analysis":[91],"replicas.":[95],"proposed":[97],"proven":[100],"to":[101,112],"yield":[102],"memory":[103],"/":[104],"storage":[105],"complexity":[107],"gains":[108],"order":[110],"up":[111],"IJ/F":[113],"size":[119],"I":[120],"\u00d7":[121,123],"J":[122],"K":[124],"F":[127,129],"\u2264I":[130],"\u2264J":[131],"\u2264K.":[132]},"counts_by_year":[{"year":2020,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}