research-article

A community detection technique for research collaboration networks based on frequent collaborators cores

Authors:

Mirjana Ivanović,

Bojana Dimić SurlaAuthors Info & Claims

SAC '16: Proceedings of the 31st Annual ACM Symposium on Applied Computing

Pages 1090 - 1095

https://doi.org/10.1145/2851613.2851809

Published: 04 April 2016 Publication History

Abstract

Community structure is one of prominent features of complex real-world networks. In this paper we propose a novel technique for detecting communities in research collaboration networks. The main idea of the algorithm is that research communities can be efficiently recovered from sub-graphs encompassing frequent collaborators. Moreover, the algorithm can be used to cluster weighted undirected networks from other domains as well. An experimental evaluation of the algorithm was conducted on a co-authorship network representing collaborations between researchers employed at our Department. The results of the evaluation showed that the algorithm identifies strong and meaningful clusters corresponding to groups dealing with specific research topics. Moreover, we compared our method to seven other community detection techniques showing that it performs better or equally with respect to the quality of obtained community structures.

References

[1]

V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 2008(10):P10008, 2008.

[2]

U. Brandes, D. Delling, M. Gaertler, R. Gorke, M. Hoefer, Z. Nikoloski, and D. Wagner. On modularity clustering. IEEE Trans. on Knowl. and Data Eng., 20(2):172--188, Feb. 2008.

Digital Library

[3]

Z. Chen, M. Jia, B. Yang, and X. Li. Detecting overlapping community in complex network based on node similarity. Computer Science and Information Systems, 12(2):843--855, 2015.

[4]

A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Phys. Rev. E, 70(6):066111, 2004.

[5]

G. Csardi and T. Nepusz. The igraph software package for complex network research. InterJournal, Complex Systems:1695, 2006.

[6]

S. Fortunato. Community detection in graphs. Physics Reports, 486(3-5):75--174, 2010.

[7]

S. Fortunato and M. Barthélemy. Resolution limit in community detection. Proceedings of the National Academy of Sciences, 104(1):36--41, 2007.

[8]

S. Fortunato, V. Latora, and M. Marchiori. Method to find community structures based on information centrality. Phys. Rev. E, 70(5):056104, Nov 2004.

[9]

M. Girvan and M. E. J. Newman. Community structure in social and biological networks. Proceedings of the National Academy of Sciences, 99(12):7821--7826, 2002.

[10]

D. Ivanović, G. Milosavljević, B. Milosavljević, and D. Surla. A cerif-compatible research management system based on the marc 21 format. Program: Electronic library and information systems, 44(3):229--251, 2010.

[11]

M. E. J. Newman. The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences, 98(2):404--409, 2001.

[12]

M. E. J. Newman. The structure and function of complex networks. SIAM Rev., 45(2):167--256, 2003.

Digital Library

[13]

M. E. J. Newman. Analysis of weighted networks. Phys. Rev. E, 70(5):056131, 2004.

[14]

M. E. J. Newman. Fast algorithm for detecting community structure in networks. Phys. Rev. E, 69(6):066133, Jun 2004.

[15]

M. E. J. Newman. Finding community structure in networks using the eigenvectors of matrices. Physical Review E, 74(3):036104, 2006.

[16]

M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Phys. Rev. E, 69(2):026113, 2004.

[17]

P. Pons and M. Latapy. Computing communities in large networks using random walks. Journal of Graph Algorithms and Applications, 10(2):191--218, 2006.

[18]

F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi. Defining and identifying communities in networks. Proceedings of the National Academy of Sciences, 101(9):2658--2663, 2004.

[19]

U. N. Raghavan, R. Albert, and S. Kumara. Near linear time algorithm to detect community structures in large-scale networks. Physical Review E, 76(3):036106, 2007.

[20]

M. Rosvall and C. T. Bergstrom. Maps of information flow reveal community structure in complex networks. In Proceedings of the National Academy of Sciences of the United States of America, volume 105, pages 1118--1123, 2007.

[21]

