Now GraphDBLP provides a wonderful Web GUI interface. Build your own following instructions at Backend with autocomplete service and Frontend Have a look to the ECML-PKDD 2019 demo video
GraphDBLP is a tool that models the DBLP bibliography as a graph database for performing graph-based queries and social network analyses.
GraphDBLP also enriches the DBLP data through semantic keyword similarities computed via word-embedding. GraphDBLP provides to users three meaningful queries for exploring the DBLP community:
- investigate author profiles by analysing their publication records;
- identify the most prolific authors on a given topic;
- perform social network analyses over the whole community;
- perform shortest-paths over DBLP (e.g., the shortest-path between authors, the analysis of co-author networks, etc.)
To date, GraphDBLP contains 5+ million nodes and 24+ million relationships, enabling users to explore the DBLP data by referencing more than 3.3 million publications, 1.7 million authors, and more than 5 thousand publication venues. Through the use of word-embedding, more than 7.5 thousand keywords and related similarity values were collected
You can install GraphDBLP in 5 steps as follows.
First, download Neo4j graph-database. Notice that GraphDBLP has been tested on Neo4j Community Edition 3.2.5. We suggest to download Neo4j Desktop and then to deploy a new GraphDB instance using the Neo4j Community Edition 3.2.5.
Download the dump file that contains the whole GraphDBLP database in a local folder (e.g., Download). The procedures that transform DBLP into a graph-database are time consuming and discussed in the paper. Here, for your convencience, we recommend to import the GraphDBLP database instance into your local Graph-database instance as follows.
Open the Neo4j Desktop app. Here press "Manage" and then "Terminal". Move to bin directory with cd bin then type ./neo4j-admin load --from=path_to_your_donwload_folder/graph.db.dump --force. This operation may take a while. Please do not close the window while running.
As some GraphDBLP queries are time and memory consuming, we suggest to increase the memory available to Neo4j. This can be easily done through Neo4j Desktop App-->Manage-->Settings. Here just modify the rows dbms.memory.heap.initial_size=512m and dbms.memory.heap.max_size=1G with the desired settings. The higher, the better. Remember to restart the sever in case of changes.
Just press the Start button to run GraphDB instance through the Neo4j Desktop app. Notice that the first run may take a while.
GraphDBLP provides a shell-interface with 4 pre-defined queries, as specified in the paper. This would make easier the realisation of some standard queries over DBLP. Clearly, we assume you have a Python > 2.x shell installed on your machine.
The following Python packages are required to run GraphDBLP.py:
- matplotlib, py2neo, pandas, tabulate, statistics. You can easily install all these packages with
piptypingpip install matplotlib py2neo pandas tabulate statisticsfrom the shell.
Open a terminal and go to the GraphDBLP folder you downloaded (or cloned). Then type python ./GraphDBLP.py and select one of the following arguments:
Use -q1 keyword limit to the query number 1 for KEYWORDS DISCOVERY. This allows users to identify the most prolific authors in the DBLP community for a given keyword. This requires to specify also the keyword to be used and the limit value for results. Example: -q1 'multimedia' 10 will perform query 1 using multimedia as keyword and collecting top 10 results. The meaning of 'relevance', 'score' and 'prolificness' are discussed in the paper. A list of current keywords stored in GraphDBLP (inheridted from FacetedDBLP project!) can be found here
Use -q2 author-name-surname limit similarity-threshold to run query number 2 for AUTHOR PUBLICATION RECORDS COMPARISON. This query starts from the keywords describing an author’s research activities i.e., the keywords connected through the has_research_topic relationship. For each keyword, the most proficient author in the field is identified, and the related data are retrieved: (prolific) author name, score, relevance, and related keywords. This requires to specify also the keyword to be used, the max number of researchers to be considered for each keyword and the similarity threshold value for similar keywords. Example: -q2 'John von Neumann' 3 0.4 will perform query #2 profiling the publication record of John von Neumann and retrieving up to 3 top researchers for each keyword appearing the in profile of John von Neumann. In addition, for each keyword, only keywords with a similarity value grater than 0.4 will be returned
Use -q3 venue-name similarity-threshold to rum query #3 for COMPUTING LOCAL CLUSTERING COEFFICIENT ON RESEARCH COMMUNITIES. This requires to specify the venue name and a threshold value for computing the similarity. Example: -q3 'ijcai' 10 percent will perform query 3 computing the community starting from ijcai and considering venue with a similarity value with at least 10 percent.
Use -q4 author1-name-surname author2-name-surname rel-to-be-navigated limit to execute query #4 for SHORTEST PATHS BETWEEN RESEARCHERS. This requires to specify the name of two researchers to be connected, the relationships that can be navigated separated by a pipe | and the max number of paths to be returned. Example: -q4 'John von Neumann' 'Moshe Y. Vardi' 'authored|contains' 1. We suggest to run this query directly on the Neo4j Browser (available on your local machine at http://localhost:7474/browser/) as this would allow you obtaining a graphical representation of the returned paths, as shown in the figure below. The Cypher code to compute shortest paths might have the following structure: match p=AllshortestPaths((n:author)-[:authored|contains*]-(n2:author)) where lower(n.name) = lower('fistname lastname author 1') and lower(n2.name) = lower('fistname lastname author 2') return p limit 1. Notice that, in the example below only relations labelled as contains or authored are allowed to be navigated. This results in a path with size 4 whilst a shortest one might be found by enabling the navigation of the relation has_research_topic.
GraphDBLP is built on top of Neo4j. This means you can perform any query using the Cypher query language. Once the Neo4j instance is running, open your browser at localhost:7474/browser/
Please cite GraphDBLP as: Mezzanzanica, M., Mercorio, F., Cesarini, M., Moscato, V., Picariello, GraphDBLP: a system for analysing networks of computer scientists through graph databases. Multimed Tools Appl (2018). https://doi.org/10.1007/s11042-017-5503-2
@Article{Graphdblp2018,
author="Mezzanzanica, Mario
and Mercorio, Fabio
and Cesarini, Mirko
and Moscato, Vincenzo
and Picariello, Antonio",
title="GraphDBLP: a system for analysing networks of computer scientists through graph databases",
journal="Multimedia Tools and Applications",
year="2018",
issn="1573-7721",
doi="10.1007/s11042-017-5503-2",
url="https://doi.org/10.1007/s11042-017-5503-2"
}
while the whole GraphDBLP system (with GUI) can be cited as
Fabio Mercorio, Mario Mezzanzanica, Vincenzo Moscato, Antonio Picariello, Giancarlo Sperlì: A Tool for Researchers: Querying Big Scholarly Data Through Graph Databases. ECML/PKDD (3) 2019: 760-763
@inproceedings{DBLP:conf/pkdd/MercorioMMPS19,
author = {Fabio Mercorio and
Mario Mezzanzanica and
Vincenzo Moscato and
Antonio Picariello and
Giancarlo Sperl{\`{\i}}},
title = {A Tool for Researchers: Querying Big Scholarly Data Through Graph
Databases},
booktitle = {Machine Learning and Knowledge Discovery in Databases - European Conference,
{ECML} {PKDD} 2019},
pages = {760--763},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-46133-1\_46},
doi = {10.1007/978-3-030-46133-1\_46}
}
GraphDBLP is an experimental tool developed as a proof of concepts to empirically verify how a graph-based analysis can be performed over the well known DBLP computer science bibliography.
This means there could be bugs, or queries that need for better optimisation, refinement or improvement. The aim behind this project is to show that computer science bibliography can be queried as a graph. If you aim at joining this project please contact us!
GraphDBLP makes use of:
- DBLP updated at December 2016;
- Neo4j as graph-database for querying the knowledge base;
- The keywords here included have been identified by the FacetedDBLP project.
A special thank to Andrea Scrivanti and Ettore Colombo for their contribution on this project.