A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
The correlation clustering problem identifies clusters in a set of objects when the qualitative
information about objects' mutual similarities or dissimilarities is given in a signed network …
information about objects' mutual similarities or dissimilarities is given in a signed network …
Balance and frustration in signed networks
The frustration index is a key measure for analysing signed networks, which has been
underused due to its computational complexity. We use an exact optimization-based method …
underused due to its computational complexity. We use an exact optimization-based method …
Identifying hidden coalitions in the US House of Representatives by optimally partitioning signed networks based on generalized balance
In network science, identifying optimal partitions of a signed network into internally cohesive
and mutually divisive clusters based on generalized balance theory is computationally …
and mutually divisive clusters based on generalized balance theory is computationally …
Evaluating balancing on social networks through the efficient solution of correlation clustering problems
One challenge for social network researchers is to evaluate balance in a social network. The
degree of balance in a social group can be used as a tool to study whether and how this …
degree of balance in a social group can be used as a tool to study whether and how this …
A modeling and computational study of the frustration index in signed networks
Computing the frustration index of a signed graph is a key step toward solving problems in
many fields including social networks, political science, physics, chemistry, and biology. The …
many fields including social networks, political science, physics, chemistry, and biology. The …
Integer programming formulations and efficient local search for relaxed correlation clustering
Relaxed correlation clustering (RCC) is a vertex partitioning problem that aims at minimizing
the so-called relaxed imbalance in signed graphs. RCC is considered to be an NP-hard …
the so-called relaxed imbalance in signed graphs. RCC is considered to be an NP-hard …
[PDF][PDF] An exact method for computing the frustration index in signed networks using binary programming
Computing the frustration index of a signed graph is a key to solving problems in different
fields of research including social networks, physics, material science, and biology. In social …
fields of research including social networks, physics, material science, and biology. In social …
Comparison of two heuristic algorithms for correlation clustering problem solving
E Ibragimova, D Semenova… - 2023 5th International …, 2023 - ieeexplore.ieee.org
This paper compares two heuristic algorithms for solving the correlation clustering problem
(CCP). CCP is solved for undirected and unweighted simple signed graphs, where error …
(CCP). CCP is solved for undirected and unweighted simple signed graphs, where error …
Relevance of negative links in graph partitioning: A case study using votes from the european parliament
In this paper, we want to study the informative value of negative links in signed complex
networks. For this purpose, we extract and analyze a collection of signed networks …
networks. For this purpose, we extract and analyze a collection of signed networks …
Signed network structural analysis and applications with a focus on balance theory
We analyse signed networks from the perspective of balance theory which predicts structural
balance as a global structure for signed social networks that represent groups of friends and …
balance as a global structure for signed social networks that represent groups of friends and …