On detecting maximal quasi antagonistic communities in signed graphs
DOI10.1007/S10618-015-0405-2zbMATH Open1411.68102OpenAlexW2095264893MaRDI QIDQ1741135FDOQ1741135
Authors: Ming Gao, Ee-Peng Lim, David Lo, Philips Kokoh Prasetyo 
Publication date: 3 May 2019
Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)
Full work available at URL: https://ink.library.smu.edu.sg/sis_research/2858
Recommendations
- Survey of signed network research
- Anti-modularity and anti-community detecting in complex networks
- Network modelling and variational Bayesian inference for structure analysis of signed networks
- Prediction and clustering in signed networks: a local to global perspective
- A dynamic evolutionary clustering perspective: community detection in signed networks by reconstructing neighbor sets
Learning and adaptive systems in artificial intelligence (68T05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Signed and weighted graphs (05C22)
Cites Work
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Algorithm 457: finding all cliques of an undirected graph
- Fast unfolding of communities in large networks
- Depth-First Search and Linear Graph Algorithms
- Correlation clustering
- On cliques in graphs
- Title not available (Why is that?)
- On generating all maximal independent sets
- Biclique graphs and biclique matrices
- Detecting network communities: a new systematic and efficient algorithm
- A graph‐theoretic definition of a sociometric clique†
- \(k\)-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases
- Quasi-bicliques: Complexity and Binding Pairs
- Graph theoretic blockings k‐plexes and k‐cutpoints
Uses Software
This page was built for publication: On detecting maximal quasi antagonistic communities in signed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1741135)
