Research on Second Distribution of Real Value Detectors Based on Heuristic Movement

2014 ◽  
Vol 1049-1050 ◽  
pp. 1506-1513
Author(s):  
Tian Bo Wang ◽  
Feng Bin Zhang ◽  
Chun He Xia
Keyword(s):  
Theoretical Analysis ◽  
Anomaly Detection ◽  
Heuristic Algorithm ◽  
Negative Selection ◽  
Optimal Solution ◽  
Detection Algorithm ◽  
Experimental Results ◽  
Generalization Ability ◽  
Real Value ◽  
Omission Rate

Traditional anomaly detection algorithm has improved to some degree the mechanism of negative selection. However, there still remain many problems such as the randomness of detector generation, incompleteness of self-set and the generalization ability of detectors, which would cause a lot of loopholes in non-self-space. This paper proposes a heuristic algorithm based on the second distribution of real value detectors for the remains of loopholes of the non-self-space in the first distribution. The algorithm proposed can distribute real value detectors through omission data based on the methods of partition and movement. A method is then proposed to solve the problem on how to get the optimal solution to the parameters related in the algorithm. Theoretical analysis and experimental results prove the universality and effectiveness of the method. It is found that the algorithm can effectively avoid the generation of loopholes and thus reduce the omission rate of detector sets.

Dynamically Real-time Anomaly Detection Algorithm with Immune Negative Selection

2013 ◽  
Vol 7 (3) ◽  
pp. 1157-1163 ◽  
Author(s):  
Lingxi Peng ◽  
Wenbin Chen ◽  
Dongqing Xie ◽  
Ying Gao ◽  
Chunlin Liang
Keyword(s):  
Anomaly Detection ◽  
Real Time ◽  
Negative Selection ◽  
Detection Algorithm

Anomaly Detection Algorithm Based on Subspace Local Density Estimation

2019 ◽  
Vol 16 (3) ◽  
pp. 44-58 ◽  
Author(s):  
Chunkai Zhang ◽  
Ao Yin
Keyword(s):  
Theoretical Analysis ◽  
Anomaly Detection ◽  
Density Estimation ◽  
Local Density ◽  
Tree Height ◽  
Detection Algorithm ◽  
Density Estimator ◽  
Large Tree ◽  
Anomaly Score ◽  
Tree Evaluation

In this article, the authors propose a novel anomaly detection algorithm based on subspace local density estimation. The key insight of the proposed algorithm is to build multiple trident trees, which can implement the process of building subspace and local density estimation. Each trident tree (T-tree) is constructed recursively by splitting the data outside of 3 sigma into the left or right subtree and splitting the remaining data into the middle subtree. Each node in trident tree records the number of instances that falls on this node, so each trident tree can be used as a local density estimator. The density of each instance is the average of all trident tree evaluation instance densities, and it can be used as the anomaly score of instances. Since each trident tree is constructed according to 3 sigma principle, it can obtain good anomaly detection results without a large tree height. Theoretical analysis and experimental results show that the proposed algorithm is effective and efficient.

Anomaly Detection in Hyperspectral Imagery Based on Spectral Gradient and LLE

2011 ◽  
Vol 121-126 ◽  
pp. 720-724
Author(s):  
Liang Liang Wang ◽  
Zhi Yong Li ◽  
Ji Xiang Sun
Keyword(s):  
Anomaly Detection ◽  
Euclidean Distance ◽  
Hyperspectral Imagery ◽  
Detection Algorithm ◽  
Hyperspectral Data ◽  
Experimental Results ◽  
Feature Analysis ◽  
Detection Problem ◽  
Local Linear Embedding ◽  
Linear Embedding

The local linear embedding algorithm(LLE) is applied into the anomaly detection algorithm on the basis of the feature analysis of the hyperspectral data. Then, to deal with the problem of declining capacity of identifying the neighborhood caused by the Euclidean distance, an improved LLE algorithm is developed. The improved LLE algorithm selects neighborhood pixels according to the spectral gradient, thus making the anomaly detection more robust to the changes of light and terrain. Experimental results prove the feasibility of using LLE algorithm to solve the anomaly detection problem, and the effectiveness of the algorithm in improving the detection performance.

scholarly journals An Efficient Algorithm for the Split K-Layer Circular Topological Via Minimization Problem

VLSI Design ◽  
1996 ◽  
Vol 4 (1) ◽  
pp. 41-51
Author(s):  
J. S. Huang ◽  
Y. H. Chin
Keyword(s):  
Heuristic Algorithm ◽  
Minimization Problem ◽  
Efficient Algorithm ◽  
Optimal Solution ◽  
Experimental Results ◽  
Optimal Solutions ◽  
General Will

The split k-layer (k ≥ 2) circular topological via minimization (k-CTVM) problem is reconsidered here. The problem is finding a topological routing of the n nets, using k available layers, such that the total number of vias is minimized. The optimal solution of this problem is solved in O(n2k+1) time. However, such an algorithm is inefficient even for n ≥ 8 and k ≥ 2. A heuristic algorithm with complexity of O(k n4) is presented. When the experimental results of this algorithm and that of an exhaustive algorithm are compared, the same number of optimal solutions is obtained from this heuristic algorithm for all permutations of 1) n = 8 with k = 2 or 3, and 2) n = 10 with k = 3. For other cases, the number of optimal solutions from this algorithm depends on the permutations been selected; and this number, in general, will increase as k increases.

PHOTOINDUCED NONLINEAR OCTUPOLAR POLARIZATION: TRANSIENT AND PERMANENT REGIMES

1996 ◽  
Vol 05 (04) ◽  
pp. 653-670 ◽  
Author(s):  
CÉLINE FIORINI ◽  
JEAN-MICHEL NUNZI ◽  
FABRICE CHARRA ◽  
IFOR D.W. SAMUEL ◽  
JOSEPH ZYSS
Keyword(s):  
Theoretical Analysis ◽  
Second Harmonic ◽  
Experimental Results ◽  
Polar Field ◽  
Rotational Spectrum ◽  
Dual Frequency ◽  
One Dimensional ◽  
Ethyl Violet ◽  
Disperse Red 1 ◽  
Good Agreement

An original poling method using purely optical means and based on a dual-frequency interference process is presented. We show that the coherent superposition of two beams at fundamental and second-harmonic frequencies results in a polar field with an irreducible rotational spectrum containing both a vector and an octupolar component. This enables the method to be applied even to molecules without a permanent dipole such as octupolar molecules. After a theoretical analysis of the process, we describe different experiments aiming at light-induced noncentrosymmetry performed respectively on one-dimensional Disperse Red 1 and octupolar Ethyl Violet molecules. Macroscopic octupolar patterning of the induced order is demonstrated in both transient and permanent regimes. Experimental results show good agreement with theory.

Sign in / Sign up

Export Citation Format

Share Document