Datasets for Experiments on Link Analysis Ranking Algorithms

In the following table you can access and download the datasets on which the experiments were performed (click here to learn the difference between the different categories). For each query there are four files: nodes, adjacency matrix, and adjacency list, and inverted adjacency list. Following the table there is a short explanation about each file.
 
 
Query Expanded Refined Regular
Abortion Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Computational Complexity Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Computational Geometry Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Death Penalty Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Genetic Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Gun Control Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Movies Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Net Censorship Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)
Nodes (.Z)
Adjacency Matrix (.Z)
Adjacency List (.Z)
Inverted Adjancency List (.Z)
All (tar file)

The Nodes file: The file nodes.txt is formatted as follows. First there is an entry that gives the number of pages in the graph. Then there is a list of the page entries. An example of a page entry is the following

34 (67) [R]
http://www.ece.wpi.edu/~jinlee/events/wave/sld024.htm
Accuracy & Computational Complexity
0 1
 

The first number is the page id, a unique indetifier for each page. The second number is an id assigned to the page, when it is first entered in the base set (this can be ignored). The character associated with each page describes the type of the page. The character R is for the pages in the Root set, the character O is for the pages that are pointed to by a page in the page set, and character I is for the pages that point to a page in the root set. The following line is the http address of the page, and the next the title of the page. The two numbers in the last line are the in and out degree of the node.

The Adjancency Matrix file: Stores the adjacency matrix of the undelying graph of the pages. The (i,j) entry of the matrix is 1 if there is a link from page with id i to page with id j, and zero otherwise.

The Adjancency List file: Stores the adjacency list of the undelying graph of the pages. Each entry of the list is in the form

pid: pid1,pid2,.....,pidN,-1

which means that the page with id pid, points to the pages with ids pid1,pid2,.....,pidN.

The Inverted Adjancency List file: Stores the inverted adjacency list of the undelying graph of the pages. Each entry of the list is in the form

pid: pid1,pid2,.....,pidN,-1

which means that the page with id pid, is pointed to by the pages with ids pid1,pid2,.....,pidN.