Image segmentation has many applications which range from machine learning to medical diagnosis. In this study, the authors propose a framework for the segmentation of images based on super-pixels and algorithms for c...
详细信息
Image segmentation has many applications which range from machine learning to medical diagnosis. In this study, the authors propose a framework for the segmentation of images based on super-pixels and algorithms for community identification in graphs. The super-pixel pre-segmentation step reduces the number of nodes in the graph, rendering the method the ability to process large images. Moreover, community detection algorithms provide more accurate segmentation than traditional approaches based on spectral graph partition. The authors also compared their method with two algorithms: (i) the graph-based approach by Felzenszwalb and Huttenlocher and (ii) the contour-based method by Arbelaez. Results have shown that their method provides more precise segmentation and is faster than both of them.
Detecting communities in large complex networks is important to understand their structure and to extract features useful for visualization or prediction of various phenomena like the diffusion of information or the d...
详细信息
Detecting communities in large complex networks is important to understand their structure and to extract features useful for visualization or prediction of various phenomena like the diffusion of information or the dynamic of the network. A community is defined by a set of strongly interconnected nodes. An alpha-quasi-clique is a group of nodes where each member is connected to more than a proportion alpha of the other nodes. By construction, an alpha-quasi-clique has a density greater than alpha. The size of an alpha-quasi-clique is limited by the degree of its nodes. In complex networks whose degree distribution follows a power law, usually alpha-quasi-cliques are small sets of nodes for high values of alpha. In this paper, we present an efficient method for finding the maximal alpha-quasi-clique of a given node in the network. Therefore, the resulting communities of our method have two main characteristics: they are alpha-quasi-cliques (very dense for high alpha) and they are local to the given node. Detecting the local community of specific nodes is very important for applications dealing with huge networks, when iterating through all nodes would be impractical or when the network is not entirely known. The proposed method, called RANK-NUM-NEIGHS (RNN), is evaluated experimentally on real and computer-generated networks in terms of quality (community size), execution time and stability. We also provide an upper bound on the optimal solution.
As new instances of nested organization—beyond ecological networks—are discovered, scholars are debating the coexistence of two apparently incompatible macroscale architectures: nestedness and modularity. The discus...
详细信息
As new instances of nested organization—beyond ecological networks—are discovered, scholars are debating the coexistence of two apparently incompatible macroscale architectures: nestedness and modularity. The discussion is far from being solved, mainly for two reasons. First, nestedness and modularity appear to emerge from two contradictory dynamics, cooperation and competition. Second, existing methods to assess the presence of nestedness and modularity are flawed when it comes to the evaluation of concurrently nested and modular structures. In this work, we tackle the latter problem, presenting the concept of in-block nestedness, a structural property determining to what extent a network is composed of blocks whose internal connectivity exhibits nestedness. We then put forward a set of optimization methods that allow us to identify such organization successfully, in synthetic and in a large number of real networks. These findings challenge our understanding of the topology of ecological and social systems, calling for new models to explain how such patterns emerge.
The assumption that the values of model parameters are known or correctly learned, i.e., the Nishimori condition, is one of the requirements for the detectability analysis of the stochastic block model in statistical ...
详细信息
The assumption that the values of model parameters are known or correctly learned, i.e., the Nishimori condition, is one of the requirements for the detectability analysis of the stochastic block model in statistical inference. In practice, however, there is no example demonstrating that we can know the model parameters beforehand, and there is no guarantee that the model parameters can be learned accurately. In this study, we consider the expectation–maximization (EM) algorithm with belief propagation (BP) and derive its algorithmic detectability threshold. Our analysis is not restricted to the community structure but includes general modular structures. Because the algorithm cannot always learn the planted model parameters correctly, the algorithmic detectability threshold is qualitatively different from the one with the Nishimori condition.
Communities in directed networks have often been characterized as regions with a high density of links, or as sets of nodes with certain patterns of connection. Our approach for communitydetection combines the optimi...
详细信息
Communities in directed networks have often been characterized as regions with a high density of links, or as sets of nodes with certain patterns of connection. Our approach for communitydetection combines the optimization of a quality function and a spectral clustering of a deformation of the combinatorial Laplacian, the so-called magnetic Laplacian. The eigenfunctions of the magnetic Laplacian, which we call magnetic eigenmaps, incorporate structural information. Hence, using the magnetic eigenmaps, dense communities including directed cycles can be revealed as well as “role” communities in networks with a running flow, usually discovered thanks to mixture models. Furthermore, in the spirit of the Markov stability method, an approach for studying communities at different energy levels in the network is put forward, based on a quantum mechanical system at finite temperature.
Given a network, the statistical ensemble of its graph-Voronoi diagrams with randomly chosen cell centers exhibits properties convertible into information on the network's large scale structures. We define a node-...
详细信息
Given a network, the statistical ensemble of its graph-Voronoi diagrams with randomly chosen cell centers exhibits properties convertible into information on the network's large scale structures. We define a node-pair level measure called Voronoi cohesion which describes the probability for sharing the same Voronoi cell, when randomly choosing g centers in the network. This measure provides information based on the global context (the network in its entirety), a type of information that is not carried by other similarity measures. We explore the mathematical background of this phenomenon and several of its potential applications. A special focus is laid on the possibilities and limitations pertaining to the exploitation of the phenomenon for communitydetection purposes.
communitydetection of network flows conventionally assumes one-step dynamics on the links. For sparse networks and interest in large-scale structures, longer timescales may be more appropriate. Oppositely, for large ...
详细信息
communitydetection of network flows conventionally assumes one-step dynamics on the links. For sparse networks and interest in large-scale structures, longer timescales may be more appropriate. Oppositely, for large networks and interest in small-scale structures, shorter timescales may be better. However, current methods for analyzing networks at different timescales require expensive and often infeasible network reconstructions. To overcome this problem, we introduce a method that takes advantage of the inner workings of the map equation and evades the reconstruction step. This makes it possible to efficiently analyze large networks at different Markov times with no extra overhead cost. The method also evades the costly unipartite projection for identifying flow modules in bipartite networks.
Recently, a phase transition has been discovered in the network communitydetection problem below which no algorithm can tell which nodes belong to which communities with success any better than a random guess. This r...
详细信息
Recently, a phase transition has been discovered in the network communitydetection problem below which no algorithm can tell which nodes belong to which communities with success any better than a random guess. This result has, however, so far been limited to the case where the communities have the same size or the same average degree. Here we consider the case where the sizes or average degrees differ. This asymmetry allows us to assign nodes to communities with better-than-random success by examining their local neighborhoods. Using the cavity method, we show that this removes the detectability transition completely for networks with four groups or fewer, while for more than four groups the transition persists up to a critical amount of asymmetry but not beyond. The critical point in the latter case coincides with the point at which local information percolates, causing a global transition from a less-accurate solution to a more-accurate one.
The participation of a node in more than one community is a common phenomenon in complex networks. However most existing methods, fail to identify nodes with multiple community affiliation, correctly. In this paper, a...
详细信息
The participation of a node in more than one community is a common phenomenon in complex networks. However most existing methods, fail to identify nodes with multiple community affiliation, correctly. In this paper, a unique method to define overlapping community in complex networks is proposed, using the overlapping neighborhood ratio to represent relations between nodes. Matrix factorization is then utilized to assign nodes into their corresponding community structures. Moreover, the proposed method demonstrates the use of Perron clusters to estimate the number of overlapping communities in a network. Experimental results in real and artificial networks show, with great accuracy, that the proposed method succeeds to recover most of the overlapping communities existing in the network. (C) 2014 Elsevier B.V. All rights reserved.
The number of community detection algorithms is growing continuously adopting a topological based approach to discover optimal subgraphs or communities. In this paper, we propose a new method combining both topology a...
详细信息
ISBN:
(纸本)9781509026289
The number of community detection algorithms is growing continuously adopting a topological based approach to discover optimal subgraphs or communities. In this paper, we propose a new method combining both topology and semantic to evaluate and rank community detection algorithms. To achieve this goal we consider a probabilistic topic based approach to define a new measure called semantic divergence of communities. Combining this measure with others related to prior knowledge, we compute a score for each algorithm to evaluate the effectiveness of its communities and propose a ranking method. We have evaluated our approach considering communities of real web services.
暂无评论