This paper introduces the notion of comodularity, to cocluster observations of bipartite networks into co-communities. The task of coclustering is to group together nodes of one type with nodes of another type, according to the interactions that are the most similar. The measure of comodularity is introduced to assess the strength of co-communities, as well as to arrange the representation of nodes and clusters for visualization, and to define an objective function for optimization. We demonstrate the usefulness of our proposed methodology on simulated data, and with examples from genomics and consumer-product reviews
Community detection or clustering is a fundamental task in the analysis of network data. Many real n...
In this work we are interested in identifying clusters of “positional equivalent” actors, i.e. actor...
Abstract. Community is tightly-connected group of agents in social networks and the discovery of suc...
Community detection or clustering is a fundamental task in the analysis of network data. Most networ...
In a bipartite network, nodes are divided into two types, and edges are only allowed to connect node...
Despite a long tradition in the study of graphs and relational data, for decades the analysis of com...
Abstract. Bipartite networks are a useful tool for representing and investigating interaction net-wo...
International audienceDetecting and analyzing dense subgroups or communities from social and informa...
The analysis of complex networks is an important research topic that helps us understand the underly...
Graphs or networks are mathematical structures that consist of elements that can be pairwise linked ...
In this paper we propose methodology for inference of binary-valued adjacency matrices from various...
Networks are abstract representations of systems in which objects called "nodes" interact with each ...
The existence of community structures in networks is not unusual, including in the domains of sociol...
Networks with node covariates offer two advantages to community detection methods, namely, (i) explo...
Some studies on networks require to isolate groups of elements, known as Com-munities. Some examples...
Community detection or clustering is a fundamental task in the analysis of network data. Many real n...
In this work we are interested in identifying clusters of “positional equivalent” actors, i.e. actor...
Abstract. Community is tightly-connected group of agents in social networks and the discovery of suc...
Community detection or clustering is a fundamental task in the analysis of network data. Most networ...
In a bipartite network, nodes are divided into two types, and edges are only allowed to connect node...
Despite a long tradition in the study of graphs and relational data, for decades the analysis of com...
Abstract. Bipartite networks are a useful tool for representing and investigating interaction net-wo...
International audienceDetecting and analyzing dense subgroups or communities from social and informa...
The analysis of complex networks is an important research topic that helps us understand the underly...
Graphs or networks are mathematical structures that consist of elements that can be pairwise linked ...
In this paper we propose methodology for inference of binary-valued adjacency matrices from various...
Networks are abstract representations of systems in which objects called "nodes" interact with each ...
The existence of community structures in networks is not unusual, including in the domains of sociol...
Networks with node covariates offer two advantages to community detection methods, namely, (i) explo...
Some studies on networks require to isolate groups of elements, known as Com-munities. Some examples...
Community detection or clustering is a fundamental task in the analysis of network data. Many real n...
In this work we are interested in identifying clusters of “positional equivalent” actors, i.e. actor...
Abstract. Community is tightly-connected group of agents in social networks and the discovery of suc...