Publicação: An efficient parallel optimization for co-authorship network analysis
dc.contributor.author | Valencio, Carlos Roberto [UNESP] | |
dc.contributor.author | De Freitas, Jose Carlos [UNESP] | |
dc.contributor.author | Gratao De Souza, Rogeria Cristiane [UNESP] | |
dc.contributor.author | Neves, Leandro Alves [UNESP] | |
dc.contributor.author | Donega Zafalon, Geraldo Francisco [UNESP] | |
dc.contributor.author | Colombini, Angelo Cesar | |
dc.contributor.author | Tenorio, William [UNESP] | |
dc.contributor.institution | Universidade Estadual Paulista (Unesp) | |
dc.contributor.institution | Universidade Federal de São Carlos (UFSCar) | |
dc.date.accessioned | 2018-12-11T17:20:03Z | |
dc.date.available | 2018-12-11T17:20:03Z | |
dc.date.issued | 2018-03-27 | |
dc.description.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. | en |
dc.description.affiliation | Department of Computer Science and Statistics São Paulo State University (Unesp) Institute of Biosciences Humanities and Exact Sciences (Ibilce) Campus São José Do Rio Preto | |
dc.description.affiliation | Department of Computer Science Federal University of São Carlos (UFSCAR) | |
dc.description.affiliationUnesp | Department of Computer Science and Statistics São Paulo State University (Unesp) Institute of Biosciences Humanities and Exact Sciences (Ibilce) Campus São José Do Rio Preto | |
dc.description.sponsorship | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
dc.format.extent | 127-134 | |
dc.identifier | http://dx.doi.org/10.1109/PDCAT.2017.00030 | |
dc.identifier.citation | Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings, v. 2017-December, p. 127-134. | |
dc.identifier.doi | 10.1109/PDCAT.2017.00030 | |
dc.identifier.lattes | 4644812253875832 | |
dc.identifier.lattes | 2139053814879312 | |
dc.identifier.orcid | 0000-0002-9325-3159 | |
dc.identifier.scopus | 2-s2.0-85046774100 | |
dc.identifier.uri | http://hdl.handle.net/11449/176308 | |
dc.language.iso | eng | |
dc.relation.ispartof | Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings | |
dc.rights.accessRights | Acesso aberto | |
dc.source | Scopus | |
dc.subject | Bibliometrics | |
dc.subject | Big data | |
dc.subject | Coauthorship network | |
dc.subject | Graphs | |
dc.subject | Knowledge extraction | |
dc.subject | NoSQL | |
dc.title | An efficient parallel optimization for co-authorship network analysis | en |
dc.type | Trabalho apresentado em evento | |
dspace.entity.type | Publication | |
unesp.author.lattes | 4644812253875832[1] | |
unesp.author.lattes | 2139053814879312 | |
unesp.author.orcid | 0000-0002-9325-3159[1] | |
unesp.campus | Universidade Estadual Paulista (Unesp), Instituto de Biociências Letras e Ciências Exatas, São José do Rio Preto | pt |
unesp.department | Ciências da Computação e Estatística - IBILCE | pt |