A Novel Local Community Detection Method Using Evolutionary Computation.

Area of Science:

• Complex network analysis
• Graph theory
• Computational intelligence

Background:

• Local community detection is crucial for understanding complex networks.
• Existing algorithms often rely on limited network information.
• There is a need for advanced methods that leverage comprehensive data.

Purpose of the Study:

• To propose a novel evolutionary computation-based algorithm for local community detection.
• To address the limitations of existing methods by utilizing entire obtained network information.
• To evaluate the algorithm's performance on various network types.

Main Methods:

• Development of the evolutionary-based local community detection (ELCD) algorithm.
• Algorithm designed to leverage comprehensive network data.
• Performance evaluation using synthetic and real-world benchmark networks.

Main Results:

• The ELCD algorithm demonstrates superior performance compared to state-of-the-art methods.
• Effectiveness shown on incomplete real-world networks where global information is unavailable.
• Validation across diverse network structures.

Conclusions:

• The proposed ELCD algorithm offers an effective approach for local community detection in complex networks.
• It provides a robust solution, especially for networks with partial information.
• This method advances the field of community detection in network science.