Tagged articles
Community Detection
18 articles · Page 1 of 1
This article explains GraphRAG, which combines knowledge graphs with RAG to solve multi-hop reasoning and global query limitations of traditional RAG, detailing Microsoft's GraphRAG approach, Java implementation with Neo4j for entity extraction and graph storage, retrieval processes, community summarization, cost trade-offs, and when to choose GraphRAG over standard RAG.
Community DetectionEntity ExtractionGraphRAG
0 likes · 11 min read

This article introduces the Python "communities" library, explains its support for multiple graph clustering algorithms such as Louvain and Girvan‑Newman, demonstrates how to import algorithms, build adjacency matrices, visualize communities, create animation of the clustering process, and provides author and resource information.
Community DetectionLouvain Algorithmdata science
0 likes · 7 min read

This article presents Tencent's research on community recommendation for online games, introducing an adaptive K‑Free community detection algorithm (DAG) to address cold‑start and unknown community count, a constrained large‑scale recommendation method (ComRec), their evaluation metrics, experimental results, and deployment insights.
Community DetectionGraph Neural NetworksTencent Games
0 likes · 20 min read

This article introduces the open‑source Python library communities, which provides implementations of several community‑detection algorithms—including Louvain, Girvan‑Newman, hierarchical clustering, spectral clustering, and Bron‑Kerbosch—along with installation instructions, usage examples, and visualization tools for network analysis.
Community DetectionGraph Algorithmsmachine-learning
0 likes · 6 min read


AntTechDec 13, 2023 · Artificial Intelligence
The IEEE ICDM 2023 Graph Learning Challenge, co‑hosted by Ant Group and Zhejiang University, showcased deep graph learning approaches for community detection and fraud‑group mining, highlighting the winning team's Risk‑DCRN method and emphasizing the importance of pretrained models in large‑scale network analysis.
Community DetectionICDMPretrained Models
0 likes · 5 min read

This article explains the fundamentals of community detection in graph computing, contrasting it with clustering, describing key concepts such as modularity, and reviewing classic algorithms like Louvain, node2vec‑based methods, and Infomap, while highlighting their applications across domains.
Community DetectionGraph AlgorithmsInfomap
0 likes · 11 min read

This article introduces community detection as a fundamental graph algorithm, explains its basic concepts and types, compares it with clustering, discusses evaluation metrics like modularity, and reviews classic methods such as Louvain, node2vec‑based approaches, and the information‑theoretic Infomap algorithm.
Community DetectionGraph AlgorithmsInfomap
0 likes · 13 min read

Angel Graph is a high‑performance, fault‑tolerant distributed graph computing framework developed by Tencent, featuring scalable node‑metric, community‑detection, and graph‑neural‑network algorithms optimized for billion‑node, trillion‑edge datasets, and demonstrated through practical applications in intelligent financial risk control.
Community DetectionRisk Controldistributed systems
0 likes · 20 min read

The Xiaohongshu anti‑fraud team combats sophisticated same‑group and crowdsourced reselling bots by ingesting real‑time transaction streams into a Nebula Graph, using multi‑hop sub‑graph sampling, label propagation, and modularity‑based community detection to identify suspicious clusters, update risk pools, and enforce personalized purchase‑limit rules.
Anti-FraudCommunity Detectionbig data
0 likes · 9 min read

The Louvain algorithm, a fast modularity‑maximizing community‑detection method, iteratively merges nodes into hierarchical super‑nodes, enabling anti‑fraud systems to uncover hidden collusive groups in weighted transaction graphs, thereby improving detection of fake orders, coupon abuse, and other illicit behaviors despite its iterative nature and streaming limitations.
Anti-FraudCommunity DetectionGraph Algorithms
0 likes · 10 min read


58 TechDec 14, 2021 · Artificial Intelligence
This article presents an unsupervised community‑discovery approach based on the Louvain algorithm to identify black‑market accounts, describing the threat landscape, system architecture, algorithmic principles, optimizations, experimental results, and future directions for improving risk detection in large‑scale online services.
Community DetectionLouvain AlgorithmUnsupervised Learning
0 likes · 10 min read

This article presents a community‑encoding approach that leverages large‑scale graph‑embedding (GraphSAGE) and asynchronous near‑real‑time engineering to identify and measure unknown black‑gray market attacks with higher accuracy and flexibility than traditional graph‑mining methods.
Community DetectionGraphSAGEUnsupervised Learning
0 likes · 15 min read

The paper introduces a community‑encoding, GraphSAGE‑based detection framework that embeds whole user‑account, IP, device, and phone‑number graphs—both homogeneous and heterogeneous—to identify previously unseen black‑gray industry attacks, achieving about 95% IP‑risk accuracy via an asynchronous near‑real‑time system, though computational and automation challenges persist.
Community DetectionGraphSAGEblack-gray-industry
0 likes · 12 min read

This article introduces the Python library communities, which detects and visualizes community structures in graph‑clustering problems, supports multiple algorithms such as Louvain and Girvan‑Newman, provides code examples for importing algorithms, building adjacency matrices, visualizing results with color coding, and creating animation GIFs of the clustering process.
AlgorithmsCommunity Detectiongraph-clustering
0 likes · 7 min read

This article explains the concept of communities in graphs, illustrates Granovetter's weak tie theory, introduces the Louvain algorithm for modularity‑based community detection, and presents the overlapping‑community detection method BigCLAM built on the Community Affiliation Graph Model.
BigCLAMCommunity DetectionLouvain Algorithm
0 likes · 8 min read

The article explains the Louvain community‑detection algorithm, detailing its modularity‑maximizing objective, two‑step iterative process, efficient graph data structures, practical implementation considerations, and performance results on large‑scale graphs, providing a comprehensive guide for practitioners.
Community Detectionc-implementationgraph algorithm
0 likes · 7 min read

This article explains how graph‑based algorithms such as centrality measures, modularity optimization, Louvain, Infomap, node2vec and the comE framework can be applied to financial fraud detection and community discovery, detailing their principles, formulas, implementation steps and evaluation metrics.
Community DetectionGraph AlgorithmsInfomap
0 likes · 14 min read

The article presents a comprehensive overview of algorithms for analyzing Weibo’s social network, covering label propagation, user similarity via LDA, temporal and interaction factors, community detection, influence ranking using PageRank variants, and methods for identifying spam accounts.
Community DetectionLDASocial Network Analysis
0 likes · 16 min read
