Package es.uam.eps.ir.relison.examples.links.recommendation

Class Reranking

java.lang.Object
es.uam.eps.ir.relison.examples.links.recommendation.Reranking
public class Reranking
extends java.lang.Object
Program for applying a given reranking algorithm to the outcome of a contact recommendation algorithm.

  • Constructor Summary

    Constructors 
    Constructor Description
    Reranking()  

  • Method Summary

    Modifier and Type Method Description
    static void main​(java.lang.String[] args)
    Generates rerankers.

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Constructor Details

  • Method Details

    • main

      public static void main​(java.lang.String[] args) throws java.io.IOException
      Generates rerankers.
      Parameters:
      args - Execution arguments:
      1. Train: Route to the file containing the training graph.
      2. Test: Route to the file containing the test links.
      3. Multigraph: true if the network allows multiple edges, false otherwise.
      4. Directed: true if the network is directed, false otherwise.
      5. Weighted: true if the network is weighted, false otherwise.
      6. Selfloops: true if the network allows self-loops, false otherwise.
      7. ReadTypes: true if we have to read the edge types from the file, false otherwise.
      8. Grid: File containing the configuration for rerankers and evaluation metrics.
      9. Output directory: Directory in which to store the recommendations and the output file.
      10. Cutoff: Number of recommended users to return
      11. Max. length: the number of recommended users to consider.
      12. Optional arguments:
        • -reciprocal value: true if we allowed the recommendation of reciprocal links, false otherwise (by default, false)
        • -distance max directed: if we wanted to limit the maximum distance from the target user to the recommended ones. max indicates the distance value whereas directed indicates if we measure the distance over a directed (true) or undirected graph (false). By default, distance is not limited.
        • -feat-data file index: if we want to compute feature-dependant metrics, this contains the feature information. File indicates the route to the file, whereas index is true if we have to read the features from an inverted index.
      Throws:
      java.io.IOException - if something fails while reading / writing.