NLOF:一种新的基于密度的局部离群点检测算法

基于密度的局部离群点检测算法(LOF)的时间复杂度较高且不适用于大规模数据集和高维数据集的离群点检测。通过对LOF算法的分析,提出了一种新的局部离群点检测算法NLOF,该算法的主要思想如下:在数据对象邻域查询过程中,尽可能地利用已知信息优化邻近对象的邻域查询操作,有关邻域的计算查找都采用这种思想。首先通过聚类算法DBSCAN对数据集进行预处理,得到初步的异常数据集。然后利用LOF算法中计算局部异常因子的方法计算初步异常数据集中对象的局部异常程度。在计算数据对象的局部异常因子的过程中,引入去一划分信息熵增量,用去一划分信息熵差确定属性的权重,対属性的权值做具体的量化,在计算各对象之间的距离时采用加权距离。 在真实数据集上 对NLOF算法进行了充分的验证。结果显示,该算法能够提高离群点检测的精度,降低时间复杂度,实现有效的局部离群点的检测。     

一种基于邻域系统密度差异度量的离群点检测算法

针对离群点检测算法LOF在高维离散分布数据集中检测精度较低及参数敏感性较高的问题,提出了基于邻域系统密度差异度量的离群点检测NSD（neighborhood system density difference）算法。相较于传统基于密度的离群点检测方法,NSD算法引入了截取距离的概念。首先计算数据集中对象在截取距离内的邻居点个数;其次计算对象的邻域系统密度;然后将对象的密度与它邻居的密度进行比较,判定目标对象与其邻居趋向于同一簇的程度;最后输出最可能是离群点的对象。将NSD算法与LOF、LDOF、CBOF算法在真实数据集与合成数据集中对比实验发现,NSD算法具有较高的检测准确率和执行效率以及较低的参数敏感性,证明了NSD算法是有效可行的。     

基于引力的孤立点检测算法

提出一种基于引力的孤立点检测算法.通过综合考虑数据对象周围的密度及数据对象之间的距离等因素对孤立点定义的影响来挖掘出数据集中隐含的孤立点.给出了与该算法相关的概念与技术,详细介绍了该算法,并用实际数据进行了实验.实验表明:该算法对数据集的维度具有很好的扩展性,能有效地识别孤立点,同时能反映出数据对象在数据集中的孤立程度.     

基于图上随机游走的离群点检测算法

离群点检测算法在网络入侵检测、医疗辅助诊断等领域具有十分广泛的应用。针对LDOF、CBOF及LOF算法在大规模数据集和高维数据集的检测过程中存在的执行时间长及检测率较低的问题,提出了基于图上随机游走(BGRW)的离群点检测算法。首先初始化迭代次数、阻尼因子以及数据集中每个对象的离群值;其次根据对象之间的欧氏距离推导出漫步者在各对象之间的转移概率;然后通过迭代计算得到数据集中每个对象的离群值;最后将数据集中离群值最高的对象判定为离群点并输出。在UCI真实数据集与复杂分布的合成数据集上进行实验,将BGRW算法与LDOF、CBOF和LOF算法在执行时间、检测率和误报率指标上进行对比。实验结果表明,BGRW算法能够有效降低执行时间并在检测率及误报率指标上优于对比算法。     

基于局部估计密度的局部离群点检测算法

局部离群点检测是近年来数据挖掘领域的热点问题之一.针对交通数据去噪问题,提出一种基于局部估计密度的局部离群点检测算法,算法使用核密度估计方法计算每个数据对象的密度估计值,来表示该数据对象的局部估计密度,并在核函数的带宽函数计算中引入数据对象的k-邻域平均距离作为其邻域信息,然后利用求出的局部估计密度计算数据对象的局部离群因子,依据局部离群因子的大小来判断数据对象是否为离群点.实验表明,该算法在UCI标准数据集与模拟数据集上都可以取得较好的表现.     

基于密度的离群点挖掘在入侵检测中的应用

给出一种基于密度的局部离群点挖掘方法。采用KDD99数据集进行实验,对数据集中的41个属性提取特征,利用基于密度的聚类对统计处理过的数据集实行剪枝操作,剪除数据集中大部分密集的数据对象,保留未被剪除的候选离群对象集。采用局部离群挖掘方法计算离群候选对象的离群因子,检测出异常攻击。实验结果表明,该方法能保证较高的检测率和较低的误报率。     

GridOF:面向大规模数据集的高效离群点检测算法

