|
|
【答案】应助回帖
 商家已经主动声明此回帖可能含有宣传内容
★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ...
erickcwang: 金币+60, 翻译EPI+1, ★★★很有帮助, 非常感谢 2015-11-05 10:56:55
本文 采用 一种 基于 高度节点有限的 贪心分组策略 来满足（d,k）-匿名要求的
等价类，具体步骤如下：
步骤1：提取 每个节点的 d-领域子图，并用 下三角矩阵 来表示；
步骤2：按照 节点度 由高到底的顺序 对d-领域子图 三角矩阵 进行 同构异 或 匹配，将 满足同构要求的 节点 归于一类；
步骤3：将剩余 为分组的 节点 归入到 最接近的类中；
步骤4：通过 匿名化 使 各等价类 满足（d,k）-匿名。
In this paper, a greedy grouping strategy based on highly nodal finite method was adopted to meet the equivalence class required for (d, k) - anonymity. Specific steps are as follow:
Step 1: extricate the d - domain subgraph of each node, and express them using lower triangular matrix;
Step 2: Based on the sequence of node degree from high to low, the triangular matrix of d - domain subgraph was processed by process of isomorphism or matching, then group the nodes meeting isomorphism demands into the same class;
Step 3: Group the remaining nodes into the nearest class;
Step 4: Anonymize each equivalence class to meet the requirement of (d, k) - anonymity. |
|
回复此楼