Inverse Resolution Limit of Partition Density and Detecting Overlapping Communities by Link-Surprise
نویسندگان
چکیده
منابع مشابه
Detecting Overlapping Link Communities
We propose an algorithm for detecting communities of links in networks which uses local information, is based on a new evaluation function, and allows for pervasive overlaps of communities. The complexity of the clustering task requires the application of a memetic algorithm that combines probabilistic evolutionary strategies with deterministic local searches. In Part 2 we will present results ...
متن کاملDetecting Overlapping Communities Based on Link-link Similarity and SNMF
In this paper, we present a method named OCDLS that is based on link-link similarity and SNMF (symmetric nonnegative matrix factorization) to detect overlapping communities. To begin with constructing the link-link similarity matrix, and then using SNMF to partition links, finally computing the overlapping factor, and assigning nodes to the corresponding communities according to the prespecifie...
متن کاملOverlapping Communities Detection based on Link Partition in Directed Networks
Many complex systems can be described as networks to comprehend both the structure and the function. Community structure is one of the most important properties of complex networks. Detecting overlapping communities in networks have been more attention in recent years, but the most of approaches to this problem have been applied to the undirected networks. This paper presents a novel approach b...
متن کاملDetecting communities using asymptotical Surprise
Nodes in real-world networks are repeatedly observed to form dense clusters, often referred to as communities. Methods to detect these groups of nodes usually maximize an objective function, which implicitly contains the definition of a community. We here analyze a recently proposed measure called surprise, which assesses the quality of the partition of a network into communities. In its curren...
متن کاملDetecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2017
ISSN: 2045-2322
DOI: 10.1038/s41598-017-12432-1