unetSim: unetSim

In abhik1368/netpredictor: Algorithms to search for missing link in a graph.

Description

This function calculates vertex proximity (similarity) with selected method and between selected vertices.

Usage

unetSim(graph, method)

Arguments

graph	an object of class igraph
method	a method (single string) for calculating similarities , see details for methods.

Details

Get similarity using various link prediction methods

Following methods are available: aa Adamic-Adar index act average commute time cn common neighbours jc cosine similarity dice cosine similarity on L+ invL graph distance hdi Hub Depressed Index hpi Hub Promoted Index dist Jaccard coefficient katz Katz index lhn Leicht-Holme-Newman Index lp Local Path Index cosine Matrix Forest Index pa preferential attachment ra resource allocation index

Value

a matrix of similarity scores.

References

• T. Zhou, L. Lv, and Y.-C. Zhang.Predicting missing links via local information, The European Physical Journal B - Condensed Matter and Complex Systems, vol. 71, no. 4, pp. 623-630, Oct. 2009.

Examples

# net <- netSim(graph=proj_weighted,method="paSim")

abhik1368/netpredictor documentation built on May 10, 2019, 4:09 a.m.