作为数据库知识发现研究的重要技术手段，现有离群点检测算法在运用于大型数据集时其时间与空间效率均无法令人满意．通过对数据集中离群点分布特征的分析，在数据空间网格划分的基础上，研究数据超方格层次上的密度近似计算与稠密数据主体滤除策略．给出通过简单的修正近似计算取代繁复的点对点密度函数值计算的方法．基于上述思想构造的离群点检测算法GlidOF在保持足够检测精度的同时显著降低了时空复杂度，运用于大规模数据集离群点检测具有良好的适用性和有效性．     

基于密度的局部离群点检测算法

基于统计学和基于距离的离群点检测都依赖与给定数据点集的全局分布,然而数据通常并非都是均匀分布的。当分析分布密度相差很大的数据时,基于密度的局部离群点检测方法有着很好的识别局部离群点的能力。但存在时间复杂度较大,文章提出了一种改进的算法,能降低时间复杂度,实现有效的局部离群点的检测。     

基于近邻传播的离群点检测算法

离群点是与其他正常点属性不同的一类对象,其检测技术在各行业上均有维护数据纯度、保障业内安全等重要应用,现有算法大多是基于距离、密度等传统方法判断检测离群点.本算法给每个对象分配一个"孤立度",即该点相对其邻点的孤立程度,通过排序进行判定,比传统算法效率更高.在AP(affinity propagation)聚类算法的基础上进行改进与优化,提出能检测异常数据点的算法APO(outlier detection algorithm based on affinity propagation).通过加入孤立度模块并计算处理样本点的孤立信息,并引入放大因子,使其与正常点之间的差异更明显,通过增大算法对离群点的敏感性,提高算法的准确性.分别在模拟数据集和真实数据集上进行对比实验,结果表明:该算法与AP算法相比,对离群点的敏感性更加强烈,且本算法检测离群点的同时也能聚类,是其他检测算法所不具备的.     

基于信息熵加权的局部离群点检测算法

离群点检测是数据挖掘领域的重要研究方向之一,可以从大量数据中发现少量与多数数据有明显区别的数据对象。在诸如网络入侵、无线传感器网络异常事件等检测应用中,离群点检测是一项具有很高应用价值的技术。为了提高离群点检测准确度,文中在局部离群测度（SLOM）算法的基础上,作了一些改进,提出了一种基于密度的局部离群点检测算法ESLOM。引入信息熵确定数据对象的离群属性,并对对象距离采用加权距离,以提高离群点检测准确度。理论分析和实验表明该算法是可行有效的。     

Programming language features,usage patterns,and the efficiency of generated adjoint code

The computation of gradients via the reverse mode of algorithmic differentiation is a valuable technique in modelling many science and engineering applications. This technique is particularly efficient when implemented as a source transformation, as it may use static data-flow analysis. However, some features of the major programming languages are detrimental to the efficiency of the transformed source code. This paper provides an overview of the most common problem scenarios and estimates the cost overhead incurred by using the respective language feature or employing certain common patterns. An understanding of these topics is crucial for the efficiency or even feasibility of adjoint computations, particularly for large-scale numerical simulations, for example, in geosciences. While one cannot hope to cover all effects observable with a given programming language in a given run time environment, the paper aims at providing a reasonable guide for the users of C/C++ and Fortran source transformation tools for algorithmic differentiation.     

On the efficient computation of high-order derivatives for implicitly defined functions

Scientific studies often require the precise calculation of derivatives. In many cases an analytical calculation is not feasible and one resorts to evaluating derivatives numerically. These are error-prone, especially for higher-order derivatives. A technique based on algorithmic differentiation is presented which allows for a precise calculation of higher-order derivatives. The method can be widely applied even for the case of only numerically solvable, implicit dependencies which totally hamper a semi-analytical calculation of the derivatives. As a demonstration the method is applied to a quantum field theoretical physical model. The results are compared with standard numerical derivative methods.     

Risk of using pirated software and its impact on software protection strategies

The software protection strategy of software developer and the inherent risk to end user in using pirated software are two major factors that affect a user's decision on whether to purchase or pirate a software product. This paper analyzes the optimal protection strategy for software developer in horizontally and vertically differentiated markets. We find that the implementation cost of software protection constitutes the primary factor for software developers to determine their software protection strategies. However, in a vertically differentiated market, the lower quality product should always adopt a non-protection strategy, regardless of the protection implementation cost. In other cases, protection would only be optimal if the protection implementation cost to the software developer is relatively small. These findings are consistent with anecdotal evidence.     

Target differentiation with simple infrared sensors using statistical pattern recognition techniques

