The aim of this paper is to introduce and assess three algorithms for the identification of overlapping thematic structures in networks of papers. We implemented three recently proposed approaches to the identification of overlapping and hierarchical substructures in graphs and applied the corresponding algorithms to a network of 492 information-science papers coupled via their cited sources. The thematic substructures obtained and overlaps produced by the three hierarchical cluster algorithms were compared to a content-based categorisation, which we based on the interpretation of titles, abstracts, and keywords. We defined sets of papers dealing with three topics located on different levels of aggregation: h-index, webometrics, and bibliometrics. We identified these topics with branches in the dendrograms produced by the three cluster algorithms and compared the overlapping topics they detected with one another and with the three predefined paper sets. We discuss the advantages and drawbacks of applying the three approaches to paper networks in research fields.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3314014PMC
http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0033255PLOS

Publication Analysis

Top Keywords

overlapping hierarchical
8
thematic structures
8
structures networks
8
three
8
three approaches
8
identification overlapping
8
produced three
8
cluster algorithms
8
algorithms compared
8
identifying overlapping
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!