89 citations · 149 across the 8 of their papers we have counts for
4 papers · 1 filter
Communities as Well Separated Subgraphs With Cohesive Cores: Identification of Core-Periphery Structures in Link Communities
Frank Havemann, Jochen Gläser, Michael Heinz
Communities in networks are commonly considered as highly cohesive subgraphs which are well separated from the rest of the network. However, cohesion and separation often cannot be…
Memetic search for overlapping topics based on a local evaluation of link communities
Frank Havemann, Jochen Gläser, Michael Heinz
In spite of recent advances in field delineation methods, bibliometricians still don't know the extent to which their topic detection algorithms reconstruct `ground truths', i.e. t…
Detecting Overlapping Link Communities by Finding Local Minima of a Cost Function with a Memetic Algorithm. Part 1: Problem and Method
Frank Havemann, Jochen Gläser, Michael Heinz
We propose an algorithm for detecting communities of links in networks which uses local information, is based on a new evaluation function, and allows for pervasive overlaps of com…
Evaluating Overlapping Communities with the Conductance of their Boundary Nodes
Frank Havemann, Jochen Gläser, Michael Heinz +1
Usually the boundary of a community in a network is drawn between nodes and thus crosses its outgoing links. If we construct overlapping communities by applying the link-clustering…