Aggregative and stochastic model of main path identification: a case study on graphene

  • Authors:

  • Woondong Yeo;Seonho Kim;Jae-Min Lee;Jaewoo Kang

  • Affiliations:

  • Department of Computer Science & Engineering, Korea University, Seoul, Korea 136-713 and Technology Opportunity Research Team, Korea Institute of Science and Technology Information, Seoul, Korea 1 ...;Technology Opportunity Research Team, Korea Institute of Science and Technology Information, Seoul, Korea 130-741;Technology Opportunity Research Team, Korea Institute of Science and Technology Information, Seoul, Korea 130-741;Department of Computer Science & Engineering, Korea University, Seoul, Korea 136-713

  • Venue:
  • Scientometrics
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper suggests a new method to search main path, as a knowledge trajectory, in the citation network. To enhance the performance and remedy the problems suggested by other researchers for main path analysis (Hummon and Doreian, Social Networks 11(1): 39---63, 1989), we applied two techniques, the aggregative approach and the stochastic approach. The first technique is used to offer improvement of link count methods, such as SPC, SPLC, SPNP, and NPPC, which have a potential problem of making a mistaken picture since they calculate link weights based on a individual topology of a citation link; the other technique, the second-order Markov chains, is used for path dependent search to improve the Hummon and Doreian's priority first search method. The case study on graphene that tested the performance of our new method showed promising results, assuring us that our new method can be an improved alternative of main path analysis. Our method's beneficial effects are summed up in eight aspects: (1) path dependent search, (2) basic research search rather than applied research, (3) path merge and split, (4) multiple main paths, (5) backward search for knowledge origin identification, (6) robustness for indiscriminately selected citations, (7) availability in an acyclic network, (8) completely automated search.