The ever-increasing quantity and complexity of scientific production have made it difficult for researchers to keep track of advances in their own fields. This, together with growing popularity of online scientific communities, calls for the development of effective information filtering tools. We propose here an algorithm which simultaneously computes reputation of users and fitness of papers in a bipartite network representing an online scientific community. Evaluation on artificially-generated data and real data from the Econophysics Forum is used to determine the method's best-performing variants. We show that when the input data is extended to a multilayer network including users, papers and authors and the algorithm is correspondingly modified, the resulting performance improves on multiple levels. In particular, top papers have higher citation count and top authors have higher h-index than top papers and top authors chosen by other algorithms. We finally show that our algorithm is robust against persistent authors (spammers) which makes the method readily applicable to the existing online scientific communities.

Network-driven reputation in online scientific communities.

Giulio Cimini;
2014

Abstract

The ever-increasing quantity and complexity of scientific production have made it difficult for researchers to keep track of advances in their own fields. This, together with growing popularity of online scientific communities, calls for the development of effective information filtering tools. We propose here an algorithm which simultaneously computes reputation of users and fitness of papers in a bipartite network representing an online scientific community. Evaluation on artificially-generated data and real data from the Econophysics Forum is used to determine the method's best-performing variants. We show that when the input data is extended to a multilayer network including users, papers and authors and the algorithm is correspondingly modified, the resulting performance improves on multiple levels. In particular, top papers have higher citation count and top authors have higher h-index than top papers and top authors chosen by other algorithms. We finally show that our algorithm is robust against persistent authors (spammers) which makes the method readily applicable to the existing online scientific communities.
2014
Istituto dei Sistemi Complessi - ISC
Inglese
9
12
e112022
18
http://www.plosone.org/article/authors/info:doi/10.1371/journal.pone.0112022
Sì, ma tipo non specificato
social network; system analysis
Published: December 02, 2014.
4
info:eu-repo/semantics/article
262
Liao, Hao; Xiao, Rui; Cimini, Giulio; Medo, Matús
01 Contributo su Rivista::01.01 Articolo in rivista
open
   GROWTH AND INNOVATION POLICY-MODELLING: APPLYING NEXT GENERATION TOOLS, DATA, AND ECONOMIC COMPLEXITY IDEAS
   GROWTHCOM
   FP7
   611272

   Quality Collectives: Socially Intelligent Systems for Quality
   QLECTIVES
   FP7
   231200
File in questo prodotto:
File Dimensione Formato  
prod_291367-doc_83645.pdf

accesso aperto

Descrizione: Network-driven reputation in online scientific communities.
Tipologia: Versione Editoriale (PDF)
Licenza: Creative commons
Dimensione 531.72 kB
Formato Adobe PDF
531.72 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/259045
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 16
  • ???jsp.display-item.citation.isi??? 17
social impact