Content deleted Content added
No edit summary |
Citation bot (talk | contribs) Add: authors 1-1. Removed URL that duplicated identifier. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Abductive | Category:Social networks | #UCB_Category 73/125 |
||
(8 intermediate revisions by 7 users not shown) | |||
Line 1:
{{Short description|Mathematical tool}}
'''Main path analysis''' is a mathematical tool, first proposed by [[Norman P. Hummon|Hummon]] and [[Patrick Doreian|Doreian]] in 1989,<ref name=":0">{{Cite journal|last1=Hummon|first1=Norman P.|last2=Doreian|first2=Patrick|year=1989|title=Connectivity in a citation network: The development of DNA theory|journal=Social Networks|volume=11|issue=1|pages=39–63|doi=10.1016/0378-8733(89)90017-8}}</ref> to identify the major paths in a [[citation network]], which is one form of a [[directed acyclic graph]] (DAG). It has since become an effective technique for mapping technological trajectories, exploring scientific knowledge flows, and conducting literature reviews. [[File:Global key-route main paths for a citation network.svg|thumb|Main path analysis uncovers the most significant paths, or citation chains, in a citation network.
== History ==
Main path analysis is first proposed in Hummon and Doreian (1989)<ref name=":0" /> in which they suggest a different approach for analyzing a citation network "where the connective threads through a network are preserved and the focus is on the links in the network rather than on the nodes."<ref name=":0" /> They call the resulting chain of the most used citation links "main path" and claim that "It is our intuition that the main path, selected on the basis of the most used path will identify the main stream of a literature." The idea was verified using a set of DNA research articles. To make the method more practical, Liu and Lu (2012)<ref name=":1">{{Cite journal|
== The method ==
Line 20:
==== 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 shown in Figure 1. The SPC value for the 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-
[[File:SPNP values for a citation network.png|thumb|Figure 3. SPNP values for a sample citation network]]
Line 47:
== The Variants ==
In addition to the key-route search approach, variations of the method include the approach that is aggregative and stochastic,<ref>{{Cite journal|
== Applications ==
Line 53:
=== Academic article ===
Academic citation databases such as [[Web of Science]] and [[Scopus]] include comprehensive digitized citation information. These information make it possible to apply main path analysis to examine the knowledge structure or trace the knowledge flow of any scientific fields. Some early applications explores the subject of centrality-productivity,<ref>{{Cite journal|
=== Patent ===
Patents referencing prior arts is a common practice. For example, each United States patent document includes a "References Cited" section that lists the prior arts of the patent. Patent databases such as [[Clarivate Analytics]] and Webpat provide digitized patent citation information. Verspagen (2007)<ref name="Verspagen 93–115"/> and Mina (2007)<ref>{{Cite journal|
=== Judicial document ===
|