Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zijun Song

dblp:115/9550 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Privacy and data protection · 100%
Artificial intelligence
1 paper
Graph learning · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph neural network
0.912025
Achieving Personalized Privacy-Preserving Graph Neural Network via Topology Awareness · WWW 2025
Machine learning › Graph learning › graph neural network
privacy-preserving graph neural network
0.912025
Achieving Personalized Privacy-Preserving Graph Neural Network via Topology Awareness · WWW 2025
Privacy and data protection
differential privacy
0.912025
Achieving Personalized Privacy-Preserving Graph Neural Network via Topology Awareness · WWW 2025
Privacy and data protection › differential privacy › relaxed differential privacy
personalized differential privacy
0.912025
Achieving Personalized Privacy-Preserving Graph Neural Network via Topology Awareness · WWW 2025
Privacy and data protection › privacy evaluation
privacy-utility tradeoff
0.312025
Achieving Personalized Privacy-Preserving Graph Neural Network via Topology Awareness · WWW 2025

Methods — techniques the papers use, named apart from their topics

weighted neighborhood aggregation · 1.7adjacency information entropy · 1.7
YearPublicationVenuePosition
2025 Achieving Personalized Privacy-Preserving Graph Neural Network via Topology Awareness
abstract
Graph neural networks (GNNs) with differential privacy (DP) offer a reliable solution for safeguarding sensitive information within graph data. Nonetheless, existing DP-based privacy-preserving GNN learning frameworks generally overlook the local topological heterogeneity of graph nodes and tailor the same privacy budget for all nodes, which may lead to either overprotection or underprotection of some nodes, potentially diminishing model utility or posing privacy leakage risks. To address this issue, we propose a Topology-aware Differential Privacy Graph Neural Network learning framework, termed TDP-GNN, which can achieve personalized privacy protection for each node with improved privacy-utility guarantees. Specifically, TDP-GNN first identifies the topological importance of each node via an adjacency information entropy method. Then, the personalized topology-aware privacy budget is designed to quantify the privacy sensitivity of each node and adaptively allocate the privacy protection strength. Besides, a weighted neighborhood aggregation mechanism is proposed during the message-passing process of GNN training, which can eliminate the impact of the introduced differentiated DP noise on the utility of the GNN model. Since TDP-GNN is based on node-level local DP, it can be seamlessly integrated into any GNN architecture in a plug-and-play manner while ensuring formal privacy guarantees. Theoretical analysis indicates that TDP-GNN achieves ε-differential privacy over the entire graph nodes while providing personalized privacy protection. Extensive experiments demonstrate that TDP-GNN consistently yields better utilities when applied to various GNN architectures (e.g., GCN and GraphSAGE) across a diverse set of benchmarks.
Dian Lei, Zijun Song, Yanli Yuan, Chunhai Li, Liehuang Zhu
WWW2
2020 Attention Bidirectional LSTM Networks Based Mime Speech Recognition Using sEMG Data
abstract
Surface electromyography (sEMG) has been proven competent and reliable to recognize speech musculature movement patterns. In other words, we can understand what a person prepares to say by collecting sEMG signals around the mouth. Therefore, sEMG-based Mime Speech Recognition (MSR) is a potential technique for human-machine interaction within noisy surroundings as well as the application of helping dysarthric patients. In this paper, we introduce multi-layer Bidirectional Long Short-Term Memory (BLSTM) networks with attention mechanism as a classifier for MSR, and verify it in the data set collected by ourselves. Six-channel sEMG signals are firstly acquired from elaborately selected facial muscles. Short-time Fourier Transform (STFT) and Convolutional Neural Networks (CNN) are utilized to extract time-frequency domain feature maps, replacing the handcrafted features in classic methods. The second phase of recognition process lies in the designed classifier. This classification system achieves over 97% accuracy in the four-class MSR task, significantly surpassing simple CNN and LSTM methods. Such result also indicates that excellent MSR results can be achieved without relying on handcrafted signal features.
Hongyi Ye, Haohong Lin, Zijun Song, Ruifen Hu, Guang Li 0001
SMC3