{"id":147,"date":"2012-08-10T15:11:11","date_gmt":"2012-08-10T19:11:11","guid":{"rendered":"http:\/\/www.michelecoscia.com\/?page_id=147"},"modified":"2012-08-14T18:44:10","modified_gmt":"2012-08-14T22:44:10","slug":"multidimensional-network-analysis","status":"publish","type":"page","link":"https:\/\/www.michelecoscia.com\/?page_id=147","title":{"rendered":"Multidimensional Network Analysis"},"content":{"rendered":"

Implemented by Alessio Orlandi<\/a> (Java) and me (Python)<\/p>\n

\"\"<\/p>\n

Paper<\/strong><\/p>\n

This page provides two different implementations of the multidimensional network analysis framework that is described in this paper<\/a>.<\/p>\n

Download<\/strong><\/p>\n

The Java implementation (download<\/a>) is a larger JAR file (14 MB) without source code. It implements more functions (for example, it prints the cumulative distributions of the Dimension Relevance or it accepts as input an arc labelled graph, such as the one used for storing the UK Union web dataset<\/a>). More\u00a0importantly, it is WAY FASTER than the Python implementation: I didn’t test it rigorously, but it should be 4x faster than the alternative.<\/p>\n

The Python implementation (download<\/a>) is much simpler (2 KB), and it is designed for people who want to edit the code and adapt it to their own necessities. It is not slow in absolute terms (it can process around 3.5 million edges in 20 seconds on a dual core i7 64 bits @ 2.8\u00a0GHz, more or less), but of course it’s not C++.<\/p>\n

Instructions<\/strong><\/p>\n

The shared flags between the two implementations are the following:<\/p>\n

-f: Specifies the path of the network input file.<\/p>\n

-d: Specifies the directory containing ONLY network files in the same format and with the same number of dimensions.<\/p>\n

-D: Specified the number of dimensions.<\/p>\n

-e: Use extended format (edgelist with an “e” as first field, then “node node dimension”) compatible with gSpan format. Otherwise the simple edgelist (node node dimension) is used.<\/p>\n

-n: Print the node stats (zipped).<\/p>\n

-i: Print the dimension stats.<\/p>\n

The other flags only for the Java version are explained in the –help.<\/p>\n

So, if we want to analyze the network “querylog” with 7 dimensions, in the same directory of the script, in gSpan format and we want only the node statistics we will write:<\/p>\n

java -jar mna.jar -f querylog -D 7 -e -I -n<\/p>\n

or<\/p>\n

python mna.py\u00a0-f querylog -D 7 -e -n<\/p>\n

Instead, if we want to analyze a bunch of networks in the “dblp_conf” directory, each with 31 dimensions, not in gSpan format, requesting for both node and dimension statistics we will write:<\/p>\n

java -jar mna.jar -d\u00a0dblp_conf -D 31 -I -n -i<\/p>\n

or<\/p>\n

python mna.py -d\u00a0dblp_conf -D 31 -n -i<\/p>\n

Datasets & Input instruction<\/strong><\/p>\n

One important input instruction: first, the format requested is either an edgelist (node node dimension), example:<\/p>\n

0 1 1\r\n0 2 1\r\n1 2 3<\/pre>\n
or a gSpan edge list:<\/p>\n
e 0 1 1\r\ne 0 2 1\r\ne 1 2 3<\/pre>\n
Second, and more important: the edges are required to be sorted. So the following is a correct edgelist:<\/p>\n
0 1 1\r\n0 1 2\r\n0 2 1\r\n1 2 3<\/pre>\n
while the following is not:<\/div>\n
0 1 1\r\n0 2 1\r\n0 1 2\r\n1 2 3<\/pre>\n
Two datasets are available:<\/p>\n