Skip to content

Running mainRDIlab.py

Jump to bottom
Orieus edited this page Sep 2, 2020 · 1 revision

Application mainRDIlab works in a similar way to mainRDIgraphs: it requires a project folder, that will be created the first time the application is invoked with

python mainRDIlab.py --p PATH --source SOURCE

where

  • PATH is the path to the project folder.
  • SOURCE is the path to the folder containing the source data

Both the project folder and the configuration file have the same structure than that used by mainRDIgraphs.py. Check the link for instructions.

Also mainRDIlab.py and mainRDIgraphs.py are mutually compatible. You can run one script using a project created with the other.

1. Menu options.

The first time you run the software, you will see a short menu with two options:

1. Activate configuration file
0. Exit the application

Once you have edited configuration file parameters.yaml you can select option 1.

At this point, you will enter the complete set of options. They are organized in a hierarchical structure. The whole tree of available options is shown below:

1. Create new project  
2. Load existing project    
3. Activate configuration file
4. Show SQL data sources
   4.1. Publications
   4.2. Projects
   4.3. Patents
5. Show supergraph structure
6. Reset supernode
7. Reset superedge
8. Show available topic models
9. Get equivalent classes
    9.1. Topic models from corpus ACL
    9.2. Topic models from the other corpora.
10. Show equivalent classes from ACL models
11. Analyze the effect of thresholding over the similarity graph 
    11.1. Corpus CORDIS
    11.2. Corpus CORDIS720
    11.3. Corpus FECYT
    11.4. Corpus SCOPUS
    11.5. Corpus PATSTAT
12. Analyze the relation radius vs sampling for fixed number of edges
    12.1. Corpus CORDIS
    12.2. Corpus CORDIS720
    12.3. Corpus FECYT
    12.4. Corpus SCOPUS
    12.5. Corpus PATSTAT
13. Load co-citations graph from DB
14. Validate topic models
15. Validate all models with respect to community metrics
    JS: Jensen-Shannon distance
    He: Hellinger distance
    l1: L1 distance
16. Show fixed-n_edges validation results
17. Compute all centralities for a given graph
18. Generate top n files for a given graph
0. Exit the application

Some options (such as those related to the processing or analysis of specific graphs) will request some more information: the graph of graphs to be processes, the attributes to be analyzed, etc.)

Clone this wiki locally