Difference between revisions of "E.A. Leicht, Structure of Time Evo citation networks 2007"
From Cohen Courses
Jump to navigationJump to search| Line 13: | Line 13: | ||
== '''Brief Description of Three Analysis Methods''' == | == '''Brief Description of Three Analysis Methods''' == | ||
| − | * A mixture model of citation process makes use of [expectation-maximization algorithm]. | + | * A mixture model of citation process makes use of [[expectation-maximization algorithm]]. |
* | * | ||
* | * | ||
== '''Related Papers''' == | == '''Related Papers''' == | ||
Revision as of 12:17, 3 February 2011
Contents
Citation
E.A. Leicht, G. Clarkson, K. Shedden, and M.E.J. Newman.2007. Large-scale structure of time evolving citation networks.In European Physical Journal B.-Volume 59, P75–83.
Online Version
Structure of Time Evolving Citation Networks
Summary
This paper uses three methods to examine the structure of large-scale networks (focus in particular on citation networks//link needed) that evolve over time. This paper demonstrates how each of these methods can divide the structure of large-scale network. A network of citations between opinions of the United States Supreme Court is used as an example in this paper.
Brief Description of Three Analysis Methods
- A mixture model of citation process makes use of expectation-maximization algorithm.
