Eva: Attribute-Aware Network Segmentation

  title={Eva: Attribute-Aware Network Segmentation},
  author={Salvatore Citraro and Giulio Rossetti},
  booktitle={COMPLEX NETWORKS},
Identifying topologically well-defined communities that are also homogeneous w.r.t. attributes carried by the nodes that compose them is a challenging social network analysis task. We address such a problem by introducing Eva, a bottom-up low complexity algorithm designed to identify network hidden mesoscale topologies by optimizing structural and attribute-homophilic clustering criteria. We evaluate the proposed approach on heterogeneous real-world labeled network datasets, such as co-citation… 

Identifying and exploiting homogeneous communities in labeled networks

This work addresses such a challenging task presenting Eva, an algorithmic approach designed to maximize a quality function tailoring both structural and homophilic clustering criteria, and suggests that Eva is the only method able to discover homogeneous clusters without considerably degrading partition modularity.

X-Mark: a benchmark for node-attributed community discovery algorithms

This work presents X-Mark, a model that generates synthetic node-attributed graphs with planted communities that consists in forming communities and node labels contextually while handling categorical or continuous attributive information.

High Influencing Pattern Discovery over Time Series Data

This work defined a new concept of proximity to depict semantic nearness between instances of distinct features, thus applying a star-shaped materialized model to mine influencing patterns and constructed influencing metrics, which set a threshold to discover high influencing patterns.

Toward a Standard Approach for Echo Chamber Detection: Reddit Case Study

A general framework to identify echo chambers on online social networks built on top of features they commonly share, based on a four-step pipeline that involves the identification of a controversial issue and the inference of users’ ideology on the controversy, is proposed.



Community Detection based on Structural and Attribute Similarities

Two algorithms that use both structural and attribute information to extract communities are proposed that partition a graph with attributes into communities so that the nodes in the same community are densely connected as well as homogeneous.

I-Louvain: An Attributed Graph Clustering Method

This article introduces a complementary measure, based on inertia, and specially conceived to evaluate the quality of a partition based on real attributes describing the vertices, which is more robust to data degradation.

Community Detection in Networks with Node Attributes

This paper develops Communities from Edge Structure and Node Attributes (CESNA), an accurate and scalable algorithm for detecting overlapping communities in networks with node attributes that statistically models the interaction between the network structure and the node attributes, which leads to more accurate community detection as well as improved robustness in the presence of noise in thenetwork structure.

Structure and attributes community detection: comparative analysis of composite, ensemble and selection methods

This paper compares the novel clustering method, termed Selection method, against seven clustering methods; it is shown that the Selection method out performed the state-of-art structure and attribute methods.

Fast unfolding of communities in large networks

This work proposes a heuristic method that is shown to outperform all other known community detection methods in terms of computation time and the quality of the communities detected is very good, as measured by the so-called modularity.

Learning to Discover Social Circles in Ego Networks

A novel machine learning task of identifying users' social circles is defined as a node clustering problem on a user's ego-network, a network of connections between her friends, and a model for detecting circles is developed that combines network structure as well as user profile information.

Graph Clustering Based on Structural/Attribute Similarities

This paper proposes a novel graph clustering algorithm, SA-Cluster, based on both structural and attribute similarities through a unified distance measure, which partitions a large graph associated with attributes into k clusters so that each cluster contains a densely connected subgraph with homogeneous attribute values.

Near linear time algorithm to detect community structures in large-scale networks.

This paper investigates a simple label propagation algorithm that uses the network structure alone as its guide and requires neither optimization of a predefined objective function nor prior information about the communities.

Resolution limit in community detection

It is found that modularity optimization may fail to identify modules smaller than a scale which depends on the total size of the network and on the degree of interconnectedness of the modules, even in cases where modules are unambiguously defined.

Maps of random walks on complex networks reveal community structure

An information theoretic approach is introduced that reveals community structure in weighted and directed networks of large-scale biological and social systems and reveals a directional pattern of citation from the applied fields to the basic sciences.