An Efficient Parallel Optimization for Co-Authorship Network Analysis

C. R. Valêncio, José Carlos De Freitas, Rogéria Cristiane Gratão de Souza, L. A. Neves, G. F. D. Zafalon, A. Colombini, William Tenório
{"title":"An Efficient Parallel Optimization for Co-Authorship Network Analysis","authors":"C. R. Valêncio, José Carlos De Freitas, Rogéria Cristiane Gratão de Souza, L. A. Neves, G. F. D. Zafalon, A. Colombini, William Tenório","doi":"10.1109/PDCAT.2017.00030","DOIUrl":null,"url":null,"abstract":"Co-authorship analysis in science and technology partnerships provides a vision of cooperation patterns between individuals and organizations and is still widely used to understand and assess scientific collaboration patterns. This analysis is conducted by means of bibliometry, which is the quantitative study of scientific production. However, with the evolution of database management systems, there was a significant increase in the volume of stored data, which could difficult the analysis. In this context, the developed work presents an efficient parallel optimization of bibliometric information, in order to allow this scientific analysis in a Big Data environment. Our results show that the time taken to calculate the transitivity value using the sequential approach grows 4.08 times faster than the parallel proposed approach when the number of nodes tends to infinity; the time taken to calculate the average distance and diameter values using the sequential approach grows 5.27 times faster than the parallel proposed approach when the number of nodes tends to infinity. Also, the results found present good values of speed up and efficiency.","PeriodicalId":119197,"journal":{"name":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"73 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT.2017.00030","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Co-authorship analysis in science and technology partnerships provides a vision of cooperation patterns between individuals and organizations and is still widely used to understand and assess scientific collaboration patterns. This analysis is conducted by means of bibliometry, which is the quantitative study of scientific production. However, with the evolution of database management systems, there was a significant increase in the volume of stored data, which could difficult the analysis. In this context, the developed work presents an efficient parallel optimization of bibliometric information, in order to allow this scientific analysis in a Big Data environment. Our results show that the time taken to calculate the transitivity value using the sequential approach grows 4.08 times faster than the parallel proposed approach when the number of nodes tends to infinity; the time taken to calculate the average distance and diameter values using the sequential approach grows 5.27 times faster than the parallel proposed approach when the number of nodes tends to infinity. Also, the results found present good values of speed up and efficiency.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种有效的并行优化合作网络分析方法
科学技术伙伴关系中的共同作者分析提供了个人和组织之间合作模式的远景,并且仍然广泛用于理解和评估科学合作模式。这一分析是通过文献计量学的方法进行的,这是对科学生产的定量研究。然而,随着数据库管理系统的发展,存储的数据量显著增加,这可能给分析带来困难。在这种背景下,开发的工作提出了一种有效的并行优化文献计量信息,以便在大数据环境中进行这种科学分析。结果表明,当节点数趋于无穷大时,顺序方法计算传递性值的时间比并行方法快4.08倍;当节点数趋于无穷大时,使用顺序方法计算平均距离和直径值的时间比并行方法快5.27倍。结果表明,该方法具有较好的速度和效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Implementing Algorithmic Skeletons with Bulk Synchronous Parallel ML Managing Bytecode and ISA Compatibility with an Enhanced Toolchain Improved Online Algorithms for One-Dimensional BinPacking with Advice A Case Study in Higher Education Domain Based on a Prototype for Business Process Models Improvement: BPMoQualAssess NMFDIV: A Nonnegative Matrix Factorization Approach for Search Result Diversification on Attributed Networks
×
引用
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