Spectral K-way ratio-cut partitioning and clustering
DAC '93 Proceedings of the 30th international Design Automation Conference
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
A cluster algorithm for graphs
A cluster algorithm for graphs
Email as spectroscopy: automated discovery of community structure within organizations
Communities and technologies
A personalized search engine based on web-snippet hierarchical clustering
WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
A fast kernel-based multilevel algorithm for graph clustering
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Community Mining from Signed Social Networks
IEEE Transactions on Knowledge and Data Engineering
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence
The slashdot zoo: mining a social network with negative edges
Proceedings of the 18th international conference on World wide web
Efficient identification of overlapping communities
ISI'05 Proceedings of the 2005 IEEE international conference on Intelligence and Security Informatics
Scalable clustering of signed networks using balance normalized cut
Proceedings of the 21st ACM international conference on Information and knowledge management
Community mining in signed networks: a multiobjective approach
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
| Hi-index | 0.00 |
Discussion based websites like Epinions.com and Slashdot.com allow users to identify both friends and foes. Such networks are called Signed Social Networks and mining communities of like-minded users from these networks has potential value. We extend existing community detection algorithms that work only on unsigned networks to be applicable to signed networks. In particular, we develop a spectral approach augmented with iterative optimization. We use our algorithms to study both communities and structural balance. Our results indicate that modularity based communities are distinct from structurally balanced communities.