使用图形处理单元并行化亲和传播,用于大地理空间数据的空间聚类分析。

Xuan Shi
{"title":"使用图形处理单元并行化亲和传播,用于大地理空间数据的空间聚类分析。","authors":"Xuan Shi","doi":"10.1007/978-3-319-22786-3_32","DOIUrl":null,"url":null,"abstract":"<p><p>Introduced in 2007, affinity propagation (AP) is a relatively new machine learning algorithm for unsupervised classification that has seldom been applied in geospatial applications. One bottleneck is that AP could hardly handle large data, and a serial computer program would take a long time to complete an AP calculation. New multicore and manycore computer architectures, combined with application accelerators, show promise for achieving scalable geocomputation by exploiting task and data levels of parallelism. This chapter introduces our recent progress in parallelizing the AP algorithm on a graphics processing unit (GPU) for spatial cluster analysis, the potential of the proposed solution to process big geospatial data, and its broader impact for the GIScience community.</p>","PeriodicalId":92119,"journal":{"name":"Proceedings of the ... annual conference. GeoComputation","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5650075/pdf/nihms872315.pdf","citationCount":"0","resultStr":"{\"title\":\"Parallelizing Affinity Propagation Using Graphics Processing Units for Spatial Cluster Analysis over Big Geospatial Data.\",\"authors\":\"Xuan Shi\",\"doi\":\"10.1007/978-3-319-22786-3_32\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Introduced in 2007, affinity propagation (AP) is a relatively new machine learning algorithm for unsupervised classification that has seldom been applied in geospatial applications. One bottleneck is that AP could hardly handle large data, and a serial computer program would take a long time to complete an AP calculation. New multicore and manycore computer architectures, combined with application accelerators, show promise for achieving scalable geocomputation by exploiting task and data levels of parallelism. This chapter introduces our recent progress in parallelizing the AP algorithm on a graphics processing unit (GPU) for spatial cluster analysis, the potential of the proposed solution to process big geospatial data, and its broader impact for the GIScience community.</p>\",\"PeriodicalId\":92119,\"journal\":{\"name\":\"Proceedings of the ... annual conference. GeoComputation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5650075/pdf/nihms872315.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the ... annual conference. GeoComputation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-22786-3_32\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2017/1/5 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ... annual conference. GeoComputation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-22786-3_32","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2017/1/5 0:00:00","PubModel":"Epub","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

亲和传播(AP)于 2007 年推出,是一种相对较新的无监督分类机器学习算法,但很少应用于地理空间应用。该算法的一个瓶颈是难以处理大量数据,而且串行计算机程序需要很长时间才能完成亲和传播计算。新的多核和多核计算机体系结构与应用加速器相结合,通过利用任务和数据层面的并行性,有望实现可扩展的地理计算。本章将介绍我们最近在图形处理器(GPU)上并行化 AP 算法以进行空间聚类分析方面取得的进展、所提出的解决方案在处理大型地理空间数据方面的潜力及其对地理信息系统科学界的广泛影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Parallelizing Affinity Propagation Using Graphics Processing Units for Spatial Cluster Analysis over Big Geospatial Data.

Introduced in 2007, affinity propagation (AP) is a relatively new machine learning algorithm for unsupervised classification that has seldom been applied in geospatial applications. One bottleneck is that AP could hardly handle large data, and a serial computer program would take a long time to complete an AP calculation. New multicore and manycore computer architectures, combined with application accelerators, show promise for achieving scalable geocomputation by exploiting task and data levels of parallelism. This chapter introduces our recent progress in parallelizing the AP algorithm on a graphics processing unit (GPU) for spatial cluster analysis, the potential of the proposed solution to process big geospatial data, and its broader impact for the GIScience community.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Parallelizing Affinity Propagation Using Graphics Processing Units for Spatial Cluster Analysis over Big Geospatial Data.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1