Anjali de Silva

dblp:335/2223 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2026
0000-0001-8923-6893ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Data mining · 73% Web and social media mining · 27%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 62% Mathematical optimization · 38%
Artificial intelligence
1 paper
Graph learning · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › structured data mining › graph mining
community detection
1.922026
EIGA: A Novel Genetic Algorithm Based on Edge Information for Community Detection in Weighted Social Networks · IEEE Trans. Knowl. Data Eng. 2026
Advancing Community Detection with Graph Convolutional Neural Networks: Bridging Topological and Attributive Cohesion · IJCAI 2025
Web and social media mining
social network analysis
1.012026
EIGA: A Novel Genetic Algorithm Based on Edge Information for Community Detection in Weighted Social Networks · IEEE Trans. Knowl. Data Eng. 2026
Graph algorithms and graph theory › graph clustering
community detection
1.012026
EIGA: A Novel Genetic Algorithm Based on Edge Information for Community Detection in Weighted Social Networks · IEEE Trans. Knowl. Data Eng. 2026
Data mining › structured data mining
graph mining
0.912025
Advancing Community Detection with Graph Convolutional Neural Networks: Bridging Topological and Attributive Cohesion · IJCAI 2025
Mathematical optimization
evolutionary computation
0.312026
EIGA: A Novel Genetic Algorithm Based on Edge Information for Community Detection in Weighted Social Networks · IEEE Trans. Knowl. Data Eng. 2026
Mathematical optimization › evolutionary computation
genetic algorithm
0.312026
EIGA: A Novel Genetic Algorithm Based on Edge Information for Community Detection in Weighted Social Networks · IEEE Trans. Knowl. Data Eng. 2026
Machine learning › Graph learning › graph neural network
graph convolutional network
0.312025
Advancing Community Detection with Graph Convolutional Neural Networks: Bridging Topological and Attributive Cohesion · IJCAI 2025

Methods — techniques the papers use, named apart from their topics

mutation · 2.0genetic algorithm · 2.0edge-weight-aware crossover · 2.0leiden algorithm · 1.7graph convolutional network · 1.7
YearPublicationVenuePosition
2026 EIGA: A Novel Genetic Algorithm Based on Edge Information for Community Detection in Weighted Social Networks
abstract
Community Detection (CD) in weighted social networks is a highly active research field, celebrated for its profound practical implications across a multitude of disciplines. Genetic algorithms (GAs) are frequently explored to tackle CD problems, leveraging their capability to navigate the extensive discrete search space effectively. Throughout the evolutionary process, genetic operators such as crossover and mutation assume pivotal roles in effectively exploring the vast solution space. Nonetheless, prevailing GA-based approaches often ignore crucial topology information, particularly information regarding edge weights, resulting in compromised algorithm performance. In light of this, this paper introduces Edge Information-based GA (EIGA) to effectively solve CD problems in weighted networks. This is achieved specifically through the innovative designs of edgeweight-aware crossover and mutation operators. These novel edge-weight-aware operators improve the extraction of meaningful community structures, advancing knowledge discovery from social networks. Empirical findings demonstrate the superior performance of EIGA over numerous state-of-the-art algorithms across various real-world and synthetic benchmark networks.
Anjali de Silva, Gang Chen 0002, Hui Ma 0001, Seyed Mohammad Nekooei
IEEE Trans. Knowl. Data Eng.1
2025 Advancing Community Detection with Graph Convolutional Neural Networks: Bridging Topological and Attributive Cohesion
abstract
Community detection, a vital technology for real-world applications, uncovers cohesive node groups (communities) by leveraging both topological and attribute similarities in social networks. However, existing Graph Convolutional Networks (GCNs) trained to maximize modularity often converge to suboptimal solutions. Additionally, directly using human-labeled communities for training can undermine topological cohesiveness by grouping disconnected nodes based solely on node attributes. We address these issues by proposing a novel Topological and Attributive Similarity-based Community detection (TAS-Com) method. TAS-Com introduces a novel loss function that exploits the highly effective and scalable Leiden algorithm to detect community structures with global optimal modularity. Leiden is further utilized to refine human-labeled communities to ensure connectivity within each community, enabling TAS-Com to detect community structures with desirable trade-offs between modularity and compliance with human labels. Experimental results on multiple benchmark networks confirm that TAS-Com can significantly outperform several state-of-the-art algorithms.
Anjali de Silva, Gang Chen 0002, Hui Ma 0001, Seyed Mohammad Nekooei, Xingquan Zuo
IJCAI1
2023 Leiden Fitness-Based Genetic Algorithm with Niching for Community Detection in Large Social Networks
Anjali de Silva, Gang Chen 0002, Hui Ma 0001, Seyed Mohammad Nekooei
PRICAI (2)1