Detection of an anomalous cluster in a network
网络异常簇的检测AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：摘要直接以网络节点及异常簇为对象，符合网络方向，但应用场景是传感器监测。
反馈分类问题
正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
网络异常簇的检测
- 研究问题
- 在传感器网络的一次观测或连续监测中，如何发现具有异常正均值的节点簇，并刻画不同簇形状下的检测难度？
- 方法与思路
- 作者设定节点正常与异常分布，考虑一般静态簇和随时间增长的簇，推导极小极大检测下界并分析扫描统计量。
- 材料陈述的贡献
- 摘要称扫描方法可在对数因子范围内达到检测下界，并在异常簇足够大时将结果扩展至单参数指数族分布。
- 阅读关注点
- 应核对网络几何和簇类别、动态增长规则，以及扫描范围、检测率中的对数差距和指数族扩展所需的簇规模。
- 阅读边界
- 仅据版本未注明的索引摘要；摘要未提供具体检测率和计算成本，也未分析节点依赖或经济网络中的因果干扰。
原文摘要
We consider the problem of detecting whether or not, in a given sensor network, there is a cluster of sensors which exhibit an “unusual behavior.” Formally, suppose we are given a set of nodes and attach a random variable to each node. We observe a realization of this process and want to decide between the following two hypotheses: under the null, the variables are i.i.d. standard normal; under the alternative, there is a cluster of variables that are i.i.d. normal with positive mean and unit variance, while the rest are i.i.d. standard normal. We also address surveillance settings where each sensor in the network collects information over time. The resulting model is similar, now with a time series attached to each node. We again observe the process over time and want to decide between the null, where all the variables are i.i.d. standard normal, and the alternative, where there is an emerging cluster of i.i.d. normal variables with positive mean and unit variance. The growth models used to represent the emerging cluster are quite general and, in particular, include cellular automata used in modeling epidemics. In both settings, we consider classes of clusters that are quite general, for which we obtain a lower bound on their respective minimax detection rate and show that some form of scan statistic, by far the most popular method in practice, achieves that same rate to within a logarithmic factor. Our results are not limited to the normal location model, but generalize to any one-parameter exponential family when the anomalous clusters are large enough.