Main path analysis: Difference between revisions

Revision as of 02:56, 1 December 2021

Revision as of 02:39, 3 April 2023

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|last=Hummon|first=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. The figure shows the global key-route main paths (in red) for a sample citation network (based on search path count and at key-route 1).|220x220px]]

The method begins by measuring the significance of all the links in a citation network through the concept of ‘traversal count’ and then sequentially chains the most significant links into a "main path", which is deemed the most significant historical path in the target [[citation network]]. The method is applicable to any human activity that can be organized in the form of a [[citation network]]. The method is commonly applied to trace the knowledge flow paths or development trajectories of a science or technology field, through bibliographic citations or patent citations.<ref name=":2">{{Cite journal|last=Liu|first=John S.|last2=Lu|first2=Louis Y.Y.|last3=Lu|first3=Wen-Min|last4=Lin|first4=Bruce J.Y.|title=Data envelopment analysis 1978–2010: A citation-based literature survey|journal=Omega|volume=41|issue=1|pages=3–15|doi=10.1016/j.omega.2010.12.006|year=2013}}</ref><ref name="Verspagen 93–115">{{Cite journal|last=Verspagen|first=Bart|date=2007-03-01|title=Mapping technological trajectories as patent citation networks: a study on the history of fuel cell research|journal=Advances in Complex Systems|volume=10|issue=1|pages=93–115|doi=10.1142/S0219525907000945|issn=0219-5259|url=http://collections.unu.edu/view/UNU:1191}}</ref><ref name=":3">{{Cite journal|last=Lucio-Arias|first=Diana|last2=Leydesdorff|first2=Loet|date=2008-10-01|title=Main-path analysis and path-dependent transitions in HistCite™-based historiograms|journal=Journal of the American Society for Information Science and Technology|language=en|volume=59|issue=12|pages=1948–1962|doi=10.1002/asi.20903|issn=1532-2890}}</ref> It has also been applied to judicial decisions to trace the evolving changes of legal opinions.<ref name=":4">{{Cite journal|last=Liu|first=John S.|last2=Chen|first2=Hsiao-Hui|last3=Ho|first3=Mei Hsiu-Ching|last4=Li|first4=Yu-Chen|date=2014-12-01|title=Citations with different levels of relevancy: Tracing the main paths of legal opinions|journal=Journal of the Association for Information Science and Technology|language=en|volume=65|issue=12|pages=2479–2488|doi=10.1002/asi.23135|issn=2330-1643}}</ref> Main path analysis has attracted scholars attention recently. Academic research related to main path analysis saw a fast growing since 2007. A list of academic articles that introduce, explain, apply, modify, or extend the method originated in Hummon and Doreian<ref name=":0" /> can be found [https://davincierlab.weebly.com/list-of-main-path-articles.html here]. Nevertheless, there are issues not broadly discussed in applying the method, including the handling of citation data, choosing a proper traversal weight scheme, search options, and interpretation of the resulting paths.<ref>{{Cite journal|last=Liu|first=John S.|last2=Lu|first2=Louis Y. Y.|last3=Ho|first3=Mei Hsiu-Ching|date=2019-04-01|title=A few notes on main path analysis|url=https://doi.org/10.1007/s11192-019-03034-x|journal=Scientometrics|language=en|volume=119|issue=1|pages=379–391|doi=10.1007/s11192-019-03034-x|issn=1588-2861}}</ref>