Jiang, X.; Zhu, X.; Chen, J.: Main path analysis on cyclic citation networks (2020)
0.01
0.00918649 = product of:
0.02755947 = sum of:
0.02755947 = product of:
0.08267841 = sum of:
0.08267841 = weight(_text_:network in 5813) [ClassicSimilarity], result of:
0.08267841 = score(doc=5813,freq=6.0), product of:
0.19402927 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.043569047 = queryNorm
0.42611307 = fieldWeight in 5813, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.0390625 = fieldNorm(doc=5813)
0.33333334 = coord(1/3)
0.33333334 = coord(1/3)
- Abstract
- Main path analysis is a famous network-based method for understanding the evolution of a scientific domain. Most existing methods have two steps, weighting citation arcs based on search path counting and exploring main paths in a greedy fashion, with the assumption that citation networks are acyclic. The only available proposal that avoids manual cycle removal is to preprint transform a cyclic network to an acyclic counterpart. Through a detailed discussion about the issues concerning this approach, especially deriving the "de-preprinted" main paths for the original network, this article proposes an alternative solution with two-fold contributions. Based on the argument that a publication cannot influence itself through a citation cycle, the SimSPC algorithm is proposed to weight citation arcs by counting simple search paths. A set of algorithms are further proposed for main path exploration and extraction directly from cyclic networks based on a novel data structure main path tree. The experiments on two cyclic citation networks demonstrate the usefulness of the alternative solution. In the meanwhile, experiments show that publications in strongly connected components may sit on the turning points of main path networks, which signifies the necessity of a systematic way of dealing with citation cycles.
