Non-Adaptive Sequential Detection of Active Edge-Wise Disjoint Subgraphs Under Privacy Constraints
Non-Adaptive Sequential Detection of Active Edge-Wise Disjoint Subgraphs Under Privacy Constraints
复制标题
隐私约束下主动沿边不相交子图的非自适应顺序检测
DOI：
10.1109/tifs.2018.2790937
复制
发表时间：
2018
影响因子：
6.8
通讯作者：
Shuangqing Wei
中科院分区：
文献类型：
--
作者：
Farhang Bayat;Shuangqing Wei
在本文中，我们提出了一种新颖的框架来研究在边缘活动模式保护的约束下活动子结构的顺序检测问题。我们首先在这个框架内提供隐私的定义，作为更好地解释与我们的论文有关的限制的一种手段。然后，我们提出了从给定的一组链接方式不相交子结构中检测活动子图的新问题。我们展示了如何通过一系列可行的二进制查询进行查询来识别此类活动图，这些二进制查询满足在检测期间保护链接状态的约束，这是使用子图的顶点覆盖进一步解释其表示的壮举。此外，我们介绍了部分和完全顶点覆盖之间的关系以及后者在我们的问题中所造成的隐私侵犯。提出了一种随机编码方法来建立顺序且非自适应的二分搜索过程，其平均停止时间基于上限和下限进行分析。然后计算该方法的复杂度并证明该方法是有效的。最后，提供仿真结果来证明所提出的边界的效率。
In this paper, we propose a novel framework to study the problem of sequential detection of active substructures under the constraint of protection of edge-wise activity patterns. We begin by offering a definition of privacy within this framework as a means to a better interpretation of the constraints concerning our paper. We then formulate the novel problem of detecting active subgraphs from a given set of link-wise disjoint substructures. We show how such active graphs could be identified by querying with a series of feasible binary queries satisfying the constraint of protecting link-wise states over the detection period, a feat whose representation is further interpreted using vertex covering of subgraphs. Furthermore, we introduce the relationship between partial and complete vertex covering and the resulting breach of privacy imposed by the latter in our problem. A random coding approach is proposed to establish a sequential and non-adaptive binary search process whose average stopping time is analyzed based on both upper and lower bounds. Then the complexity of the method is calculated and shown to be efficient. Finally, the simulation results are provided to demonstrate the efficiency of proposed bounds.
影响因子：
2.4
作者：
Evans, T. S.;Lambiotte, R.
通讯作者：
Lambiotte, R.