Content deleted Content added
Johnliu.tw (talk | contribs) m Update information box. |
Johnliu.tw (talk | contribs) m Change the level of SPC/SPLC/SPNP headings. |
||
Line 17:
Traversal counts measures the significance of a link. Literature discusses several types of traversal counts, including search path count (SPC), search path link count (SPLC), search path node pair (SPNP), and other variations<ref name=":5" />. All these traversal counts will be noted as SPX.
[[File:SPLC values for a citation network.png|thumb|Figure 2. SPLC values for a sample citation network]]
Search path count (SPC)▼
▲==== Search path count (SPC) ====
A link’s SPC is the number of times the link is traversed if one runs through all possible paths from all the sources to all the sinks. SPC is first proposed by Vladimir Batagelj<ref>Batagelj, V. (2003). Efficient algorithms for citation network analysis. ''arXiv preprint cs/0309023''.</ref>. SPC values for each link in a sample citation network is show in Figure 1. The SPC value for link (B,D) is 5 because five paths (B-D-F-H-K, B-D-F-I-L, B-D-F-I-M-N, B-D-I-L, and B-D-I-M-M) travese through it.
[[File:SPNP values for a citation network.png|thumb|Figure 3. SPNP values for a sample citation network]]
Search path link count (SPLC)▼
▲==== Search path link count (SPLC) ====
A link’s SPLC is the number of times the link is traversed if one runs through all possible paths from all the ancestors of the tail node (including itself) to all the sinks. SPLC is first proposed by Hummon and Doreian<ref name=":0" />. Figure 2 presents the SPLC values for each link in the same citation network as show in Figure 1. Six paths traverse through the link (D,F) thus give it the SPLC value 6. They are: B-D-F-H-K, B-D-F-I-L, B-D-F-I-M-K, D-F-H-K, D-F-I-L, and D-F-I-M-K, noting that all the paths begin either from the ancestor of D, which is B, and D itself.
==== Search path node pair (SPNP) ====
A link’s SPNP is the number of times the link is traversed if one runs through all possible paths from all the ancestors of the tail node (including itself) to all the descendants of the head node (including itself). SPNP is first proposed by Hummon and Doreian<ref name=":0" />. The SPNP values of the link (C,H) is 6 because there are 6 paths that begin from A, B, C (A and B are C's ancestors) and end at H and K (K is H's descendant). These paths are: A-C-H, A-C-H-K, B-C-H, B-C-H-K, C-H, and C-H-K.
| |||