检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机科学与探索》2017年第12期1984-1992,共9页Journal of Frontiers of Computer Science and Technology
基 金:国家自然科学基金No.U1431227;广州市科技计划基金No.201604010037~~
摘 要:为了解决数据库属性异常点检测方法时间复杂度大并且查准率和查全率不高的问题,提出了新的基于人工蜂群优化技术(artificial bee colony,ABC)和O-measure度量(一种评估属性异常点的度量)相结合的属性异常点检测方法,模拟人工蜂群随机搜索较优的食物源能力发现属性异常点。针对群体智能算法检测属性异常点会陷入局部收敛的缺陷,提出使用模拟退火技术让人工蜂群跳出局部最优解而找到全局最优解的算法。该算法通过蜂群在二维数据平面上搜索食物源,计算所经过路径上的数据项O-measure适应度,从中寻找最优解(即属性异常点)。实验结果表明,所提算法较之前的算法耗时短,且提高了检测的准确率和查全率。In order to solve the problems of high time complexity, low accuracy and low recall in detecting anomaly database attributes, this paper proposes a new method based on ABC(artificial bee colony) and the O-measure metric(i.e., a kind of attribute outlier evaluation metric) to find out the attribute outliers, which simulates the bee colony behavior of searching for high quality food sources. In view of the local convergence of swarm intelligence algorithm to detect the attribute outliers, this paper presents the approach of finding the global optimal solution by using the simulated annealing technique, making the bee swarm jump out of the local optimal solution. The proposed algorithm calculates the O-measure of each attribute that the bees have walked, and then from the O-measure value result sets, chooses the best food sources(i.e., the attribute outliers). In comparison with other algorithms, the experimental results show that the proposed algorithm needs less time, and improves the detection precision and recall.
关 键 词:属性异常点 人工蜂群算法 模拟退火 O-measure
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.15.189.95