M. Savić, M. Ivanović, M. Radovanović, Z. Ognjanović, A. Pejović, and T. Jakšić Krüger. The structure and evolution of scientific collaboration in Serbian mathematical journals. Scientometrics, 101(3):1805--1830, 2014.

Digital Library

[22]

M. Savić, M. Ivanović, M. Radovanović, Z. Ognjanović, A. Pejović, and T. Jakšić Krüger. Exploratory analysis of communities in co-authorship networks: A case study. In ICT Innovations 2014, volume 311 of Advances in Intelligent Systems and Computing, pages 55--64. Springer International Publishing, 2015.

Cited By

Yu SXia FZhang CWei HKeogh KChen H(2022)Familiarity-Based Collaborative Team Recognition in Academic Social NetworksIEEE Transactions on Computational Social Systems10.1109/TCSS.2021.31290549:5(1432-1445)Online publication date: Oct-2022
https://doi.org/10.1109/TCSS.2021.3129054
Savić MKurbalija VBosnić ZIvanović M(2019)Feature selection based on community detection in feature correlation networksComputing10.1007/s00607-019-00705-8101:10(1513-1538)Online publication date: 1-Oct-2019
https://dl.acm.org/doi/10.1007/s00607-019-00705-8
Savić MIvanović MJain LSavić MIvanović MJain L(2018)Co-authorship Networks: An IntroductionComplex Networks in Software, Knowledge, and Social Systems10.1007/978-3-319-91196-0_5(179-192)Online publication date: 11-May-2018
https://doi.org/10.1007/978-3-319-91196-0_5

Index Terms

A community detection technique for research collaboration networks based on frequent collaborators cores
1. Human-centered computing
  1. Collaborative and social computing
    1. Collaborative and social computing design and evaluation methods
      1. Social network analysis
2. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms

Recommendations

Community-based delurking in social networks
ASONAM '16: Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining

The participation inequality phenomenon in online social networks between the niche of super contributors and the crowd of silent users, a.k.a. lurkers, has been witnessed in many domains. Within this view, understanding the role that lurkers take in ...
Community-based anomaly detection in evolutionary networks

Networks of dynamic systems, including social networks, the World Wide Web, climate networks, and biological networks, can be highly clustered. Detecting clusters, or communities, in such dynamic networks is an emerging area of research; however, less ...
Hidden community detection in social networks

Propose a new conception of hidden community for network analysis.Provide a meta-approach called HICODE for finding the hidden communities.Several weakening methods are proposed to reduce the impact of the detected structure.The framework works ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SAC '16: Proceedings of the 31st Annual ACM Symposium on Applied Computing

April 2016

2360 pages

ISBN:9781450337397

DOI:10.1145/2851613

Conference Chair:
Sascha Ossowski
University Rey Juan Carlos, Spain

Copyright © 2016 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 April 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SAC 2016

Sponsor:

SIGAPP

SAC 2016: Symposium on Applied Computing

April 4 - 8, 2016

Pisa, Italy

Acceptance Rates

SAC '16 Paper Acceptance Rate 252 of 1,047 submissions, 24%;

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25

Sponsor:
sigapp

The 40th ACM/SIGAPP Symposium on Applied Computing

March 31 - April 4, 2025

Catania , Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
78
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)1

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Yu SXia FZhang CWei HKeogh KChen H(2022)Familiarity-Based Collaborative Team Recognition in Academic Social NetworksIEEE Transactions on Computational Social Systems10.1109/TCSS.2021.31290549:5(1432-1445)Online publication date: Oct-2022
https://doi.org/10.1109/TCSS.2021.3129054
Savić MKurbalija VBosnić ZIvanović M(2019)Feature selection based on community detection in feature correlation networksComputing10.1007/s00607-019-00705-8101:10(1513-1538)Online publication date: 1-Oct-2019
https://dl.acm.org/doi/10.1007/s00607-019-00705-8
Savić MIvanović MJain LSavić MIvanović MJain L(2018)Co-authorship Networks: An IntroductionComplex Networks in Software, Knowledge, and Social Systems10.1007/978-3-319-91196-0_5(179-192)Online publication date: 11-May-2018
https://doi.org/10.1007/978-3-319-91196-0_5

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten