全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
PLOS ONE  2012 

Identifying Overlapping and Hierarchical Thematic Structures in Networks of Scholarly Papers: A Comparison of Three Approaches

DOI: 10.1371/journal.pone.0033255

Full-Text   Cite this paper   Add to My Lib

Abstract:

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.

References

[1]  Van Raan A (2004) Measuring science. In: Moed HF, Gl?nzel W, Schmoch U, editors. Handbook of quantitative science and technology research: The use of publication and patent statistics in studies of S&T systems. pp. 19–50. Dordrecht etc.: Kluwer, chapter 11.
[2]  Zitt M, Ramanana-Rahary S, Bassecoulard E (2005) Relativity of citation performance and excellence measures: From cross-field to cross-scale effects of field-normalisation. Scientometrics 63: 373–401.
[3]  Janssens F, Gl?nzel W, De Moor B (2008) A hybrid mapping of information science. Scientometrics 75: 607–631.
[4]  Klavans R, Boyack K (2011) Using global mapping to create more accurate document-level maps of research fields. Journal of the American Society for Information Science and Technology 62: 1–18.
[5]  Sullivan D, White D, Barboni E (1977) Co-citation analyses of science: An evaluation. Social Studies of Science 7: 223–240.
[6]  Amsterdamska O, Leydesdorff L (1989) Citations: Indicators of significance? Scientometrics 15: 449–471.
[7]  Marshakova IV (1973) Sistema svyazey mezhdu dokumentami, postroyennaya na osnove ssylok (po ukazatelyu “Science Citation Index”). Nauchno-Tekhnicheskaya Informatsiya Seriya 2 – Informatsionnye Protsessy i Sistemy 6: 3–8.
[8]  Small H (1973) Co-citation in the Scientific Literature: A New Measure of the Relationship Between Two Documents. Journal of the American Society for Information Science 24: 265–269.
[9]  Lancichinetti A, Radicchi F, Ramasco JJ, Fortunato S (2011) Finding statistically significant communities in networks. PLoS ONE 6: e18961.
[10]  Xie J, Kelley S, Szymanski BK (2011) Overlapping Community Detection in Networks: the State of the Art and Comparative Study. ArXiv preprint arXiv 1110.5813..
[11]  Gl?ser J (2006) Wissenschaftliche Produktionsgemeinschaften: Die soziale Ordnung der Forschung. Campus Verlag.
[12]  Fortunato S (2010) Community detection in graphs. Physics Reports 486: 75–174.
[13]  Mitesser O, Heinz M, Havemann F, Gl?ser J (2008) Measuring diversity of research by extracting latent themes from bipartite networks of papers and references. In: Kretschmer H, Havemann F, editors. Proceedings of WIS 2008: Fourth International Conference on Webometrics, Informetrics and Scientometrics & Ninth COLLNET Meeting. Humboldt-Universit?t zu Berlin. Berlin: Gesellschaft für Wissenschaftsforschung.
[14]  Wang X, Jiao L, Wu J (2009) Adjusting from disjoint to overlapping community detection of complex networks. Physica A: Statistical Mechanics and its Applications 388: 5045–5056.
[15]  Ahn Y, Bagrow J, Lehmann S (2010) Link communities reveal multiscale complexity in networks. Nature 466: 761–764.
[16]  Lancichinetti A, Fortunato S, Kertesz J (2009) Detecting the overlapping and hierarchical community structure in complex networks. New Journal of Physics 11: 033015.
[17]  Zachary W (1977) An information ow model for conict and fission in small groups. Journal of Anthropological Research 33: 452–473.
[18]  Tibély G (2012) Criterions for locally dense subgraphs. Physica A: Statistical Mechanics and its Applications 391: 1831–1847.
[19]  Friggeri A, Chelius G, Fleury E (2011) Ego-munities, exploring socially cohesive person-based communities. Arxiv preprint arXiv: 1102.2623..
[20]  Radicchi F, Castellano C, Cecconi F, Loreto V, Parisi D (2004) Defining and identifying communities in networks. Proceedings of the National Academy of Sciences of the United States of America 101: 2658–2663.
[21]  Gregory S (2011) Fuzzy overlapping communities in networks. Journal of Statistical Mechanics: Theory and Experiment 2011: P02017.
[22]  Baumes J, Goldberg M, Krishnamoorthy M, Magdon-Ismail M, Preston N (2005) Finding communities by clustering a graph into overlapping subgraphs. International Conference on Applied Computing (IADIS 2005). pp. 97–104.
[23]  Baumes J, Goldberg M, Magdon-Ismail M (2005) Efficient identification of overlapping communities. Intelligence and Security Informatics 3495: 27–36.
[24]  Clauset A (2005) Finding local community structure in networks. Physical Review E 72: 26132.
[25]  Lee C, Reid F, McDaid A, Hurley N (2011) Seeding for pervasively overlapping communities. Physical Review E 83: 066107.
[26]  Havemann F, Heinz M, Struck A, Gl?ser J (2011) Identification of Overlapping Communities and their Hierarchy by Locally Calculating Community-Changing Resolution Levels. Journal of Statistical Mechanics: Theory and Experiment 2011: P01023.
[27]  Havemann F, Heinz M, Struck A, Gl?ser J (2010) Identification of overlapping communities by locally calculating community-changing resolution levels. Poster at ASONAM conference, Odense, Denmark, August 2010, arXiv preprint 1008.1004.
[28]  Lee C, Reid F, McDaid A, Hurley N (2010) Detecting highly overlapping community structure by greedy clique expansion. Proceedings of the 4th SNA-KDD Workshop. ArXiv preprint arxiv: . 1002.1827. p.
[29]  Evans T, Lambiotte R (2009) Line graphs, link partitions, and overlapping communities. Physical Review E 80: 16105.
[30]  Ball B, Karrer B, Newman M (2011) Efficient and principled method for detecting communities in networks. Physical Review E 84: 036103.
[31]  Kim Y, Jeong H (2011) Map equation for link communities. Phys Rev E 84: 026110.
[32]  Rosvall M, Bergstrom C (2008) Maps of random walks on complex networks reveal community structure. Proceedings of the National Academy of Sciences 105: 1118.
[33]  Ghosh S, Kane P, Ganguly N (2011) Identifying overlapping communities in folksonomies or tripartite hypergraphs. Proceedings of the 20th international conference companion on World Wide Web. ACM. pp. 39–40.
[34]  Gregory S (2010) Finding overlapping communities in networks by label propagation. New Journal of Physics 12: 103018.
[35]  Janssens F, Zhang L, Moor B, Gl?nzel W (2009) Hybrid clustering for validation and improvement of subject-classification schemes. Information Processing & Management 45: 683–702.
[36]  Blondel V, Guillaume J, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment 2008: P10008.
[37]  Sales-Pardo M, Guimerà R, Moreira A, Amaral L (2007) Extracting the hierarchical organization of complex systems. Proceedings of the National Academy of Sciences 104: 15224.
[38]  Clauset A, Moore C, Newman MEJ (2008) Hierarchical structure and the prediction of missing links in networks. Nature 453: 98–101.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133