lifecycles.algorithms.event_graph_greene

event_graph_greene(lc: object, th: float = 0.1) → list

Compute the event graph in a lifecycle according to Greene et al. Return a list of match between groups, i.e., edges of the event graph.

Parameters:

• lc – the lifecycle object

• th – threshold for the Jaccard index. Defaults to 0.1 according to best results in the original paper.

Returns:

list of match between groups

Reference:

Greene, D., Doyle, D., Cunningham, P.: Tracking the evolution of communities in dynamic social networks. In: Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2010), pp. 176–183. IEEE (2010)

Example:

>>> from lifecycles import Lifecycle
>>> from lifecycles.algorithms.classic_match import event_graph_greene
>>> lc = Lifecycle()
>>> # add some data and then...
>>> events = event_graph_greene(lc, 0.1)