The Maximum Community Partition Problem In Networks
Fay Zhong, California State University, East Bay
11/16/2017
Many network systems of interest are rising from real world networks, e.g. social networks and biological networks. One typical issue considered by researchers is how to find the community structures in those networks. We proposed a community structure detection problem, which aims to analyze the relationships among the data via the network topology. We collect a series of unified definitions for community structures and formulate the community structure detection into a combinatorial optimization problem to identify as many communities as possible for a given network, and develop a heuristic algorithm based on greedy strategy. The experimental results on real networks show that the proposed algorithm is effective in terms of the number of valid communities and the modularity score.
Fall 2017 Short Presentations Of Student Research
STUDENT PRESENTATIONS (Pizza during talks)
11/30/2017
Short presentations of research carried out by Sonoma State Computer Science Students
Awards Presented To Sonoma State Computer Science Majors
END OF SEMESTER CELEBRATION & AWARDS (Pizza during talks)
12/07/2017
Pages
- « first
- ‹ previous
- 1
- 2
- 3