Academic social networks: Modeling, analysis, mining and applications
The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Abstract
In the fast-growing scholarly big data background, social network technologies have recently aroused widespread attention in academia and industry. The concept of academic social networks is created precisely in the context of scholarly big data, which refers to the complicated academic network formed by academic entities and their relationships. There are a wealth of scholarly big data processing methods to analyze the rich structural types and related information about academic social networks. Nowadays, various academic data can be easily obtained, which makes it easier for us to analyze and study academic social networks. This study investigates the background, the current status, and trends of academic social networks. We first elaborate on the concept of academic social networks and related research background. Secondly, we analyze models based on nodes' types and timeliness. Thirdly, we review analytical methods, including relevant metrics, network properties, and available academic analysis tools. Furthermore, we sort out some key mining technologies for academic social networks. Finally, we systematically review representative research tasks in this domain from three levels: actor, relationship, and network. In addition, some academic social networking sites are presented. This survey concludes with the current challenges and open issues.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
ImageNet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2017) · Communications of the ACM · doi:10.1145/3065386 · Cited by 112,155
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931 · cited 2×
“Modularity is first proposed by Newman and Girvan (2004), which is a commonly used criterion for determining the quality of network partitions.”
Gephi: An Open Source Software for Exploring and Manipulating Networks
Bastian, M., Heymann, S., & Jacomy, M. (2009) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v3i1.13937 · Cited by 11,675
An index to quantify an individual’s scientific research output
Hirsch, J. E. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0507655102 · Cited by 11,669
Exploring Network Structure, Dynamics, and Function Using NetworkX
Hagberg, A. A., Schult, D. A., & Swart, P. J. (2008) · Proceedings of the Python in Science Conference · doi:10.25080/tcwv9851 · Cited by 7,477 · cited 2×
“…(Van Eck and Waltman, 2014), Gephi (Bastian et al., 2009), HistCite (Garfield and Pudovkin, 2004), iGraph (Csardi and Nepusz, 2006), NetworkX (Hagberg et al., 2008), NodeXL (Smith et al., 2009), Pajek (Batagelj and Mrvar, 2004), Sci2 (Team, 2009), UCINet (Borgatti et al., 2002), VOSviewer…”
XGBoost: A Scalable Tree Boosting System
Chen, T., & Guestrin, C. (2016) · arXiv · doi:10.48550/arxiv.1603.02754 · Cited by 7,104
Uncovering the overlapping community structure of complex networks in nature and society
Palla, G., Derényi, I., Farkas, I., & Vicsek, T. (2005) · Nature · doi:10.1038/nature03607 · Cited by 5,373
BIRCH: an efficient data clustering method for very large databases
Zhang, T., Ramakrishnan, R., & Livny, M. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233324 · Cited by 3,935
The Increasing Dominance of Teams in Production of Knowledge
Wuchty, S., Jones, B. F., & Uzzi, B. (2007) · Science · doi:10.1126/science.1136099 · Cited by 3,615
Resolution limit in community detection
Fortunato, S., & Barthélemy, M. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0605965104 · Cited by 3,024 · cited 1×
“Besides, the resolution of modularity makes it difficult or even impossible to identify small size communities in large-scale academic social networks (Fortunato and Barthelemy, 2007).”
Searching for intellectual turning points: progressive knowledge domain visualization
Chen, C. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307513100 · Cited by 2,791 · cited 3×
“Barabâsi et al. (2002) and Newman (2001, 2004), respectively, made groundbreaking research contributions to exploring collaboration networks.”
Richardson, M., & Domingos, P. (2006) · Machine Learning · doi:10.1007/s10994-006-5833-1 · Cited by 2,676
Barabási, A.-L., & Bonabeau, E. (2003) · Scientific American · doi:10.1038/scientificamerican0503-60 · Cited by 2,494
Barthélemy, M. (2011) · Physics Reports · doi:10.1016/j.physrep.2010.11.002 · Cited by 2,469
ArnetMiner: extraction and mining of academic social networks
Tang, J., Zhang, J., Yao, L., Li, J., Zhang, L., & Su, Z. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1402008 · Cited by 2,231
Hierarchical structure and the prediction of missing links in networks
Clauset, A., Moore, C., & Newman, M. E. J. (2008) · Nature · doi:10.1038/nature06830 · Cited by 2,171 · cited 1×
“Among them, CNM is a classical greedy-type algorithm proposed by Clauset, Newman, and Moore with the computational complexity of O ( n log 2 n ) (Clauset et al., 2008).”
Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
Mucha, P. J., Richardson, T., Macon, K., Porter, M. A., & Onnela, J.-P. (2010) · Science · doi:10.1126/science.1184819 · Cited by 2,123 · cited 2×
“A multiplex network formed 1640 college students in an American university that had several relationships, i.e., Facebook friendships, picture friend-ships, roommates, and housing-group preferences (Mucha and Onnela, 2010).”
Fortunato, S., Bergstrom, C. T., Börner, K., Evans, J. A., Helbing, D., Milojević, S., Petersen, A. M., Radicchi, F., Sinatra, R., Uzzi, B., et al. (2018) · Science · doi:10.1126/science.aao0185 · Cited by 1,497 · cited 2×
“Science of Science (SciSci) characterizes science as a complex, self-organizing and evolving network of academic information (Fortunato et al., 2018).”
Challenges of Big Data analysis
Fan, J., Han, F., & Liu, H. (2014) · National Science Review · doi:10.1093/nsr/nwt032 · Cited by 1,482
Multi-University Research Teams: Shifting Impact, Geography, and Stratification in Science
Jones, B. F., Wuchty, S., & Uzzi, B. (2008) · Science · doi:10.1126/science.1158357 · Cited by 812
Dynamic social networks promote cooperation in experiments with humans
Rand, D. G., Arbesman, S., & Christakis, N. A. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1108243108 · Cited by 653
Bibliometrics of social media research: A co-citation and co-word analysis
Leung, X. Y., Sun, J., & Bai, B. (2017) · International Journal of Hospitality Management · doi:10.1016/j.ijhm.2017.06.012 · Cited by 546 · cited 1×
“Co-word analysis has developed to address this kind of analytical problem (Leung et al., 2017).”
Finding scientific gems with Google’s PageRank algorithm
Chen, P., Xie, H., Maslov, S., & Redner, S. (2007) · Journal of Informetrics · doi:10.1016/j.joi.2006.06.001 · Cited by 483
Co-author Relationship Prediction in Heterogeneous Bibliographic Networks
Sun, Y., Barber, R., Gupta, M., Aggarwal, C. C., & Han, J. (2011) · 2011 International Conference on Advances in Social Networks Analysis and Mining · doi:10.1109/asonam.2011.112 · Cited by 445 · cited 1×
“Sun et al. (2011) analyzed co-authorship and citation relationships in heterogeneous networks of DBLP to predict co-authorship.”
Content‐based citation analysis: The next generation of citation analysis
Ding, Y., Zhang, G., Chambers, T., Song, M., Wang, X., & Zhai, C. (2014) · Journal of the Association for Information Science and Technology · doi:10.1002/asi.23256 · Cited by 252
FaBiO and CiTO: Ontologies for describing bibliographic resources and citations
Peroni, S., & Shotton, D. (2012) · Journal of Web Semantics · doi:10.1016/j.websem.2012.08.001 · Cited by 212 · cited 1×
“Ontology is a formal and detailed description of the shared conceptual system (Peroni and Shotton, 2012).”
Some Modifications to the SNIP Journal Impact Indicator
Waltman, L., van Eck, N. J., van Leeuwen, T. N., & Visser, M. S. (2013) · Journal of Informetrics · doi:10.1016/j.joi.2012.11.011 · Cited by 191
Network Effects on Scientific Collaborations
Uddin, S., Hossain, L., & Rasmussen, K. (2013) · PLoS ONE · doi:10.1371/journal.pone.0057546 · Cited by 160
Structure and evolution of co-authorship network in an interdisciplinary research field
Liu, P., & Xia, H. (2015) · Scientometrics · doi:10.1007/s11192-014-1525-y · Cited by 84
Cited by
A Comprehensive Survey on Deep Graph Representation Learning
Ju, W., Fang, Z., Gu, Y., Liu, Z., Long, Q., Qiao, Z., Qin, Y., Shen, J., Sun, F., Xiao, Z., et al. (2024) · Neural Networks · doi:10.1016/j.neunet.2024.106207 · Cited by 341
Khan, W., Kumar, T., Zhang, C., Raj, K., Roy, A. M., & Luo, B. (2023) · Big Data and Cognitive Computing · doi:10.3390/bdcc7020097 · Cited by 143
Metadata
- Authors
- Kong, X., Shi, Y., Yu, S., Liu, J., & Xia, F.
- Venue
- Journal of Network and Computer Applications
- Publisher
- Elsevier BV
- Published
- 2019-04
- Volume
- 132
- Pages
- 86-103
- ISSN
- 1084-8045 (ISSN-L)
- OpenAlex
- W2913350752
- Cited by
- 200
- References
- 29
- FWCI
- 9.85
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.