attributed networks
Recently Published Documents


TOTAL DOCUMENTS

137
(FIVE YEARS 129)

H-INDEX

9
(FIVE YEARS 9)

2022 ◽  
Vol 16 (3) ◽  
pp. 1-21
Author(s):  
Heli Sun ◽  
Yang Li ◽  
Bing Lv ◽  
Wujie Yan ◽  
Liang He ◽  
...  

Graph representation learning aims at learning low-dimension representations for nodes in graphs, and has been proven very useful in several downstream tasks. In this article, we propose a new model, Graph Community Infomax (GCI), that can adversarial learn representations for nodes in attributed networks. Different from other adversarial network embedding models, which would assume that the data follow some prior distributions and generate fake examples, GCI utilizes the community information of networks, using nodes as positive(or real) examples and negative(or fake) examples at the same time. An autoencoder is applied to learn the embedding vectors for nodes and reconstruct the adjacency matrix, and a discriminator is used to maximize the mutual information between nodes and communities. Experiments on several real-world and synthetic networks have shown that GCI outperforms various network embedding methods on community detection tasks.


2022 ◽  
Vol 40 (3) ◽  
pp. 1-36
Author(s):  
Jinyuan Fang ◽  
Shangsong Liang ◽  
Zaiqiao Meng ◽  
Maarten De Rijke

Network-based information has been widely explored and exploited in the information retrieval literature. Attributed networks, consisting of nodes, edges as well as attributes describing properties of nodes, are a basic type of network-based data, and are especially useful for many applications. Examples include user profiling in social networks and item recommendation in user-item purchase networks. Learning useful and expressive representations of entities in attributed networks can provide more effective building blocks to down-stream network-based tasks such as link prediction and attribute inference. Practically, input features of attributed networks are normalized as unit directional vectors. However, most network embedding techniques ignore the spherical nature of inputs and focus on learning representations in a Gaussian or Euclidean space, which, we hypothesize, might lead to less effective representations. To obtain more effective representations of attributed networks, we investigate the problem of mapping an attributed network with unit normalized directional features into a non-Gaussian and non-Euclidean space. Specifically, we propose a hyperspherical variational co-embedding for attributed networks (HCAN), which is based on generalized variational auto-encoders for heterogeneous data with multiple types of entities. HCAN jointly learns latent embeddings for both nodes and attributes in a unified hyperspherical space such that the affinities between nodes and attributes can be captured effectively. We argue that this is a crucial feature in many real-world applications of attributed networks. Previous Gaussian network embedding algorithms break the assumption of uninformative prior, which leads to unstable results and poor performance. In contrast, HCAN embeds nodes and attributes as von Mises-Fisher distributions, and allows one to capture the uncertainty of the inferred representations. Experimental results on eight datasets show that HCAN yields better performance in a number of applications compared with nine state-of-the-art baselines.


2021 ◽  
Vol 30 (4) ◽  
pp. 441-455
Author(s):  
Rinat Aynulin ◽  
◽  
Pavel Chebotarev ◽  
◽  

Proximity measures on graphs are extensively used for solving various problems in network analysis, including community detection. Previous studies have considered proximity measures mainly for networks without attributes. However, attribute information, node attributes in particular, allows a more in-depth exploration of the network structure. This paper extends the definition of a number of proximity measures to the case of attributed networks. To take node attributes into account, attribute similarity is embedded into the adjacency matrix. Obtained attribute-aware proximity measures are numerically studied in the context of community detection in real-world networks.


Author(s):  
Xu Yuan ◽  
Na Zhou ◽  
Shuo Yu ◽  
Huafei Huang ◽  
Zhikui Chen ◽  
...  

2021 ◽  
Author(s):  
Kamal Berahmand ◽  
Mehrnoush Mohammadi ◽  
Azadeh Faroughi ◽  
Rojiar Pir Mohammadiani

2021 ◽  
Vol 6 (1) ◽  
Author(s):  
Leonie Neuhäuser ◽  
Felix I. Stamm ◽  
Florian Lemmerich ◽  
Michael T. Schaub ◽  
Markus Strohmaier

AbstractNetwork analysis provides powerful tools to learn about a variety of social systems. However, most analyses implicitly assume that the considered relational data is error-free, and reliable and accurately reflects the system to be analysed. Especially if the network consists of multiple groups (e.g., genders, races), this assumption conflicts with a range of systematic biases, measurement errors and other inaccuracies that are well documented in the literature. To investigate the effects of such errors we introduce a framework for simulating systematic bias in attributed networks. Our framework enables us to model erroneous edge observations that are driven by external node attributes or errors arising from the (hidden) network structure itself. We exemplify how systematic inaccuracies distort conclusions drawn from network analyses on the task of minority representations in degree-based rankings. By analysing synthetic and real networks with varying homophily levels and group sizes, we find that the effect of introducing systematic edge errors depends on both the type of edge error and the level of homophily in the system: in heterophilic networks, minority representations in rankings are very sensitive to the type of systematic edge error. In contrast, in homophilic networks we find that minorities are at a disadvantage regardless of the type of error present. We thus conclude that the implications of systematic bias in edge data depend on an interplay between network topology and type of systematic error. This emphasises the need for an error model framework as developed here, which provides a first step towards studying the effects of systematic edge-uncertainty for various network analysis tasks.


2021 ◽  
Author(s):  
Kenan Qin ◽  
Yihui Zhou ◽  
Bo Tian ◽  
Rui Wang

Sign in / Sign up

Export Citation Format

Share Document