A heuristic combining 2-club edge deletion with vertex splitting achieves the best F-score among tested methods on overlapping LFR benchmark graphs.
A k-means clusterin g algorithm
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Correlation Clustering with Overlap: a Heuristic Graph Editing Approach
A heuristic combining 2-club edge deletion with vertex splitting achieves the best F-score among tested methods on overlapping LFR benchmark graphs.