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

Chaorun Sun

dblp:348/8186 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2026
—ORCID · none

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

Computer networks · 2 · 2 since 2021Security and privacy · 1 · 1 since 2021

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
2 papers
Privacy and data protection · 100%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

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

TopicWeightPapersLastEvidence papers
Privacy and data protection
differential privacy
1.012026
Differential Privacy Space Decomposition Algorithm Based on Hierarchical Model · IEEE Trans. Mob. Comput. 2026
Privacy and data protection
privacy-preserving data analysis
0.812024
Privacy-Enhanced Frequent Sequence Mining and Retrieval for Personalized Behavior Prediction · IEEE Trans. Inf. Forensics Secur. 2024
Privacy and data protection › privacy-preserving data analysis
privacy-preserving data mining
0.812024
Privacy-Enhanced Frequent Sequence Mining and Retrieval for Personalized Behavior Prediction · IEEE Trans. Inf. Forensics Secur. 2024
Recommender systems › user modeling
user behavior prediction
0.212024
Privacy-Enhanced Frequent Sequence Mining and Retrieval for Personalized Behavior Prediction · IEEE Trans. Inf. Forensics Secur. 2024

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

symmetric encryption · 1.5markov assumption · 1.5encrypted index forest · 1.5differential privacy · 1.5noise injection · 1.0heuristic merging · 1.0consistency constraints · 1.0
YearPublicationVenuePosition
2026 Differential Privacy Space Decomposition Algorithm Based on Hierarchical Model
abstract
Choosing an appropriate division method is crucial for partitioning two-dimensional spatial data under the constraints of differential privacy. The current mainstream partitioning methods include grid-based partitioning and hierarchical partitioning. In order to optimize query accuracy while satisfying differential privacy conditions, it remains challenge to achieve the sum minimization of noise error and uniformity assumption error. To address this issue, we propose the HOLG (Hierarchical Optimization of Logical Grids) algorithm, employing a ”divide-merge-divide” approach. It begins with fine-grained grid partitioning of the data domain, followed by heuristic merging of grids with similar data distributions. After determining the scale of the query domain, the merged regions are further subdivided into smaller regions with similar query probabilities, constructing a hierarchical structure to reduce uniformity assumption errors. Additionally, we design a novel noise injection method and introduce consistency constraints to further minimize noise errors. To reduce the time complexity of the HOLG partitioning method, Huffman trees is employed to optimize the processing of the hierarchical tree set generated by HOLG, ensuring query utility while effectively reducing the query response time for the partitioning algorithm. Experimental results on large-scale spatial datasets demonstrate that HOLG outperforms similar algorithms in query accuracy. Furthermore, when combined with the Huffman tree optimization, it effectively reduces query response time.
Haiping Huang, Chaorun Sun, Zhenqi Shi, Wei Zhang 0122, Jiyun Cang, Fu Xiao 0001
IEEE Trans. Mob. Comput.2
2024 Privacy-Enhanced Frequent Sequence Mining and Retrieval for Personalized Behavior Prediction
abstract
The widespread use of smartphones has yielded a wealth of behavioral sequence data from user interactions. These interactions offer insights into user preferences and patterns for personalized behavior prediction. However, there are some challenges in current privacy-preserving works for analyzing these data. These approaches have suboptimal service quality with smaller but longer datasets and insufficient emphasis on secure pattern storage and retrieval in real-world applications. To handle these challenges on smartphones, we propose a novel Privacy-enhanced Frequent Sequence Mining and Retrieval (PrivFSMR) framework for this scenario. Specifically, we first introduce a dynamic sequence truncation to anonymize the maximum sequence length of datasets. Following this, we design a privacy-enhanced FSM algorithm to uncover patterns, effectively reducing the privacy budget by integrating differential privacy and the Markov assumption. During the secure pattern storage, PrivFSMR employs symmetric encryption for protection and constructs an encrypted index forest for retrieval. Lastly, future behavior retrieval leverages current device information and the index forest to search similar patterns, thereby predicting potential user behaviors in the future. A comprehensive security analysis proves the PrivFSMR framework guarantees differential privacy and maintains storage and retrieval confidentiality in the lifecycle. In addition to using two publicly available datasets, we also collected a real behavior dataset within 2-4 weeks from 30 users for evaluation. Experimental results on three datasets demonstrate that PrivFSMR excels in mining frequent patterns and predicting future behaviors compared to existing approaches.
Shuyu Chang, Zhenqi Shi, Fu Xiao 0001, Haiping Huang, Chaorun Sun
IEEE Trans. Inf. Forensics Secur.6
2023 MuAt-Va: Multi-Attention and Video-Auxiliary Network for Device-Free Action Recognition
abstract
With the growing popularity of Internet of Things (IoT) systems, device-free action recognition begins to attract extensive attention due to its friendly feasibility in broad applications, such as human–computer interaction and smart elderly care. Considering abundant information in the vision modality, existing methods adopt the cross-model methods for performance enhancement. However, the dependency of synchronous multimodal data in the collection and recognition stage brings into the vision weaknesses, such as sensitivity to occlusion and privacy invasion. In this article, we integrate multi-attention structure and auxiliary video information into a novel end-to-end deep learning framework named MuAt-Va, in which video soft labels learned in advance are utilized to teach the multi-attention WiFi feature training process without vision information involved during the test. Specifically, in order to enlarge the application scope and reduce the data cost, we beforehand acquire videos under a satisfactory condition only once, and then leverage teacher–student mechanism to guide the WiFi stream. Instead of straightforwardly concatenating multiantenna channel state information (CSI) from homogeneous wireless signals as previous works, we design a CSI subcarrier-wise, temporal-wise, and view-wise attention module to assign different weights on the basis of data characteristics for the sensing task. Our experiments with multiple subjects data in two scenes demonstrate that MuAt-Va can accurately recognize human actions with more superior performances.
Biyun Sheng, Chaorun Sun, Fu Xiao 0001, Linqing Gui
IEEE Internet Things J.2