Jing Yang 0010

dblp:62/5839-10 · DBLP profile ↗
← Back
9ranked-venue papers in the field
0as first author
5since 2021 · last 2023
0000-0001-6646-3401ORCID · conflict

Domains — venue-derived; a paper can count in several

Knowledge Engineering, Semantic Web & Information Systems · 8Data Mining & Knowledge Discovery · 1
YearPublicationVenuePosition
2023 Critical Node Privacy Protection Based on Random Pruning of Critical Trees
Lianwei Qu, Yong Wang 0020, Jing Yang 0010
KSEM (1)3
2023 Robust dimensionality reduction method based on relaxed energy and structure preserving embedding for multiview clustering
Zhongyan Gui, Jing Yang 0010, Zhiqiang Xie 0002
Inf. Sci.2
2022 CEO: Identifying Overlapping Communities via Construction, Expansion and Optimization
Hailu Yang 0001, Jianpei Zhang, Jing Yang 0010, Xiaohong Xiang
Inf. Sci.4
2022 Aggregated graph convolutional networks for aspect-based sentiment classification
Jing Yang 0010, Jianpei Zhang, Shenglong Wang
Inf. Sci.2
2021 Clustering Massive-Categories and Complex Documents via Graph Convolutional Network
Qingchao Zhao, Jing Yang 0010, Zhengkui Wang, Yan Chu 0001, Wen Shan, Isfaque Al Kaderi Tuhin
KSEM2
2018 An Algorithm of Influence Maximization in Social Network Based on Local Structure Characteristics
Yong Wang 0020, Jing Yang 0010, Jianpei Zhang
KSEM (2)4
2018 Personalized Trajectory Privacy Protection Method Based on User-Requirement
abstract
Trajectory data often provides useful information that can be utilized in real-life applications, such as traffic planning and location-based advertising. Because people’s trajectory information can result in serious personal privacy leakage, trajectory privacy protection methods are employed. However, existing methods assume and use the same privacy requirements for all trajectories, which affect privacy protection efficiency and data utilization. This paper proposes a trajectory privacy protection method based on user requirement. By dividing different time intervals, it sets different privacy protection parameters for different trajectories to provide more detailed privacy protection. The proposed method utilizes the divided time intervals and privacy protection requirements to form a privacy requirement matrix, to construct an anonymous trajectory equivalence class and undirected graph. Then, trajectories are processed to form anonymous sets. Euclidean distance is also replaced with Manhattan distance in calculating the distance of the trajectories, which would improve the privacy protection and data utility and narrow the gap between the theoretical privacy protection and the actual protective effects. Comparative experiments demonstrate that the proposed method outperforms other similar methods in regards to both privacy protection and data utilization.
Zhaowei Hu, Jing Yang 0010, Jianpei Zhang
Int. J. Cooperative Inf. Syst.2
2017 The privacy preserving method for dynamic trajectory releasing based on adaptive clustering
Zhiqiang Xie 0002, Jing Yang 0010
Inf. Sci.3
2007 An Improved AdaBoost Algorithm Based on Adaptive Weight Adjusting
Lili Cheng, Jianpei Zhang, Jing Yang 0010
ADMA3