Analysis of academic productivity based on Complex Networks

We present a new tool, Kampal (http://kampal.unizar.es), developed to help to analyze the academic productivity of a research institution from the point of view of Complex Networks. We will focus on two main aspects: paper production and funding by research grants. Thus, we define a network of researchers and define suitable ways of describing their interaction, either by co-publication, project-collaboration, or a combination of both. From the corresponding complex networks, we extract maps which encode in graphical terms the relevant information and numerical parameters which encode the topological properties of the network. Thousands of these maps have been created and allow us to study the similarities and differences of the co-publications and the project-collaboration networks.

[1]  J. E. Hirsch,et al.  An index to quantify an individual's scientific research output , 2005, Proc. Natl. Acad. Sci. USA.

[2]  David L. Wallace,et al.  A Method for Comparing Two Hierarchical Clusterings: Comment , 1983 .

[3]  Luigi Di Caro,et al.  The d-index: Discovering dependences among scientific collaborators from their bibliographic data records , 2012, Scientometrics.

[4]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[5]  Mônica G. Campiteli,et al.  An index to quantify an individual's scientific research valid across disciplines , 2005 .

[6]  Martin G. Everett,et al.  A Graph-theoretic perspective on centrality , 2006, Soc. Networks.

[7]  Sebastian Grauwin,et al.  Mapping scientific institutions , 2011, Scientometrics.

[8]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Stephen P. Borgatti,et al.  Centrality and network flow , 2005, Soc. Networks.

[10]  Benedetto Torrisi.  A multidimensional approach to academic productivity , 2013, Scientometrics.

[11]  Francisco Herrera,et al.  Science mapping software tools: Review, analysis, and cooperative study among tools , 2011, J. Assoc. Inf. Sci. Technol..

[12]  Rodrigo Costas,et al.  The h-index: Advantages, limitations and its relation with other bibliometric indicators at the micro level , 2007, J. Informetrics.

[13]  A. Vespignani,et al.  The architecture of complex weighted networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[14]  Juan E. Iglesias,et al.  Scaling the h-index for different scientific ISI fields , 2006, Scientometrics.

[15]  van Eck Nees Jan,et al.  How to normalize cooccurrence data An analysis of some well-known similarity measures , 2009 .

[16]  L. Egghe,et al.  Theory and practise of the g-index , 2006, Scientometrics.

[17]  María Bordons,et al.  Bibliometric analysis of publications of Spanish pharmacologists in the SCI (1984–89). Part II , 1992, Scientometrics.

[18]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[19]  K. Wiesner,et al.  What is a complex system? , 2012, European Journal for Philosophy of Science.

[20]  Jörn Altmann,et al.  Evaluating scholars based on their academic collaboration activities: two indices, the RC-index and the CC-index, for quantifying collaboration activities of researchers and scientific communities , 2010, Scientometrics.

[21]  Giovanni Abramo,et al.  The suitability of h and g indexes for measuring the research performance of institutions , 2013, Scientometrics.

[22]  Nees Jan van Eck,et al.  How to normalize cooccurrence data? An analysis of some well-known similarity measures , 2009, J. Assoc. Inf. Sci. Technol..

[23]  Alan L. Porter,et al.  Science overlay maps: A new tool for research policy and library management , 2009, J. Assoc. Inf. Sci. Technol..

[24]  C. Mallows,et al.  A Method for Comparing Two Hierarchical Clusterings , 1983 .

[25]  Sergey Brin,et al.  Reprint of: The anatomy of a large-scale hypertextual web search engine , 2012, Comput. Networks.

[26]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  魏屹东,et al.  Scientometrics , 2018, Encyclopedia of Big Data.

[28]  Cinzia Daraio,et al.  An empirical approach to compare the performance of heterogeneous academic fields , 2013, Scientometrics.

[29]  D J PRICE,et al.  NETWORKS OF SCIENTIFIC PAPERS. , 1965, Science.

[30]  Audra E. Kosh,et al.  Linear Algebra and its Applications , 1992 .

[31]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[32]  Michael McGill,et al.  Introduction to Modern Information Retrieval , 1983 .

[33]  M E Newman,et al.  Scientific collaboration networks. I. Network construction and fundamental results. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[34]  Olesya Mryglod,et al.  Comparison of a citation-based indicator and peer review for absolute and specific measures of research-group excellence , 2013, Scientometrics.

[35]  John Skvoretz,et al.  Node centrality in weighted networks: Generalizing degree and shortest paths , 2010, Soc. Networks.

[36]  Matthieu Latapy,et al.  Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..

[37]  Ash Mohammad Abbas,et al.  Weighted indices for evaluating the quality of research with multiple authorship , 2010, Scientometrics.

[38]  Mônica G. Campiteli,et al.  Is it possible to compare researchers with different scientific interests? , 2006, Scientometrics.

[39]  Francisco Herrera,et al.  h-Index: A review focused in its variants, computation and standardization for different scientific fields , 2009, J. Informetrics.

[40]  María Bordons,et al.  Bibliometric analysis of publications of Spanish pharmacologists in the SCI (1984–89) , 2005, Scientometrics.

[41]  Gábor Csárdi,et al.  The igraph software package for complex network research , 2006 .

[42]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..