{"id":"https://openalex.org/W2039805134","doi":"https://doi.org/10.1145/2339530.2339610","title":"Large-scale distributed non-negative sparse coding and sparse dictionary learning","display_name":"Large-scale distributed non-negative sparse coding and sparse dictionary learning","publication_year":2012,"publication_date":"2012-08-12","ids":{"openalex":"https://openalex.org/W2039805134","doi":"https://doi.org/10.1145/2339530.2339610","mag":"2039805134"},"language":"en","primary_location":{"id":"doi:10.1145/2339530.2339610","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2339530.2339610","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining","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/A5058073838","display_name":"Vikas Sindhwani","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]},{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Vikas Sindhwani","raw_affiliation_strings":["IBM T.J. Watson Research Center, Yorktown Heights, NY, USA","IBM T. J. Watson Research Center, Yorktown Heights , NY, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"IBM T.J. Watson Research Center, Yorktown Heights, NY, USA","institution_ids":["https://openalex.org/I4210114115"]},{"raw_affiliation_string":"IBM T. J. Watson Research Center, Yorktown Heights , NY, USA#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043552468","display_name":"Amol Ghoting","orcid":null},"institutions":[{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]},{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amol Ghoting","raw_affiliation_strings":["IBM T.J. Watson Research Center, Yorktown Heights, NY, USA","IBM T. J. Watson Research Center, Yorktown Heights , NY, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"IBM T.J. Watson Research Center, Yorktown Heights, NY, USA","institution_ids":["https://openalex.org/I4210114115"]},{"raw_affiliation_string":"IBM T. J. Watson Research Center, Yorktown Heights , NY, USA#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058073838"],"corresponding_institution_ids":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"],"apc_list":null,"apc_paid":null,"fwci":2.4981,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.90425025,"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":"489","last_page":"497"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10057","display_name":"Face and Expression Recognition","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9993000030517578,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9980999827384949,"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.7538639307022095},{"id":"https://openalex.org/keywords/neural-coding","display_name":"Neural coding","score":0.7478440403938293},{"id":"https://openalex.org/keywords/k-svd","display_name":"K-SVD","score":0.7295750379562378},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.5913347005844116},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.5607149600982666},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.532439112663269},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.5269076228141785},{"id":"https://openalex.org/keywords/dictionary-learning","display_name":"Dictionary learning","score":0.48108693957328796},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.43033134937286377},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4300061762332916},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4289207458496094},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4055751860141754},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3576034605503082},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3546157479286194},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3115115463733673},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18255683779716492}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7538639307022095},{"id":"https://openalex.org/C77637269","wikidata":"https://www.wikidata.org/wiki/Q7002051","display_name":"Neural coding","level":2,"score":0.7478440403938293},{"id":"https://openalex.org/C154771677","wikidata":"https://www.wikidata.org/wiki/Q17098361","display_name":"K-SVD","level":3,"score":0.7295750379562378},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.5913347005844116},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.5607149600982666},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.532439112663269},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.5269076228141785},{"id":"https://openalex.org/C2988886741","wikidata":"https://www.wikidata.org/wiki/Q25304494","display_name":"Dictionary learning","level":3,"score":0.48108693957328796},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.43033134937286377},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4300061762332916},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4289207458496094},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4055751860141754},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3576034605503082},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3546157479286194},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3115115463733673},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18255683779716492},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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/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.1145/2339530.2339610","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2339530.2339610","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.307.6864","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.6864","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://vikas.sindhwani.org/DistributedSparseNMFkdd2012.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W33214042","https://openalex.org/W340056678","https://openalex.org/W1246381107","https://openalex.org/W1591116419","https://openalex.org/W1880262756","https://openalex.org/W1902027874","https://openalex.org/W1978259121","https://openalex.org/W2001782903","https://openalex.org/W2041517243","https://openalex.org/W2102458936","https://openalex.org/W2111604514","https://openalex.org/W2112447569","https://openalex.org/W2112495313","https://openalex.org/W2116137244","https://openalex.org/W2118718620","https://openalex.org/W2153622543","https://openalex.org/W2173213060","https://openalex.org/W2271221198","https://openalex.org/W2996852294","https://openalex.org/W4254313632","https://openalex.org/W6677121468","https://openalex.org/W6750230808"],"related_works":["https://openalex.org/W2509955295","https://openalex.org/W2078080292","https://openalex.org/W2364118486","https://openalex.org/W2111634407","https://openalex.org/W2244609343","https://openalex.org/W3012953444","https://openalex.org/W3207930698","https://openalex.org/W2476820244","https://openalex.org/W2941994925","https://openalex.org/W2039805134"],"abstract_inverted_index":{"We":[0,116],"consider":[1],"the":[2,26,101,125],"problem":[3],"of":[4,9,47,81,138],"building":[5],"compact,":[6],"unsupervised":[7],"representations":[8],"large,":[10,48],"high-dimensional,":[11],"non-negative":[12,45],"data":[13],"using":[14,61],"sparse":[15,44,49,57],"coding":[16,58],"and":[17,70,99,120,136],"dictionary":[18,73],"learning":[19,74],"schemes,":[20],"with":[21,130],"an":[22],"emphasis":[23],"on":[24,95,146],"executing":[25],"algorithm":[27],"in":[28,111,141],"a":[29,55,71,79,112,143,147],"Map-Reduce":[30,114],"environment.":[31],"The":[32],"proposed":[33],"algorithms":[34],"may":[35],"be":[36],"seen":[37],"as":[38],"parallel":[39,56],"optimization":[40,83],"procedures":[41],"for":[42],"constructing":[43],"factorizations":[46],"matrices.":[50],"Our":[51],"approach":[52],"alternates":[53],"between":[54],"phase":[59,75],"implemented":[60],"greedy":[62],"or":[63],"convex":[64],"(l1)":[65],"regularized":[66],"risk":[67],"minimization":[68],"procedures,":[69],"sequential":[72],"where":[76],"we":[77],"solve":[78],"set":[80],"l0":[82],"problems":[84],"exactly.":[85],"These":[86],"two-fold":[87],"sparsity":[88],"constraints":[89],"lead":[90,123],"to":[91,107,124,127],"better":[92],"statistical":[93],"performance":[94],"text":[96],"analysis":[97],"tasks":[98],"at":[100],"same":[102],"time":[103],"make":[104],"it":[105],"possible":[106],"implement":[108],"each":[109],"iteration":[110],"single":[113],"job.":[115],"detail":[117],"our":[118],"implementations":[119],"optimizations":[121],"that":[122],"ability":[126],"factor":[128],"matrices":[129],"more":[131],"than":[132],"100":[133],"million":[134],"rows":[135],"billions":[137],"non-zero":[139],"entries":[140],"just":[142],"few":[144],"hours":[145],"small":[148],"commodity":[149],"cluster.":[150]},"counts_by_year":[{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}