Skip to content. | Skip to navigation

Informatik 5
Information Systems
Prof. Dr. M. Jarke
Personal tools
You are here: Home Theses Algorithmic Approaches to Overlapping Community Detection - Ant Colony Algorithms


Prof. Dr. M. Jarke
RWTH Aachen
Informatik 5
Ahornstr. 55
D-52056 Aachen
Tel +49/241/8021501
Fax +49/241/8022321

How to find us

Annual Reports





Algorithmic Approaches to Overlapping Community Detection - Ant Colony Algorithms

Thesis type
  • Bachelor
Status Running
Proposal on 16. Dec 2020 15:00
Proposal room Seminarraum I5
Add proposal to calendar vCal
(Social) Network Analysis is investigating (social) structures of real-world networks. Networks are composed of nodes and links. Communities are sub-networks whose nodes have more links to nodes within the sub-network than to nodes outside the sub-network. Overlapping Community Detection is the problem of identifying nodes in networks that belong to more than one sub-network. The overlapping community detection problem has an enormous importance for different fields of science like biology, neurology, sociology, media science, politics, economics, and computer science. A vast number of papers has been written about various aspects of overlapping community detection like measures of quality of overlapping communities, modeling, visualization. A huge number of algorithms have been proposed. Recently, methods of machine learning and quantum computing have been applied on the problem. This bachelor thesis should research recent algorithmic approaches to community detection algorithms. Results should be integrated in the existing award winning WebOCD framework, a collection of Java-based microservices deployed in a peer-to-peer network. With the help of the framework, an interactive online book about overlapping community detection algorithms has been started for use in teaching. Interests in desk research, formal modeling, and Web programming are prerequisites for this bachelor thesis.

Related projects

Document Actions