Jiao Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jiao Liu has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Xiaolin Zhang
School of Information Engineering, Inner Mongolia University of Science and Technology, Baotou, China
3 shared publications - Jian Li
School of Information Engineering, Inner Mongolia University of Science and Technology, Baotou, Inner Mongolia 014010, China
2 shared publications Lixin Liu
School of Information Engineering, Inner Mongolia University of Science and Technology, Baotou, Inner Mongolia 014010, China and School of Information Resource Management, Renmin University of China, Beijing, Beijing 100000, China
2 shared publicationsHuanxiang Zhang
School of Information Engineering, Inner Mongolia University of Science and Technology, Baotou, Inner Mongolia 014010, China and School of Computer Engineering and Science, Shanghai University, Shanghai, Shanghai 200000, China
1 shared publication- Jian Li
Inner Mongolia University of Science and Technology
1 shared publication - Xiaoyu He
Shanghai University
1 shared publication
Latest Publications
- 28 November 2019
- Published by Springer Nature
- p. 194-208
Distributed Graph Perturbation Algorithm on Social Networks with Reachability Preservation
- 28 November 2019
- Published by Springer Nature
- p. 194-208
Distributed Graph Perturbation Algorithm on Social Networks with Reachability Preservation
- Open Access
- 23 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 137759-137769
Social Network Sensitive Area Perturbance Method Based on Firefly Algorithm
Social network analysis has many essential applications, but it depends on sharing and publishing the underlying graph. The real dataset published by social networks has great appeal to researchers and research institutions. However, publishing datasets can create many security and privacy problems. A standard technique for achieving link privacy is to randomize a link over the space for node pairs based on probabilistically. Aiming at the problem of social network link privacy, a Sensitive Area Perturbance Based on Firefly (SAPBF) algorithm is proposed. Improve the data availability of the published graph by limiting the range of random perturbations. The specific method is to measure the influence of nodes, such as k-core, degree, and PageRank algorithms to obtain nodes with different influences. The firefly algorithm is applied to the social network to find high-influence nodes. The low-influence nodes are gathered around the high-influence nodes to form sensitive areas. Finally, according to different edge retention probability, the random perturbation algorithm protects privacy in the sensitive area. The content of the social network is continuously enriched and the scale is increasing. The performance of the anonymous algorithm of the single-machine social network graph is limited. The SAPBF algorithm is parallelized based on the Pregel model. The results of the algorithm in the real experimental dataset show that the proposed algorithm guarantees the property of the graph while ensuring the anonymity. Compared with the traditional random perturbation algorithm, the distributed processing graph improves the efficiency while ensuring the data availability of the graph.
- 23 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 137759-137769
Open AccessSocial Network Sensitive Area Perturbance Method Based on Firefly Algorithm
Social network analysis has many essential applications, but it depends on sharing and publishing the underlying graph. The real dataset published by social networks has great appeal to researchers and research institutions. However, publishing datasets can create many security and privacy problems. A standard technique for achieving link privacy is to randomize a link over the space for node pairs based on probabilistically. Aiming at the problem of social network link privacy, a Sensitive Area Perturbance Based on Firefly (SAPBF) algorithm is proposed. Improve the data availability of the published graph by limiting the range of random perturbations. The specific method is to measure the influence of nodes, such as k-core, degree, and PageRank algorithms to obtain nodes with different influences. The firefly algorithm is applied to the social network to find high-influence nodes. The low-influence nodes are gathered around the high-influence nodes to form sensitive areas. Finally, according to different edge retention probability, the random perturbation algorithm protects privacy in the sensitive area. The content of the social network is continuously enriched and the scale is increasing. The performance of the anonymous algorithm of the single-machine social network graph is limited. The SAPBF algorithm is parallelized based on the Pregel model. The results of the algorithm in the real experimental dataset show that the proposed algorithm guarantees the property of the graph while ensuring the anonymity. Compared with the traditional random perturbation algorithm, the distributed processing graph improves the efficiency while ensuring the data availability of the graph.
- Open Access
- 5 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 108371-108383
Large-Scale Dynamic Social Network Directed Graph K-In&Out-Degree Anonymity Algorithm for Protecting Community Structure
Social network data publishing is dynamic, and attackers can perform association attacks based on social network directed graph data at different times. The existing social network privacy protection technology has low performance in dealing with large-scale dynamic social network directed graph data, and anonymous data publishing does not meet the needs of community structure analysis. A Dynamic Social Network Directed Graph K-In&Out-Degree Anonymity (DSNDG-KIODA) method to protect community structure is proposed. The method is based on the dynamic grouping anonymity rule to anonymize the dynamic K-in&out-degree sequence, and the virtual node distribution is added in parallel to construct an anonymous graph. The node information is transmitted based on the GraphX, and the virtual node pairs are selected and deleted according to the change of the directed graph modularity to reduce information loss. The experimental results show that the DSNDG-KIODA method improves the efficiency of processing large-scale dynamic social network directed graph data, and ensures the availability of community structure analysis when data is released.
- 5 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 108371-108383
Open AccessLarge-Scale Dynamic Social Network Directed Graph K-In&Out-Degree Anonymity Algorithm for Protecting Community Structure
Social network data publishing is dynamic, and attackers can perform association attacks based on social network directed graph data at different times. The existing social network privacy protection technology has low performance in dealing with large-scale dynamic social network directed graph data, and anonymous data publishing does not meet the needs of community structure analysis. A Dynamic Social Network Directed Graph K-In&Out-Degree Anonymity (DSNDG-KIODA) method to protect community structure is proposed. The method is based on the dynamic grouping anonymity rule to anonymize the dynamic K-in&out-degree sequence, and the virtual node distribution is added in parallel to construct an anonymous graph. The node information is transmitted based on the GraphX, and the virtual node pairs are selected and deleted according to the change of the directed graph modularity to reduce information loss. The experimental results show that the DSNDG-KIODA method improves the efficiency of processing large-scale dynamic social network directed graph data, and ensures the availability of community structure analysis when data is released.