cora — CORA citations (1998)
- Description
Citations among computer science research papers from the Cora collection, assembled by A. McCallum and collaborators in the late 1990s for the Cora research paper search engine. Cora gathered research papers from the web, automatically extracted their references, and classified the papers into a hierarchy of computer science topics. The network was extracted from the Cora data by L. Šubelj and M. Bajec, and contains only papers that were assigned a topic. Nodes are papers and a directed edge $(i,j)$ indicates that paper $i$ cites paper $j$. Citations to papers outside the data set are excluded. The dates of the papers are not included.
The network has the following properties:
- (Node)
cora_id: the paper ID in the original Cora data set. - (Node)
topic: the topic of the paper in the Cora topic hierarchy, given as a path, e.g./Artificial_Intelligence/Machine_Learning/Neural_Networks/(70 topics in total).
- (Node)
- Tags
- Informational Citation Unweighted Metadata
- Added
- 2020-08-11
- Citation
-
- A. McCallum, K. Nigam, J. Rennie, K. Seymore, "Automating the Construction of Internet Portals with Machine Learning." Information Retrieval 3(2), 127-163 (2000) 10.1023/A:1009953814988 Sci-Hub
- L. Šubelj, M. Bajec, "Model of complex networks based on citation dynamics." Proceedings of the 22nd International Conference on World Wide Web (LSNA '13), 527-530 (2013) 10.1145/2487788.2487987 Sci-Hub
- Upstream URL OK
- http://wwwlovre.appspot.com/support.jsp
- Networks
-
Tip: hover over a column header for a description.
Column legend
- $\left<k\right>$
- Mean degree
- $\sigma_k$
- Standard deviation of the degrees
- $\lambda_h$
- Largest eigenvalue of the Hashimoto (non-backtracking) matrix
- $\tau$
- Random walk mixing time
- $r$
- Degree assortativity
- $c$
- Global clustering coefficient
- $\oslash$
- (Pseudo-) diameter
- $S$
- Relative size of the largest component
- NPs
- Node properties
- EPs
- Edge properties
- Ridiculograms*
-