有价值的联系告诉更少的谎言，II：为什么不对具有有界外度的网络边进行二分
Valued Ties Tell Fewer Lies, II: Why Not To Dichotomize Network Edges With Bounded Outdegrees
摘要：
已经提出了各种方法来创建一个复杂网络的二进制版本与价值的关系。而不是选择一个单一的阈值二分法的默认方法，我们考虑的方法，选择最高的k出站弧从每个人，并分配一个二进制领带，因为这具有最小化的孤立的节点，否则可能是弱连接的优势。然而，模拟和真实数据集表明，这种方法比默认阈值方法更差，通常不应被视为处理有值网络。
英文摘要：
Various methods have been proposed for creating a binary version of a complex network with valued ties. Rather than the default method of choosing a single threshold value about which to dichotomize, we consider a method of choosing the highest k outbound arcs from each person and assigning a binary tie, as this has the advantage of minimizing the isolation of nodes that may otherwise be weakly connected. However, simulations and real data sets establish that this method is worse than the default thresholding method and should not be generally considered to deal with valued networks.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
