Scientific community detection via bipartite scholar/journal graph co-clustering

被引:23
|
作者
Carusi, Chiara [1 ]
Bianchi, Giuseppe [1 ]
机构
[1] Univ Roma Tor Vergata, Elect Engn Dept, Rome, Italy
关键词
Community detection; Scientometrics; Clustering; Bipartite Graph analysis; CLASSIFICATION SYSTEMS; COMPLEX NETWORKS; RANDOM-WALKS; SCIENCE; INTERDISCIPLINARITY; FIELD; INDICATORS; CENTRALITY; MAPS;
D O I
10.1016/j.joi.2019.01.004
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper stems from the observation that researchers in different fields tend to publish in different journals. Such a relationship between researchers and journals is quantitatively exploited to identify scientific community clusters, by casting the community detection problem into a co-clustering problem on bipartite graphs. Such an approach has the potential of leading not only to the fine- grained detection of scholar communities based on the similarity of their research activity, but also to the clustering of scientific journals based on which are the most representative of each community. The proposed methodology is purely data-driven and completely unsupervised, and does not rely on any semantics (e.g. keywords or a-priori subjective categories). Moreover, unlike "flat" data structures (e.g. collaboration graphs or citation graphs) our bipartite graph approach blends in a joint structure both the researcher's attitude and interests (i.e., freedom to select the venue where to publish) as well as the community's recognition (i.e., acceptance of the publication on a target journal); as such may perhaps inspire further scientometric evaluation strategies. Our proposed approach is applied to the Italian research system, for two broad areas (ICT and Microbiology&Genetics), and reveals some questionable aspects and community overlaps in the current Italian scientific sectors classification. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页码:354 / 386
页数:33
相关论文
共 50 条
  • [21] An Overview of Co-Clustering via Matrix Factorization
    Lin, Renjie
    Wang, Shiping
    Guo, Wenzhong
    IEEE ACCESS, 2019, 7 : 33481 - 33493
  • [22] Network Anomaly Detection using Co-clustering
    Papalexakis, Evangelos E.
    Beutel, Alex
    Steenkiste, Peter
    2012 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM), 2012, : 403 - 410
  • [23] Auto-weighted multi-view co-clustering with bipartite graphs
    Huang, Shudong
    Xu, Zenglin
    Tsang, Ivor W.
    Kang, Zhao
    INFORMATION SCIENCES, 2020, 512 (512) : 18 - 30
  • [24] Subspace Co-clustering with Two-Way Graph Convolution
    Fettal, Chakib
    Labiod, Lazhar
    Nadif, Mohamed
    PROCEEDINGS OF THE 31ST ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, CIKM 2022, 2022, : 3938 - 3942
  • [25] Sense Discovery via Co-Clustering on Images and Text
    Chen, Xinlei
    Ritter, Alan
    Gupta, Abhinav
    Mitchell, Tom
    2015 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2015, : 5298 - 5306
  • [26] CoDiNMF: Co-Clustering of Directed Graphs via NMF
    Lim, Woosang
    Du, Rundong
    Park, Haesun
    THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 3611 - 3618
  • [27] A Fuzzy Co-Clustering Algorithm via Modularity Maximization
    Liu, Yongli
    Chen, Jingli
    Chao, Hao
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2018, 2018
  • [28] Graph modularity maximization as an effective method for co-clustering text data
    Ailem, Melissa
    Role, Francois
    Nadif, Mohamed
    KNOWLEDGE-BASED SYSTEMS, 2016, 109 : 160 - 173
  • [29] Joint nonnegative matrix factorization and network embedding for graph co-clustering
    Wang, Yan
    Ma, Xiaoke
    Ma, Xiaoke (xkma@xidian.edu.cn), 1600, Elsevier B.V. (462): : 453 - 465
  • [30] Sparse dual graph-regularized NMF for image co-clustering
    Sun, Jing
    Wang, Zhihui
    Sun, Fuming
    Li, Haojie
    NEUROCOMPUTING, 2018, 316 : 156 - 165