Evaluating balancing on social networks through the efficient solution of correlation clustering problems
DOI10.1007/S13675-017-0082-6zbMATH Open1386.90161OpenAlexW2585973110MaRDI QIDQ1688940FDOQ1688940
Authors: Mario Levorato, Y. Frota, Rosa Figueiredo, Lúcia M. A. Drummond 
Publication date: 12 January 2018
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13675-017-0082-6
Recommendations
- Efficient enumeration of the optimal solutions to the correlation clustering problem
- Multiplicity and diversity: analysing the optimal solution space of the correlation clustering problem on complete signed graphs
- Integer programming formulations and efficient local search for relaxed correlation clustering
- Measuring partial balance in signed networks
- Approximation algorithms for balancing signed graphs
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Social networks; opinion dynamics (91D30) Signed and weighted graphs (05C22)
Cites Work
- Clustering with qualitative information
- Title not available (Why is that?)
- Aggregating inconsistent information: ranking and clustering
- Correlation clustering
- Variable neighborhood search
- Parallel Metaheuristics
- Handbook of metaheuristics
- Greedy randomized adaptive search procedures
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- TTT plots: a perl program to create time-to-target plots
- Cliques and clustering: A combinatorial approach
- Correlation clustering in general weighted graphs
- Community detection by modularity maximization using GRASP with path relinking
- Extracting pure network submatrices in linear programs using signed graphs.
- Separator-based data reduction for signed graph balancing
- Correlation clustering, maximizing agreements via semidefinite programming
- Correlation clustering with a fixed number of clusters
- Parallel Strategies for Meta-Heuristics
- Pre‐transitive balance mechanisms for signed networks*
- Structural Balance: A Dynamic Perspective
- Towards the determination of the optimal \(p\)-cyclic SSOR
- The maximum balanced subgraph of a signed graph: applications and solution approaches
- Prediction and clustering in signed networks: a local to global perspective
Cited In (9)
- Approach to analysis and construction of algorithms for solving one clustering problem on signed graphs
- A modeling and computational study of the frustration index in signed networks
- Approximation algorithms on \(k\)-correlation clustering
- Multiplicity and diversity: analysing the optimal solution space of the correlation clustering problem on complete signed graphs
- Efficient enumeration of the optimal solutions to the correlation clustering problem
- Rethinking structural balance in signed social networks
- Integer programming formulations and efficient local search for relaxed correlation clustering
- A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph
- A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
Uses Software
This page was built for publication: Evaluating balancing on social networks through the efficient solution of correlation clustering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1688940)
