Multilevel hypergraph partitioning: application in VLSI domain
DAC '97 Proceedings of the 34th annual Design Automation Conference
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
CrimeNet explorer: a framework for criminal network knowledge discovery
ACM Transactions on Information Systems (TOIS)
Criminal network analysis and visualization
Communications of the ACM - 3d hard copy
Graphs and Hypergraphs
Community detection algorithm based on centrality and node distance in scale-free networks
Proceedings of the 24th ACM Conference on Hypertext and Social Media
Hi-index | 0.00 |
The investigation of community structures in networks is an important issue in many domains and disciplines. There have been considerable recent interest algorithms for finding communities in networks. In this paper we present a method of detecting community structure based on hypergraph model. The hypergraph model maps the relationship in the original data into a hypergraph. A hyperedge represents a relationship among subsets of data and the weight of the hyperedge reflects the strength of this affinity. We assign the density of a hyperedge to its weight. We present and illustrate the results of experiments on the Enron data set. These experiments demonstrate that our approach is applicable and effective.