中间性中心性
中心性
相似性(几何)
样品(材料)
节点(物理)
相关系数
样本量测定
数据挖掘
索引(排版)
网络拓扑
相关性
统计
网络科学
网络分析
拓扑指数
复杂网络
拓扑(电路)
数学
计算机科学
人工智能
组合数学
工程类
物理
计算机网络
万维网
结构工程
电气工程
几何学
热力学
图像(数学)
作者
Pankush Kalgotra,Ramesh Sharda,Andy Luse
标识
DOI:10.1016/j.ijinfomgt.2020.102229
摘要
Some networks are explicit where members make direct connections (e.g. Facebook network), whereas other networks are implicit (e.g. co-citation network) in which an edge between two nodes is inferred using a similarity index. Choosing the right index to infer connections in an implicit/inferred network is important because conclusions can be biased if a network does not represent true relationships. In this study, we compared two indexes: Phi Correlation Coefficient (PCC) and Ochiai Coefficient (Och) based on their sensitivity to the sample size of transactions from where the network is inferred. For demonstration, we used an implicit network, called a comorbidity network, developed from health records of 22.1 million patients. The networks were compared based on their overall topologies and node centralities. Results showed that the network formed using Och was more robust to the sample size than PCC. The network using Och followed a small-world topology irrespective of the sample size whereas the structure of a network using PCC was inconsistent. Regarding node centralities, the betweenness centrality was most affected by the sample size. Our results lead us to recommend Och over PCC.
科研通智能强力驱动
Strongly Powered by AbleSci AI