community.muxLicod: MuxLicod community detection algorithm

Description Usage Arguments Value Author(s) References

Description

This applies the MuxLicod algorithm as described in EGC 2015 (I.Falih, M.Hmimida, and R.Kanawati)

Usage

1
community.muxLicod(multiplex,sigma,centrality1,centrality2,delta,vote_fun,sim_fun,memb_fun,verbose)

Arguments

multiplex

: The input multiplex network

sigma

: is a threshold in [0; 1]. It is used to know if a node is a leader.

centrality1

: is a topological centrality in graphs as degree, closeness, betweenness...

centrality2

: is a topological centrality in graphs as degree, closeness, betweenness...

delta

: is a threshold in [0; 1]. Two leaders are linked if their topological similarity is above delta.

vote_fun

: The vote function that should be used to compute the membership vector.

sim_fun

: is the similarity function. i.e similarity.invlogweighted, similarity.jaccard, similarity.dice,...

memb_fun

: is the membership function i.e mean, sum, ...

verbose

: verbose

Value

returns an igraph communities object, please see igraph manual page for details.

Author(s)

Issam Falih <issam.falih@lipn.univ-paris13.fr>

References

Issam Falih, Manel Hmimida, Rushed Kanawati, Une approache centr\'ee graine pour la d\'etection de communaut\'es dans les r\'eseaux multiplexes. Conf\'erence francophone sur l'Extraction et la Gestion de Connaissance (EGC'15), 27-30 Jan. 2015 Luxembourg. #' @examples M <- Multiplex_CKM_Physicians_Innovation community.muxLicod(M)


Issamfalih/MUNA documentation built on May 8, 2019, 11:52 a.m.