2 ALGORITHMS FOR COMPUTING REGULAR EQUIVALENCE
2 ALGORITHMS FOR COMPUTING REGULAR EQUIVALENCE
复制标题
DOI：
10.1016/0378-8733(93)90012-a
复制
发表时间：
1993-12-01
期刊：
影响因子：
3.1
通讯作者：
EVERETT, MG
中科院分区：
文献类型：
--
作者：
BORGATTI, SP;EVERETT, MG
在本文中，我们提出了两个算法计算的范围之间的定期等价网络中的节点对。第一种算法，REGE，是众所周知的，但以前没有在文献中描述。第二个算法，CATREGE，是新的。REGE适用于定量数据，而CATREGE适用于分类数据。对于二进制数据，可以使用任一算法，尽管CATREGE算法明显更快并且其输出相似性系数具有更好的度量属性。CATREGE算法在教学上也很有用，因为它更容易掌握。
In this paper we present two algorithms for computing the extent of regular equivalence among pairs of nodes in a network. The first algorithm, REGE, is well known, but has not previously been described in the literature. The second algorithm, CATREGE, is new. Whereas REGE is applicable to quantitative data, CATREGE is used for categorical data. For binary data, either algorithm may be used, though the CATREGE algorithm is significantly faster and its output similarity coefficients have better metric properties. The CATREGE algorithm is also useful pedagogically, because it is easier to grasp.