Abstract

Clustering methods are applied regularly in the bibliometric literature to identify research areas or scientific fields. These methods are for instance used to group publications into clusters based on their relations in a citation network. In the network science literature, many clustering methods, often referred to as graph partitioning or community detection techniques, have been developed. Focusing on the problem of clustering the publications in a citation network, we present a systematic comparison of the performance of a large number of these clustering methods. Using a number of different citation networks, some of them relatively small and others very large, we extensively study the statistical properties of the results provided by different methods. In addition, we also carry out an expert-based assessment of the results produced by different methods. The expert-based assessment focuses on publications in the field of scientometrics. Our findings seem to indicate that there is a trade-off between different properties that may be considered desirable for a good clustering of publications. Overall, map equation methods appear to perform best in our analysis, suggesting that these methods deserve more attention from the bibliometric community.

Highlights

  • There is an extensive literature on the topic of graph partitioning and community detection in networks [1]

  • Which methods for graph partitioning and community detection perform best in practice? The literature does not provide a clear answer to this question, and if the question can be answered at all, most likely the answer will be dependent on the type of network that is being studied and on the type of partitioning that one is interested in

  • Which methods for graph partitioning and community detection perform best for the purpose of grouping scientific publications into clusters? In this paper, we have carried out an extensive analysis comparing the performance of a large number of methods

Read more

Summary

Introduction

There is an extensive literature on the topic of graph partitioning and community detection in networks [1]. This literature studies methods for partitioning the nodes in a network into a number of groups, often referred to as communities or clusters. Which methods for graph partitioning and community detection perform best in practice? The literature does not provide a clear answer to this question, and if the question can be answered at all, most likely the answer will be dependent on the type of network that is being studied and on the type of partitioning that one is interested in. Which methods for graph partitioning and community detection perform best in practice? The literature does not provide a clear answer to this question, and if the question can be answered at all, most likely the answer will be dependent on the type of network that is being studied and on the type of partitioning that one is interested in.

Methods
Results
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.