首页> 外文会议>IEEE International Conference on Anti-Counterfeiting, Security and Identification >Time-efficient algorithm on degree anonymization by combination of vertex and edge addition
【24h】

Time-efficient algorithm on degree anonymization by combination of vertex and edge addition

机译:通过顶点和边缘的组合添加时间高效的程度匿名算法

获取原文

摘要

In previous work about privacy preservation of graph modeled network, k-degree-anonymization has been a well-developed subject. We studied various researches on both edge addition and vertex addition. In many algorithms, the edge addition is a heuristic process, which may bring in some extra time cost. Interested in the problem, we introduce the idea of vertex addition, and develop a framework that combines edge addition and vertex addition. We use a greedy idea to add edges in the original graph, and use as least pseudo vertices as possible to produce a k-degree-anonymous graph. The time efficiency of our approach lies on the nature of greed edge addition.
机译:在以前关于图形建模网络的隐私保存的工作中,k度匿名化已经成为一个发达的主题。我们研究了对两个边缘加法和顶点的各种研究。在许多算法中,边​​缘添加是启发式过程,这可能会带来一些额外的时间成本。对问题感兴趣,我们介绍了顶点的概念,并开发了一个结合边缘加法和顶点的框架。我们使用贪婪的想法在原始图中添加边缘,并使用尽可能最小的伪顶点以产生k度匿名图。我们方法的时间效率在于贪婪边缘的性质。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号