共被期刊论文引用了3次
您的检索式：您选中1篇文献正在查看引证文献汇总
|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | 基于FAT-AI测试的实时人脸比对技术分析显示文摘基于FAT-AI细粒度视频分析应用测试中对行业主流企业实时人脸比对系统的测试结果,分析了大规模开放场景、大规模数据条件下,实时人脸比对识别准确率受候选集容量、性别、墨镜、口罩等因素的影响,为公共安全领域疫情防控等应用中实时人脸比对系统的项目规划、产品选型、改造升级及应用效果评价等工作提供参考。 | 赵炫 刘雨田 张旭 刘庆伟 崔涵 | 2021 | 警察技术2021，，6： | 1 |
| 2 | Fast wireless sensor for anomaly detection based on data stream in an edge-computing-enabled smart greenhouse显示文摘Edge-computing-enabled smart greenhouses are a representative application of the Internet of Things(IoT)technology,which can monitor the environmental information in real-time and employ the information to contribute to intelligent decision-making.In the process,anomaly detection for wireless sensor data plays an important role.However,the traditional anomaly detection algorithms originally designed for anomaly detection in static data do not properly consider the inherent characteristics of the data stream produced by wireless sensors such as infiniteness,correlations,and concept drift,which may pose a considerable challenge to anomaly detection based on data stream and lead to low detection accuracy and efficiency.First,the data stream is usually generated quickly,which means that the data stream is infinite and enormous.Hence,any traditional off-line anomaly detection algorithm that attempts to store the whole dataset or to scan the dataset multiple times for anomaly detection will run out of memory space.Second,there exist correlations among different data streams,and traditional algorithms hardly consider these correlations.Third,the underlying data generation process or distribution may change over time.Thus,traditional anomaly detection algorithms with no model update will lose their effects.Considering these issues,a novel method(called DLSHiForest)based on Locality-Sensitive Hashing and the time window technique is proposed to solve these problems while achieving accurate and efficient detection.Comprehensive experiments are executed using a real-world agricultural greenhouse dataset to demonstrate the feasibility of our approach.Experimental results show that our proposal is practical for addressing the challenges of traditional anomaly detection while ensuring accuracy and efficiency. | Yihong Yang Sheng Ding Yuwen Liu Shunmei Meng Xiaoxiao Chi Rui Ma Chao Yan | 2022 | Digital Communications and Networks2022，8，4： | 1 |
| 3 | Approximation Algorithm for the Balanced 2-Correlation Clustering Problem显示文摘The Correlation Clustering Problem(CorCP) is a significant clustering problem based on the similarity of data.It has significant applications in different fields,such as machine learning,biology,and data mining,and many different problems in other areas.In this paper,the Balanced 2-CorCP(B2-CorCP) is introduced and examined,and a new interesting variant of the CorCP is described.The goal of this clustering problem is to partition the vertex set into two clusters with equal size,such that the number of disagreements is minimized.We first present a polynomial time algorithm for the B2-CorCP on M-positive edge dominant graphs(M≥ 3).Then,we provide a series of numerical experiments,and the results show the effectiveness of our algorithm. | Sai Ji Dachuan Xu Donglei Du Ling Gai Zhongrui Zhao | 2022 | Tsinghua Science and Technology2022，27，5： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员