{"title":"Parallelizing an algorithm to find communities using the Jaccard metric","authors":"J. Scripps, C. Trefftz","doi":"10.1109/EIT.2015.7293371","DOIUrl":null,"url":null,"abstract":"Given a graph, there are many different reasons for finding communities in a graph. Numerous algorithms have been proposed for finding communities on graphs. Many of those algorithms are time consuming. The Jaccard metric, introduced in the context of the geographic location of botanical species, has been used to find communities. An algorithm to find communities based on the Jaccard metric was parallelized using OpenMP. Performance results are reported.","PeriodicalId":415614,"journal":{"name":"2015 IEEE International Conference on Electro/Information Technology (EIT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Electro/Information Technology (EIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EIT.2015.7293371","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Given a graph, there are many different reasons for finding communities in a graph. Numerous algorithms have been proposed for finding communities on graphs. Many of those algorithms are time consuming. The Jaccard metric, introduced in the context of the geographic location of botanical species, has been used to find communities. An algorithm to find communities based on the Jaccard metric was parallelized using OpenMP. Performance results are reported.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
