Sign inGet started
Paper · arXiv

Alcmean's: Unsupervised community detection using local Laplacian, automatic detection of the number of centers

Community detection is a fundamental problem in the analysis of complex networks. It has applications across social, biological, and financial domains. Traditional algorithms such as Louvain, LPA, and modularity optimization often require manual parameter tuning. They also suffer from inaccurate cluster center selection and struggle with scalability. To address these challenges, we propose Automatic Laplacian Centrality Means (ALCMeans), a novel community detection algorithm. ALCMeans combines Laplacian energy-based automatic center identification with DeepWalk embeddings for robust node representation. Unlike existing Laplacian-based and clustering methods, ALCMeans eliminates the need t...

AuthorsShahin Momenzadeh, Rojiar Pir Mohammadiani
Primary categorycs.SI
Published8 June 2026
Last updated at source8 June 2026
cs.SIcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/8c6860cf-6c93-47e8-a7a4-615397015286" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.