Conditional Community Search Based on Weight Information

Community search aims to identify cohesive subgraphs containing user-given query nodes in social networks. As information technology develops, user demands for community search have become increasingly sophisticated. The searched communities must not only meet the structural cohesiveness requirements but also adhere to some complex search conditions based on Boolean expressions. For example, certain desired nodes should be contained in the communities, while certain undesired nodes cannot exist in the communities, which is called conditional community search. However, existing solutions for conditional community search often introduce some undesired nodes into the identified communities and exhibit relatively low search efficiency. To overcome these drawbacks, therefore, this paper investigates the problem of conditional community search based on weight information. First, we refine the original problem definition of conditional community search and outline the need for an improved algorithm for calculating the weights of the nodes. Then, we explore two novel algorithms for searching conditional communities based on calculated weight information. Finally, we conduct extensive experiments on several real-world datasets to verify the accuracy and efficiency of our proposed searching algorithms.