Shortest path-based centrality metrics in attributed graphs with node-individual context constraints

被引:2
|
作者
Schoenfeld, Mirco [1 ]
Pfeffer, Juergen [2 ]
机构
[1] Univ Bayreuth, Nuernberger Str 38, D-95448 Bayreuth, Germany
[2] Bavarian Sch Publ Policy, Richard Wagner Str 1, D-80333 Munich, Germany
关键词
Attributed network; Betweenness centrality; Closeness centrality; Contextual embeddedness; NETWORKS;
D O I
10.1016/j.socnet.2021.10.004
中图分类号
Q98 [人类学];
学科分类号
030303 ;
摘要
Centrality measurements are a well-known method to assess the importance of actors in networks. They are easy to obtain and provide a versatile interpretability adaptable to the meaning of nodes and edges. The current centrality measurements use structural information alone. In real-world situations, however, actors and the connections between them are subject to contextual settings and can be significantly influenced by these settings. In fact, such real-world observations are often modeled using attributed networks in which contextual information can be associated as attributes to nodes and edges. However, this information is disregarded when evaluating the importance of actors in terms of network centrality measurements. Hence, this paper proposes a method for obtaining shortest path-based centrality measurements for attributed networks that exploit attribute information on nodes for shortest path calculations. We add abstracts of scientific publications to a co-publishing network and use topic models to create node-individual context constraints for shortest path calculations. This creates additional analytic opportunities and can aid in gaining a detailed understanding of complex social networks.
引用
收藏
页码:93 / 103
页数:11
相关论文
共 1 条
  • [1] Detecting Communities from Heterogeneous Graphs: A Context Path-based Graph Neural Network Model
    Luo, Linhao
    Fang, Yixiang
    Cao, Xin
    Zhang, Xiaofeng
    Zhang, Wenjie
    PROCEEDINGS OF THE 30TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, CIKM 2021, 2021, : 1170 - 1180