异常检测
稳健性(进化)
聚类分析
系列(地层学)
计算机科学
代表(政治)
异常(物理)
模式识别(心理学)
k-最近邻算法
数据挖掘
时间序列
特征向量
紧凑空间
算法
数学
人工智能
过程(计算)
噪声数据
非线性系统
向量空间
基础(线性代数)
降维
支持向量机
人工神经网络
数据建模
作者
Shen Li-feng,Peng Liang,Liu Rui-wen,Xia, Shuyin,Liu Yi
出处
期刊:Cornell University - arXiv
日期:2025-11-15
标识
DOI:10.48550/arxiv.2511.12147
摘要
Modeling normal behavior in dynamic, nonlinear time series data is challenging for effective anomaly detection. Traditional methods, such as nearest neighbor and clustering approaches, often depend on rigid assumptions, such as a predefined number of reliable neighbors or clusters, which frequently break down in complex temporal scenarios. To address these limitations, we introduce the Granular-ball One-Class Network (GBOC), a novel approach based on a data-adaptive representation called Granular-ball Vector Data Description (GVDD). GVDD partitions the latent space into compact, high-density regions represented by granular-balls, which are generated through a density-guided hierarchical splitting process and refined by removing noisy structures. Each granular-ball serves as a prototype for local normal behavior, naturally positioning itself between individual instances and clusters while preserving the local topological structure of the sample set. During training, GBOC improves the compactness of representations by aligning samples with their nearest granular-ball centers. During inference, anomaly scores are computed based on the distance to the nearest granular-ball. By focusing on dense, high-quality regions and significantly reducing the number of prototypes, GBOC delivers both robustness and efficiency in anomaly detection. Extensive experiments validate the effectiveness and superiority of the proposed method, highlighting its ability to handle the challenges of time series anomaly detection.
科研通智能强力驱动
Strongly Powered by AbleSci AI