High performance clustering of social images in a map-collective programming model

High performance clustering of social images in a map-collective programming model. Zhang, B. & Qiu, J. In Proceedings of the 4th annual Symposium on Cloud Computing, pages 44, 2013. ACM.
doi abstract bibtex

Large-scale iterative computations are common in many important data mining and machine learning algorithms. Most of these applications can be specified as iterations of MapReduce computations, leading to the Iterative MapReduce programming model [1] for efficient execution of data-intensive iterative computations interoperably between HPC and cloud environments. We observe that a systematic approach to collective communication is essential but notably missing in the current model. Thus we generalize the iterative MapReduce concept to Map-Collective on the premise that large collectives are a distinctive feature of data intensive and data mining applications. To show the necessity of Map-Collective model, this paper studies the implications of large-scale social image clustering problems, where 10-100 million images represented as points in a high dimensional (up to 2048) vector space are required to be divided into 1-10 million clusters. Copyright © 2013 by the Association for Computing Machinery, Inc.

@inproceedings{
 title = {High performance clustering of social images in a map-collective programming model},
 type = {inproceedings},
 year = {2013},
 pages = {44},
 publisher = {ACM},
 id = {cf291953-8de2-3e3f-a773-fe2009d69032},
 created = {2017-12-18T21:44:04.163Z},
 file_attached = {false},
 profile_id = {42d295c0-0737-38d6-8b43-508cab6ea85d},
 last_modified = {2020-05-11T14:43:45.656Z},
 read = {false},
 starred = {false},
 authored = {true},
 confirmed = {true},
 hidden = {false},
 citation_key = {Zhang2013a},
 source_type = {CONF},
 folder_uuids = {36d8ccf4-7085-47fa-8ab9-897283d082c5},
 private_publication = {false},
 abstract = {Large-scale iterative computations are common in many important data mining and machine learning algorithms. Most of these applications can be specified as iterations of MapReduce computations, leading to the Iterative MapReduce programming model [1] for efficient execution of data-intensive iterative computations interoperably between HPC and cloud environments. We observe that a systematic approach to collective communication is essential but notably missing in the current model. Thus we generalize the iterative MapReduce concept to Map-Collective on the premise that large collectives are a distinctive feature of data intensive and data mining applications. To show the necessity of Map-Collective model, this paper studies the implications of large-scale social image clustering problems, where 10-100 million images represented as points in a high dimensional (up to 2048) vector space are required to be divided into 1-10 million clusters. Copyright © 2013 by the Association for Computing Machinery, Inc.},
 bibtype = {inproceedings},
 author = {Zhang, Bingjing and Qiu, Judy},
 doi = {10.1145/2523616.2525952},
 booktitle = {Proceedings of the 4th annual Symposium on Cloud Computing}
}

Downloads: 0

{"_id":"Hxb3NT2kFq6YDej8t","bibbaseid":"zhang-qiu-highperformanceclusteringofsocialimagesinamapcollectiveprogrammingmodel-2013","downloads":0,"creationDate":"2018-03-12T19:10:28.006Z","title":"High performance clustering of social images in a map-collective programming model","author_short":["Zhang, B.","Qiu, J."],"year":2013,"bibtype":"inproceedings","biburl":"https://bibbase.org/service/mendeley/42d295c0-0737-38d6-8b43-508cab6ea85d","bibdata":{"title":"High performance clustering of social images in a map-collective programming model","type":"inproceedings","year":"2013","pages":"44","publisher":"ACM","id":"cf291953-8de2-3e3f-a773-fe2009d69032","created":"2017-12-18T21:44:04.163Z","file_attached":false,"profile_id":"42d295c0-0737-38d6-8b43-508cab6ea85d","last_modified":"2020-05-11T14:43:45.656Z","read":false,"starred":false,"authored":"true","confirmed":"true","hidden":false,"citation_key":"Zhang2013a","source_type":"CONF","folder_uuids":"36d8ccf4-7085-47fa-8ab9-897283d082c5","private_publication":false,"abstract":"Large-scale iterative computations are common in many important data mining and machine learning algorithms. Most of these applications can be specified as iterations of MapReduce computations, leading to the Iterative MapReduce programming model [1] for efficient execution of data-intensive iterative computations interoperably between HPC and cloud environments. We observe that a systematic approach to collective communication is essential but notably missing in the current model. Thus we generalize the iterative MapReduce concept to Map-Collective on the premise that large collectives are a distinctive feature of data intensive and data mining applications. To show the necessity of Map-Collective model, this paper studies the implications of large-scale social image clustering problems, where 10-100 million images represented as points in a high dimensional (up to 2048) vector space are required to be divided into 1-10 million clusters. Copyright © 2013 by the Association for Computing Machinery, Inc.","bibtype":"inproceedings","author":"Zhang, Bingjing and Qiu, Judy","doi":"10.1145/2523616.2525952","booktitle":"Proceedings of the 4th annual Symposium on Cloud Computing","bibtex":"@inproceedings{\n title = {High performance clustering of social images in a map-collective programming model},\n type = {inproceedings},\n year = {2013},\n pages = {44},\n publisher = {ACM},\n id = {cf291953-8de2-3e3f-a773-fe2009d69032},\n created = {2017-12-18T21:44:04.163Z},\n file_attached = {false},\n profile_id = {42d295c0-0737-38d6-8b43-508cab6ea85d},\n last_modified = {2020-05-11T14:43:45.656Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {Zhang2013a},\n source_type = {CONF},\n folder_uuids = {36d8ccf4-7085-47fa-8ab9-897283d082c5},\n private_publication = {false},\n abstract = {Large-scale iterative computations are common in many important data mining and machine learning algorithms. Most of these applications can be specified as iterations of MapReduce computations, leading to the Iterative MapReduce programming model [1] for efficient execution of data-intensive iterative computations interoperably between HPC and cloud environments. We observe that a systematic approach to collective communication is essential but notably missing in the current model. Thus we generalize the iterative MapReduce concept to Map-Collective on the premise that large collectives are a distinctive feature of data intensive and data mining applications. To show the necessity of Map-Collective model, this paper studies the implications of large-scale social image clustering problems, where 10-100 million images represented as points in a high dimensional (up to 2048) vector space are required to be divided into 1-10 million clusters. Copyright © 2013 by the Association for Computing Machinery, Inc.},\n bibtype = {inproceedings},\n author = {Zhang, Bingjing and Qiu, Judy},\n doi = {10.1145/2523616.2525952},\n booktitle = {Proceedings of the 4th annual Symposium on Cloud Computing}\n}","author_short":["Zhang, B.","Qiu, J."],"biburl":"https://bibbase.org/service/mendeley/42d295c0-0737-38d6-8b43-508cab6ea85d","bibbaseid":"zhang-qiu-highperformanceclusteringofsocialimagesinamapcollectiveprogrammingmodel-2013","role":"author","urls":{},"metadata":{"authorlinks":{}},"downloads":0},"search_terms":["high","performance","clustering","social","images","map","collective","programming","model","zhang","qiu"],"keywords":[],"authorIDs":[],"dataSources":["zgahneP4uAjKbudrQ","ya2CyA73rpZseyrZ8","2252seNhipfTmjEBQ"]}