.png){kind=icon}
返回
RODA: A Fast Outlier Detection Algorithm Supporting Multi-Queries
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2021.3058660.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Outlier detection is an important task in the field of big data analysis. The technology has been extensively used in network security, sensor data analysis, public health and so on. In an outlier detection system, with the continuous expansion of upper-layer applications, a system needs to process a large number of query requests in a very short time, which places high requirements on the timeliness of outlier detection algorithms. To solve this problem, in this paper, an efficient algorithm, R-tree based Outlier Detection Algorithm (RODA), is proposed, which can effectively support single query and multiple query processing. For single query processing, we first extended the R-tree index and proposed a new outlier estimation method. Using the techniques above, the algorithm greatly reduces the retrieval space by preferentially scanning data points with high outlier-degrees. For multiple query processing, the algorithm deeply analyzes the sharing mechanism between multiple queries in order to handle multiple detection tasks within one processing. Finally, experiment results show that the RODA proposed in this paper has improved operating efficiency, and has good applicability and practical significance.
Keyword:
Anomaly detection
Task analysis
Query processing
Filtering
Memory management
Big Data
Security
Outlier detection
multiple query
big data
R-tree
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
Sonic Hedgehog, VACTERL, and Fanconi anemia: Pathogenetic connections and therapeutic implications
PREAI
分享收藏
查看更多内容