##simple d3.js graph ###add nodes with a click.
(cheers to mike bostock!)
import urllib.request | |
import json | |
url = 'https://doi.org/10.1038/s41586-019-1863-2' | |
headers = {'Accept': 'application/citeproc+json'} | |
req = urllib.request.Request(url, {}, headers) | |
with urllib.request.urlopen(req) as response: | |
doi_metadata = response.read() | |
doi_json = json.loads(doi_metadata) | |
print(doi_json["ISSN"]) |
= Modeling the claims store using Neo4j | |
First, let's add some items to the store. One of the DOIs has two ORCIDs in its metadata. | |
//setup | |
[source,cypher] | |
---- | |
CREATE (doi1:output {name:'10.123/abcd'}) | |
CREATE (orcid1:person {name:'0000-1111-1111-1111'}) | |
CREATE (doi2:output {name:'10.123/efgh'}) | |
CREATE (doi1)-[:CreatedBy]->(orcid1) |
= Exploring the ORCiD graph | |
:neo4j-version: 2.2.0 | |
:author: Kenny Bastani | |
:twitter: @kennybastani | |
:description: Graph database access control, entitlements, authorization solutions | |
:tags: domain:finance, use-case:access-control | |
This interactive Neo4j graph examines how ORCiD could be represented as a property graph and the advantages of doing so | |
''' |
10.1002 | Wiley Blackwell (John Wiley & Sons) | 111 River Street Hoboken, NJ 07030 USA | |
---|---|---|---|
10.1155 | Hindawi Publishing Corporation | Nasr City Free Zone Cairo, 11816 Egypt | |
10.1142 | World Scientific | No 5 Toh Tuck Link 596224 Singapore | |
10.1111 | Wiley Blackwell (Blackwell Publishing) | 111 River Street Hoboken, NJ 07030 USA | |
10.3109 | Informa UK (Informa Healthcare) | ||
10.1007 | Springer-Verlag | Van Godewijckstraat 30 Dordrecht, GX 3311 The Netherlands | |
10.1016 | Elsevier | 360 Park Ave South New York, NY 10010 USA | |
10.3402 | Co-Action Publishing | Haggebyholmsvagen 5 Balsta, 74694 Sweden | |
10.1017 | Cambridge University Press | The Edinburgh Bldg Shaftesbury Rd Cambridge, CB2 2RU UK | |
10.1080 | Informa UK (Taylor & Francis) | 4 Park Square Milton Park, Abingdon, OXON OX14 4RN UK |
prefix | publisher | journals | dois | |
---|---|---|---|---|
10.12679 | 0 | 0 | ||
10.7579 | 123Doc Education | 0 | 0 | |
10.3731 | 21st Century COE Program (Toplogical Science and Technology) | 1 | 40 | |
10.5775 | A. I. Rosu Cultural Scientific Foundation Fundatia cultural-stiintifica A. I. Rosu | 1 | 80 | |
10.4037 | AACN Publishing | 2 | 766 | |
10.1306 | AAPG/Datapages | 4 | 21817 | |
10.3183 | AB Svensk Papperstidning | 1 | 1550 | |
10.5769 | ABEAT - Associacao Brasileira de Especialistas em Alta Tecnologia | 1 | 57 | |
10.7597 | ACOPIOS - Revista Iberica de Mineralogia | 1 | 9 |
import java.util.Map; | |
import java.util.TreeMap; | |
import org.junit.Test; | |
import com.fasterxml.jackson.annotation.JsonAnyGetter; | |
import com.fasterxml.jackson.annotation.JsonProperty; | |
import com.fasterxml.jackson.core.JsonProcessingException; | |
import com.fasterxml.jackson.databind.ObjectMapper; |
##simple d3.js graph ###add nodes with a click.
(cheers to mike bostock!)
The range sliders at the top change the values for the force-directed algorithm and the buttons load new graphs and apply various techniques. This will hopefully serve as a tool for teaching network analysis and visualization principles during my Gephi courses and general Networks in the Humanities presentations.
Notice this includes a pretty straightforward way to load CSV node and edge lists as exported from Gephi.
It also includes a pathfinding algorithm built for the standard data structure of force-directed networks in D3. This requires the addition of .id attributes for the nodes, however.
Now with Clustering Coefficients!
Also, it loads images for nodes but the images are not in the gist. The code also refers to different network types but the data files on Gist only refer to the transportation network.