attributed network
Recently Published Documents


TOTAL DOCUMENTS

98
(FIVE YEARS 74)

H-INDEX

9
(FIVE YEARS 3)

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 2132 (1) ◽  
pp. 012035
Author(s):  
Wujun Tao ◽  
Yu Ye ◽  
Bailin Feng

Abstract There is a growing body of literature that recognizes the importance of network embedding. It intends to encode the graph structure information into a low-dimensional vector for each node in the graph, which benefits the downstream tasks. Most of recent works focus on supervised learning. But they are usually not feasible in real-world datasets owing to the high cost to obtain labels. To address this issue, we design a new unsupervised attributed network embedding method, deep attributed network embedding by mutual information maximization (DMIM). Our method focuses on maximizing mutual information between the hidden representations of the global topological structure and the node attributes, which allows us to obtain the node embedding without manual labeling. To illustrate the effectiveness of our method, we carry out the node classification task using the learned node embeddings. Compared with the state-of-the-art unsupervised methods, our method achieves superior results on various datasets.


2021 ◽  
Vol 232 ◽  
pp. 107448
Author(s):  
Darong Lai ◽  
Sheng Wang ◽  
Zhihong Chong ◽  
Weiwei Wu ◽  
Christine Nardini

2021 ◽  
Vol 2082 (1) ◽  
pp. 012011
Author(s):  
Xiang Xiao ◽  
Kang Zhang ◽  
Shuang Qiu ◽  
Wei Liu

Abstract Network embedding has attracted a surge of attention recently. In this field, how to preserve high-order proximity has long been a difficult task. Graph convolutional network (GCN) and random walk-based approaches can preserve high-order proximity to a certain extent. However, they partially concentrate on the aggregation process and sampling process respectively. Path aggregation methods combine the merits of GCN and random walk, and thus can preserve more high-order information and achieve better performance. However, path aggregation framework has not been applied in attributed network embedding yet. In this paper, we propose a path aggregation model for attributed network embedding, with two main contributions. First, we claim that there always exists implicit edge weight in networks, and design a tweaked random walk algorithm to sample paths accordingly. Second, we propose a path aggregation framework dealing with both nodes and attributes. Extensive experimental results show that our proposal outperforms the cutting-edge baselines on downstream tasks, such as node clustering, node classification, and link prediction.


2021 ◽  
Author(s):  
Shuang Zhou ◽  
Qiaoyu Tan ◽  
Zhiming Xu ◽  
Xiao Huang ◽  
Fu-lai Chung

Author(s):  
Liang Yang ◽  
Fan Wu ◽  
Zichen Zheng ◽  
Bingxin Niu ◽  
Junhua Gu ◽  
...  

Most attempts on extending Graph Neural Networks (GNNs) to Heterogeneous Information Networks (HINs) implicitly take the direct assumption that the multiple homogeneous attributed networks induced by different meta-paths are complementary. The doubts about the hypothesis of complementary motivate an alternative assumption of consensus. That is, the aggregated node attributes shared by multiple homogeneous attributed networks are essential for node representations, while the specific ones in each homogeneous attributed network should be discarded. In this paper, a novel Heterogeneous Graph Information Bottleneck (HGIB) is proposed to implement the consensus hypothesis in an unsupervised manner. To this end, information bottleneck (IB) is extended to unsupervised representation learning by leveraging self-supervision strategy. Specifically, HGIB simultaneously maximizes the mutual information between one homogeneous network and the representation learned from another homogeneous network, while minimizes the mutual information between the specific information contained in one homogeneous network and the representation learned from this homogeneous network. Model analysis reveals that the two extreme cases of HGIB correspond to the supervised heterogeneous GNN and the infomax on homogeneous graph, respectively. Extensive experiments on real datasets demonstrate that the consensus-based unsupervised HGIB significantly outperforms most semi-supervised SOTA methods based on complementary assumption.


2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Yuye Wang ◽  
Jing Yang ◽  
Jianpei Zhan

Vertex attributes exert huge impacts on the analysis of social networks. Since the attributes are often sensitive, it is necessary to seek effective ways to protect the privacy of graphs with correlated attributes. Prior work has focused mainly on the graph topological structure and the attributes, respectively, and combining them together by defining the relevancy between them. However, these methods need to add noise to them, respectively, and they produce a large number of required noise and reduce the data utility. In this paper, we introduce an approach to release graphs with correlated attributes under differential privacy based on early fusion. We combine the graph topological structure and the attributes together with a private probability model and generate a synthetic network satisfying differential privacy. We conduct extensive experiments to demonstrate that our approach could meet the request of attributed networks and achieve high data utility.


Sign in / Sign up

Export Citation Format

Share Document