This study compares the performances of various statistical pattern recognition techniques for the differentiation of commonly encountered features in indoor environments, possibly with different surface properties, using simple infrared (IR) sensors. The intensity measurements obtained from such sensors are highly dependent on the location, geometry, and surface properties of the reflecting feature in a way that cannot be represented by a simple analytical relationship, therefore complicating the differentiation process. We construct feature vectors based on the parameters of angular IR intensity scans from different targets to determine their geometry and/or surface type. Mixture of normals classifier with three components correctly differentiates three types of geometries with different surface properties, resulting in the best performance (100%) in geometry differentiation. Parametric differentiation correctly identifies six different surface types of the same planar geometry, resulting in the best surface differentiation rate (100%). However, this rate is not maintained with the inclusion of more surfaces. The results indicate that the geometrical properties of the targets are more distinctive than their surface properties, and surface recognition is the limiting factor in differentiation. The results demonstrate that simple IR sensors, when coupled with appropriate processing and recognition techniques, can be used to extract substantially more information than such devices are commonly employed for.     

On the implementation of automatic differentiation tools

Automatic differentiation is a semantic transformation that applies the rules of differential calculus to source code. It thus transforms a computer program that computes a mathematical function into a program that computes the function and its derivatives. Derivatives play an important role in a wide variety of scientific computing applications, including numerical optimization, solution of nonlinear equations, sensitivity analysis, and nonlinear inverse problems. We describe the forward and reverse modes of automatic differentiation and provide a survey of implementation strategies. We describe some of the challenges in the implementation of automatic differentiation tools, with a focus on tools based on source transformation. We conclude with an overview of current research and future opportunities.     

数字图像的Riemann-Liouville分数阶微分增强方法

针对传统图像增强过程中存在丢失细节且容易出现欠增强或过增强的不足,提出一种基于RiemannLiouville分数阶微分的图像增强方法.该方法利用基本分数阶微积分的形式,根据数字图像的自相关性对RiemannLiouville分数阶微分中常数分数阶微分不为0的情况进行改进;定义了新的微分增强模板系数,构造了8个方向的分数阶微分卷积模板,并将其应用于图像增强.实验结果表明,文中方法在对图像高频信息进行提升的同时能够有效地提升图像的中低频信息,使得图像的纹理细节,特别是边缘信息更加突出,图像的清晰度及信息熵等图像质量指标有明显的提高,增强后图像的视觉效果良好.     

一种丢包率比例区分服务及其实现*

摘要：针对区分服务的定量描述和提供问题,基于比例区分模型提出了一种丢包率比例区分的确保服务,并给出了一种基于丢包率测量和动态调节RED队列最大丢包概率因子的实现机制。作为区分服务模型的一种扩充,丢包率比例区分服务有利于运营商制定细致的价格策略,也便于用户平衡价格和性能因素选择合适的服务。     

基于四元数分数阶方向微分的图像增强

根据已有的四元数和分数阶微分的知识,以及它们在现代信号处理中的应用,推导出一种新知识:四元数分数阶方向微分,并将其应用于图像增强.该方法首先将一幅彩色图像用一个四元数函数表示,给出四元数函数的分数阶方向微分的定义和计算方法,继而推导出沿八个方向的四元数分数阶方向导数的数值计算模板,并根据八个方向的分数阶导数求出图像平面...     

On the use of second-order derivatives and metamodel-based Monte-Carlo for uncertainty estimation in aerodynamics

This article addresses the delicate issue of estimating physical uncertainties in aerodynamics. Usually, flow simulations are performed in a fully deterministic approach, although in real life operational uncertainty arises due to unpredictable factors that alter the flow conditions. In this article, we present and compare two methods to account for uncertainty in aerodynamic simulation. Firstly, automatic differentiation tools are used to estimate first- and second-order derivatives of aerodynamic coefficients with respect to uncertain variables, yielding an estimate of expectation and variance values (Method of Moments). Secondly, metamodelling techniques (radial basis functions, kriging) are employed in conjunction with Monte-Carlo simulations to derive statistical information. These methods are demonstrated for 3D Eulerian flows around the wing of a business aircraft at different regimes subject to uncertain Mach number and angle of attack.     

一种结合业务区分的S-MAC协议

针对无线传感器网络中S-MAC协议没有考虑网络的QoS性能问题,本文提出了一种结合业务区分的S-MAC协议,令优先级不同的节点获得不同的接入信道概率,提高了传感器网络的QoS性能。仿真结果显示,改进后的S-MAC协议确实提高了网络的QoS性能。