Search Results for author: Cuiying Huo

Found 5 papers, 1 papers with code

KGTrust: Evaluating Trustworthiness of SIoT via Knowledge Enhanced Graph Neural Networks

no code implementations22 Feb 2023 Zhizhi Yu, Di Jin, Cuiying Huo, Zhiqiang Wang, Xiulong Liu, Heng Qi, Jia Wu, Lingfei Wu

Graph neural networks for trust evaluation typically adopt a straightforward way such as one-hot or node2vec to comprehend node characteristics, which ignores the valuable semantic knowledge attached to nodes.

T2-GNN: Graph Neural Networks for Graphs with Incomplete Features and Structure via Teacher-Student Distillation

no code implementations24 Dec 2022 Cuiying Huo, Di Jin, Yawen Li, Dongxiao He, Yu-Bin Yang, Lingfei Wu

A key premise for the remarkable performance of GNNs relies on complete and trustworthy initial graph descriptions (i. e., node features and graph structure), which is often not satisfied since real-world graphs are often incomplete due to various unavoidable factors.

TrustGNN: Graph Neural Network based Trust Evaluation via Learnable Propagative and Composable Nature

no code implementations25 May 2022 Cuiying Huo, Di Jin, Chundong Liang, Dongxiao He, Tie Qiu, Lingfei Wu

In this work, we propose a new GNN based trust evaluation method named TrustGNN, which integrates smartly the propagative and composable nature of trust graphs into a GNN framework for better trust evaluation.

Recommendation Systems

Heterogeneous Graph Neural Networks using Self-supervised Reciprocally Contrastive Learning

no code implementations30 Apr 2022 Cuiying Huo, Dongxiao He, Yawen Li, Di Jin, Jianwu Dang, Weixiong Zhang, Witold Pedrycz, Lingfei Wu

However, the existing contrastive learning methods are inadequate for heterogeneous graphs because they construct contrastive views only based on data perturbation or pre-defined structural properties (e. g., meta-path) in graph data while ignore the noises that may exist in both node attributes and graph topologies.

Attribute Contrastive Learning

Universal Graph Convolutional Networks

1 code implementation NeurIPS 2021 Di Jin, Zhizhi Yu, Cuiying Huo, Rui Wang, Xiao Wang, Dongxiao He, Jiawei Han

So can we reasonably utilize these segmentation rules to design a universal propagation mechanism independent of the network structural assumption?

Cannot find the paper you are looking for? You can Submit a new open access paper.