CN106022134A - Method for setting weight of intrusion detection DCA - Google Patents
Method for setting weight of intrusion detection DCA Download PDFInfo
- Publication number
- CN106022134A CN106022134A CN201610380426.3A CN201610380426A CN106022134A CN 106022134 A CN106022134 A CN 106022134A CN 201610380426 A CN201610380426 A CN 201610380426A CN 106022134 A CN106022134 A CN 106022134A
- Authority
- CN
- China
- Prior art keywords
- signal
- ripe
- weights
- semi
- mat
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/50—Monitoring users, programs or devices to maintain the integrity of platforms, e.g. of processors, firmware or operating systems
- G06F21/55—Detecting local intrusion or implementing counter-measures
- G06F21/56—Computer malware detection or handling, e.g. anti-virus arrangements
- G06F21/562—Static detection
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/004—Artificial life, i.e. computing arrangements simulating life
- G06N3/006—Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/08—Learning methods
- G06N3/086—Learning methods using evolutionary algorithms, e.g. genetic algorithms or genetic programming
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- General Health & Medical Sciences (AREA)
- Life Sciences & Earth Sciences (AREA)
- Computer Security & Cryptography (AREA)
- General Physics & Mathematics (AREA)
- Computing Systems (AREA)
- Artificial Intelligence (AREA)
- Evolutionary Computation (AREA)
- Data Mining & Analysis (AREA)
- Computational Linguistics (AREA)
- Mathematical Physics (AREA)
- Biophysics (AREA)
- Biomedical Technology (AREA)
- Molecular Biology (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Biology (AREA)
- Physiology (AREA)
- Bioinformatics & Computational Biology (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Virology (AREA)
- Investigating Or Analysing Biological Materials (AREA)
- Investigating Or Analysing Materials By Optical Means (AREA)
Abstract
The invention aims at providing a method which can be used for adjusting the weight of a Dendritic Cell Algorithm (DCA) according to an actual network environment so as to solve the problem of low detection precision of the DCA. According to the method, the weight of the DCA in synthesis of half-mature signals and mature signals is optimized and set; an optimization issue related to weight variable changes is constructed, and then the optimal value is obtained with the artificial intelligence algorithm according to known sample information. By means of the method, the weight of the DCA can be set according to the actual network environment, so that the intrusion detection performance of the DCA is improved, the false detection rate and the missed detection rate are reduced.
Description
Technical field
The present invention relates to a kind of method setting intrusion detection DCA algorithm weights.
Background technology
Explanation of nouns:
DCA algorithm: (Dendritic Cell Algorithm), dendritic cell algorithm.
PAMP signal: (pathogen-associated molecular pattern) pathogen associated molecular pattern signal.
MACV:(mature context antigen value) ripe environmental antigens value.
DCA algorithm has 3 kinds of signals, i.e. costimulatory signal, half ripe signal and ripe signal.Every kind of signal all passes through
Safety signal (safe signal), danger signal (danger signal) and the PAMP that the external world is gathered by corresponding one group of weights
Signal carries out being synthesized into.
For each immature DC cell, the safety signal that it is gathered (safe signal), danger signal
(danger signal) and PAMP signal, synthesize corresponding costimulatory signal, half ripe signal and ripe signal.Its synthesis
Formula is as follows:
ocsm=(1+IC) (wP,csm*P+wD,csm*D+wS,csm*S)
osemi=(1+IC) (wP,semi*P+wD,semi*D+wS,semi*S) (1)
omat=(1+IC) (wP,mat*P+wD,mat*D+wS,mat*S)
ocsm、osemi、omatRepresent corresponding costimulatory signal, half ripe signal and ripe signal respectively.wP,csmRepresent synthesis
The weights of PAMP signal during costimulatory signal;wD,csmThe weights of danger signal when representing synthesis costimulatory signal;wS,csmTable
The weights of safety signal when showing synthesis costimulatory signal;wP,semiThe weights of PAMP signal when representing synthesis half ripe signal;
wD,semiThe weights of danger signal when representing synthesis half ripe signal;wS,semiThe power of safety signal when representing synthesis half ripe signal
Value;wP,matThe weights of PAMP signal when representing synthesis ripe signal;wD,matThe power of danger signal when representing synthesis ripe signal
Value;wS,matThe weights of safety signal when representing synthesis ripe signal;P represents PAMP signal;D represents danger signal;S represents safety
Signal;
Each immature DC cell constantly accumulates gathered costimulatory signal, half ripe signal and ripe letter
Number, as follows:
Ccsm(t)=Ccsm(t-1)+Ocsm(t)
Csemi(t)=Csemi(t-1)+Osemi(t) (2)
Cmat(t)=Cmat(t-1)+Omat(t),
Ccsm(t)、Csemi(t)、CmatT () represents the costimulatory signal value of accumulation after current collection signal, half ripe respectively
Signal value and ripe signal value.
If the costimulatory signal value of accumulation is more than or equal to presetting threshold value, then stops gathering signal, and judge
Size between half ripe signal and the ripe signal of accumulation of accumulation, determines whether band DC cell is ripe or half ripe is thin
Born of the same parents.If i.e. Csemi(t)>CmatT (), then this immature DC cell is divided into a semi-matured DC cell, is otherwise divided into
One ripe DC cell.
In DCA algorithm, each DC cell can gather the signal of different type network behavior, and according to corresponding network
Behavior carries out the accumulation of signal.Therefore for every kind of network behavior, it is possible to judge the safety of its behavior according to MACV, MACV's
Computing formula is as follows:
If the value of such network behavior is more than or equal to the threshold value set, then it is assumed that an abnormal network behavior, is just otherwise
Normal network behavior.
At present DCA algorithm is employed successfully in the fields such as intrusion detection, but synthesizes its ripe signal and half ripe signal
Weights are general the most directly uses fixing setting value, it is impossible to transfer to adjust in real time weights according to actual complex network environment, from
And cause accuracy of detection the highest.
Summary of the invention
It is an object of the invention to provide a kind of method, it is possible to adjust synthesis DCA algorithm according to actual network environment
Middle ripe signal and the weights of half ripe signal, thus solve the problem that DCA algorithm accuracy of detection is the highest.
To achieve these goals, the technical solution used in the present invention is as follows:
A kind of method setting intrusion detection DCA algorithm weights, utilizes the network behavior of immature DC cell collection sample, root
Detect network behavior according to the DC cell after differentiation, set synthesis half ripe signal and maturation according to actual optimization of network environment
The PAMP signal of signal, danger signal, the weights of safety signal, improve the accuracy of detection of DCA algorithm.
For each immature DC cell, synthesis costimulatory signal, synthesis half ripe signal and the method for ripe signal
For:
ocsm=(1+IC) (wP,csm*P+wD,csm*D+wS,csm*S)
osemi=(1+IC) (wP,semi*P+wD,semi*D+wS,semi*S) (1)
omat=(1+IC) (wP,mat*P+wD,mat*D+wS,mat*S)
P represents PAMP signal;D represents danger signal;S represents safety signal;ocsmRepresent costimulatory signal, osemiRepresent half
Ripe signal, omatRepresent ripe signal;wP,csmThe weights of PAMP signal when representing synthesis costimulatory signal;wD,csmRepresent and close
The weights of danger signal when becoming costimulatory signal;wS,csmThe weights of safety signal when representing synthesis costimulatory signal;wP,semi
The weights of PAMP signal when representing synthesis half ripe signal;wD,semiThe weights of danger signal when representing synthesis half ripe signal;
wS,semiThe weights of safety signal when representing synthesis half ripe signal;wP,matThe power of PAMP signal during the ripe signal of expression synthesis
Value;wD,matThe weights of danger signal when representing synthesis ripe signal;wS,matThe power of safety signal when representing synthesis ripe signal
Value;IC represents inflammatory signal.
Each immature DC cell constantly accumulates gathered costimulatory signal, half ripe signal and ripe signal
Ccsm(t)=Ccsm(t-1)+Ocsm(t)
Csemi(t)=Csemi(t-1)+Osemi(t) (2)
Cmat(t)=Cmat(t-1)+Omat(t),
Ccsm(t)、Csemi(t)、Cmat(t) represent respectively costimulatory signal value that current period accumulates, half ripe signal value and
Ripe signal value, t represents current period number;If the costimulatory signal value of accumulation is more than or equal to presetting threshold value, then
Stop gathering signal;If Csemi(t) > Cmat(t), then this immature DC cell is divided into a semi-matured DC cell,
Otherwise it is divided into a ripe DC cell, simultaneously this DC cell death;
For each network behavior, calculate its MACV value:
The sample containing n heterogeneous networks behavior is selected to set the PAMP letter of its synthesis half ripe signal and ripe signal respectively
Number, the weights of danger signal, safety signal, set up following optimization problem:
N represents a total of different types of network behavior of n kind in selected sample, and i is the network behavior of the i-th type,
MACViRepresent the MACV value of i-th network behavior,I ∈ 1 ..., n} is the judged result of the network behavior of the i-th type
The most correct evaluation, it is judged that correct then be 1, is otherwise-1;Represent and obtain the correct judgement to n network behavior
Maximum times;Synthesis half ripe signal and the weights of ripe the PAMP signal of signal, danger signal, safety signal each optimum
It is and makesObtain the value during maximum times of the correct judgement of n network behavior.
Further improve, a type of network behavior is only gathered for each immature DC cell, if this DC is thin
Born of the same parents are dead, then generate a new DC cell and gather such network behavior.
Further improve, keep constant for synthesizing the weights of costimulatory signal.
Further improve, use artificial intelligence optimization's algorithm adjust synthesis half ripe signal and the PAMP signal of ripe signal,
Danger signal, the weights of safety signal;Described artificial intelligence optimization's algorithm includes particle swarm optimization algorithm and genetic algorithm
This optimization problem can use the artificial intelligent optimization algorithm such as particle swarm optimization algorithm, genetic algorithm to solve.
Compared with the fixing weights of existing DCA, the method can determine according to actual network environment and is more suitable for reality
The weights of situation, thus improve accuracy of detection.
Accompanying drawing explanation
Fig. 1 is weights defined in the present invention and the graph of a relation between the ripe signal of synthesis and half ripe signal;
Fig. 2 is the optimization process of embodiment 1;
Fig. 3 is the optimization process of embodiment 2.
Detailed description of the invention
The invention will be further described with embodiment below in conjunction with the accompanying drawings, and embodiments of the present invention include but not limited to
The following example.
Embodiment
Keep constant for synthesizing one group of weights of costimulatory signal, construct one with synthesis half ripe signal and synthesis maturation
Two groups of weights of signal are the optimization problem of variable, obtain the weights of optimum.For each immature DC cell, by it
Safety signal (safe signal), danger signal (danger signal) and the PAMP signal gathered, the corresponding association of synthesis
Same stimulus signal, half ripe signal and ripe signal.Definition wP,csm、wD,csm、wS,csmFor one group during synthesis costimulatory signal
Weights, define wP,semi、wD,semi、wS,semiFor one group of weights during synthesis half ripe signal, define wP,mat、wD,mat、wS,matFor
One group of weights during the ripe signal of synthesis, its composite formula is
ocsm=(1+IC) (wP,csm*P+wD,csm*D+wS,csm*S)
osemi=(1+IC) (wP,semi*P+wD,semi*D+wS,semi*S) (4)
omat=(1+IC) (wP,mat*P+wD,mat*D+wS,mat*S)
ocsm、osemi、omatRepresent corresponding costimulatory signal, half ripe signal and ripe signal respectively.wP,csmRepresent synthesis
The weights of PAMP signal during costimulatory signal;wD,csmThe weights of danger signal when representing synthesis costimulatory signal;wS,csmTable
The weights of safety signal when showing synthesis costimulatory signal;wP,semiThe weights of PAMP signal when representing synthesis half ripe signal;
wD,semiThe weights of danger signal when representing synthesis half ripe signal;wS,semiThe power of safety signal when representing synthesis half ripe signal
Value;wP,matThe weights of PAMP signal when representing synthesis ripe signal;wD,matThe power of danger signal when representing synthesis ripe signal
Value;wS,matThe weights of safety signal when representing synthesis ripe signal;P represents PAMP signal;D represents danger signal;S represents safety
Signal;
Each immature DC cell constantly accumulates gathered costimulatory signal, half ripe signal and ripe signal, as
Shown in lower:
Ccsm(t)=Ccsm(t-1)+Ocsm(t)
Csemi(t)=Csemi(t-1)+Osemi(t) (5)
Cmat(t)=Cmat(t-1)+Omat(t),
Ccsm(t)、Csemi(t)、CmatT () represents the costimulatory signal value of accumulation after current collection signal, half ripe respectively
Signal value and ripe signal value.If the costimulatory signal value of accumulation is more than or equal to presetting threshold value, then stop gathering
Signal, and break up.Size between half ripe signal and the ripe signal of accumulation accumulated by judgement, determines this DC cell
It is divided into maturation or is divided into blast.If i.e. Csemi(t) > Cmat(t), the then differentiation of this immature DC cell
It is a semi-matured DC cell, is otherwise a ripe DC cell.This DC cell death simultaneously.In this algorithm, each
DC only gathers a type of network behavior, if after this DC cell death, then can generate a new DC cell and gather this
Class network behavior.
For each network behavior, calculate its MACV value, if greater than or be then judged as Deviant Behavior equal to given threshold value,
Being otherwise proper network behavior, the computing formula of MACV is as follows:
The sample containing n heterogeneous networks behavior is selected to set the ripe signal of synthesis and the weights of half ripe signal, the most permissible
Set up following optimization problem:
In above formula, n represents a total of different types of network behavior of n kind in selected sample, and i is the network of the i-th type
Behavior, MACViRepresent the MACV value of i-th network behavior,I ∈ 1 ..., n} is the judgement of the network behavior of the i-th type
The evaluation that result is the most correct, it is judged that correct then be 1, is otherwise-1.Expression is to obtain n network behavior
The correct maximum times judged.
By optimizing the w of formula (4)P,semi、wD,semi、wS,semi、wP,mat、wD,mat、wS,matValue, it is possible to obtain different
The ripe signal of synthesis and half ripe signal, and then obtain different accumulation maturation signal values and accumulation half ripe signal value, finally
Obtain maximum
As a example by KDD Cup 1999 data set, first pick out 1000 samples from data set, comprise 9 kinds dissimilar
Network behavior.Each sample packages contains 41 attributes and 1 attack type.Attack type as antigen, attribute 25,26,29,
38,40 are used for synthesizing PAMP signal, attribute 23, and 24 are used for synthesizing safe signal, attribute 12,31, and 32 are used for synthesizing danger letter
Number, in this experiment, IC signal is set to 0.Take after the attribute of each sample is normalized to interval [0,100] respectively average for
As PAMP signal, safe signal, danger signal.The threshold value of MACV is set to 0.75, the threshold value of the costimulatory signal of accumulation
It is set to the random number of [100,500].For synthesizing the weights (w of costimulatory signalP,csm,wD,csm,wP,semi) fixing be set to (2,
1,2).Several practical situations according to algorithm of organizing of the initial weight of synthesis half ripe signal and ripe signal determine.Wherein one
Group (wP,semi,wD,semi,wS,semi,wP,mat,wD,mat,wS,mat) initial value be set as (0,0,3,2,1 ,-3), and other group
Initial weight is then by randomly generating.
Embodiment 1
Utilize particle cluster algorithm to optimize weights.The vector structure of each particle is (wP,semi,wD,semi,wS,semi,wP,mat,
wD,mat,wS,mat), population quantity is set to 30, and maximum iteration time is 100 times.Particle cluster algorithm parameter c1, c2 are set to 2.
One group of (w in 30 groups of initial weights of populationP,semi,wD,semi,wS,semi,wP,mat,wD,mat,wS,mat) value be set as (0,
0,3,2,1 ,-3), other initial weights of 29 groups are then by randomly generating, and the random number of generation is integer and is positioned at [-3,3] model
In enclosing.The fitness function of particle is the object function of optimization problem, in evolutionary process, the change in displacement scope of particle be [-3,
3], the speed variation of particle is [-1,1].When obtaining maximumEqual to 9, or reach maximum iterations
Time, optimization process terminates.Optimization process is as in figure 2 it is shown, after 13 iteration, it is thus achieved that optimal particle be required power
Value is i.e. (0,0,3,2,1 ,-1).
Embodiment 2
Utilize genetic algorithm to optimize weights.wP,semi、wD,semi、wS,semi、wP,mat、wD,mat、wS,matBase for chromosome
Cause, is transformed into binary form, and the structure of the most each chromosome is (II (wP,semi),II(wD,semi),II(wS,semi),II
(wP,mat),II(wD,mat),II(wS,mat)), II represents the binary form of corresponding weight value, and the gene scope of binary representation is
[-3,3], as 011 represents 3,111 expressions-3.The quantity of chromosome is set to 30, and maximum iteration time is 100 times.Use wheel disc
Gambling selection method obtains selection opertor, and crossover operator is set to 0.1, and mutation operator is set to 0.05.The fitness function of genetic algorithm
For the object function of optimization problem, at the end of optimization process, it is thus achieved that optimum chromosome be required weights.30 groups of dyes
One group of (w in the initial weight of colour solidP,semi,wD,semi,wS,semi,wP,mat,wD,mat,wS,mat) value be set as (0,0,3,2,
1 ,-3), other initial weights of 29 groups are then by randomly generating, in the range of the random number of generation is integer and is positioned at [-3,3].
The fitness function of genetic algorithm is the object function of optimization problem, when obtaining maximumEqual to n, or reach maximum
Iterations time.Fig. 3 is the optimum results figure of genetic algorithm, obtain during the 16th iteration optimum weights (0,0,3,2,
1,-1)。
Claims (5)
1. the method setting intrusion detection DCA algorithm weights, utilizes the network behavior of immature DC cell collection sample,
Network behavior is detected, it is characterised in that set synthesis half according to actual optimization of network environment according to the DC cell after differentiation
Ripe signal and ripe the PAMP signal of signal, danger signal, the weights of safety signal, improve the accuracy of detection of DCA algorithm.
A kind of method setting intrusion detection DCA algorithm weights the most as claimed in claim 1, it is characterised in that for each
Individual immature DC cell, the method for synthesis costimulatory signal, synthesis half ripe signal and ripe signal is:
P represents PAMP signal;D represents danger signal;S represents safety signal;ocsmRepresent costimulatory signal, osemiRepresent that half becomes
Ripe signal, omatRepresent ripe signal;wP,csmThe weights of PAMP signal when representing synthesis costimulatory signal;wD,csmRepresent synthesis
The weights of danger signal during costimulatory signal;wS,csmThe weights of safety signal when representing synthesis costimulatory signal;wP,semiTable
The weights of PAMP signal when showing synthesis half ripe signal;wD,semiThe weights of danger signal when representing synthesis half ripe signal;
wS,semiThe weights of safety signal when representing synthesis half ripe signal;wP,matThe power of PAMP signal during the ripe signal of expression synthesis
Value;wD,matThe weights of danger signal when representing synthesis ripe signal;wS,matThe power of safety signal when representing synthesis ripe signal
Value;IC represents inflammatory signal;
Each immature DC cell constantly accumulates gathered costimulatory signal, half ripe signal and ripe signal
Ccsm(t)、Csemi(t)、CmatT () represents costimulatory signal value that current period accumulates, half ripe signal value respectively and becomes
Ripe signal value, t represents current period number;If the costimulatory signal value of accumulation is more than or equal to presetting threshold value, then stop
Only gather signal;If Csemi(t) > CmatT (), then this immature DC cell is divided into a semi-matured DC cell, no
Then it is divided into a ripe DC cell, simultaneously this DC cell death;
For each network behavior, calculate its MACV value:
The sample containing n heterogeneous networks behavior is selected to set the PAMP letter of its synthesis half ripe signal and ripe signal respectively
Number, the weights of danger signal, safety signal, set up following optimization problem:
N represents a total of different types of network behavior of n kind in selected sample, and i is the network behavior of the i-th type,
MACViRepresent the MACV value of i-th network behavior,I ∈ 1 ..., n} is that the judged result of the network behavior of the i-th type is
No correct evaluation, it is judged that correct then be 1, is otherwise-1;Represent and obtain the correct judgement to n network behavior
Maximum times;The weights of synthesis half ripe signal and ripe the PAMP signal of signal, danger signal, safety signal each optimum are i.e.
For makingObtain the value during maximum times of the correct judgement of n network behavior.
A kind of method setting intrusion detection DCA algorithm weights the most as claimed in claim 1, it is characterised in that for each
Individual immature DC cell only gathers a type of network behavior, if this DC cell death, then generates a new DC thin
Born of the same parents gather such network behavior.
A kind of method setting intrusion detection DCA algorithm weights, it is characterised in that be used for synthesizing
The weights of costimulatory signal keep constant.
A kind of method setting intrusion detection DCA algorithm weights, it is characterised in that use artificial
Intelligent optimization algorithm adjusts synthesis half ripe signal and ripe the PAMP signal of signal, danger signal, the weights of safety signal;Institute
State artificial intelligence optimization's algorithm and include particle swarm optimization algorithm and genetic algorithm.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610380426.3A CN106022134B (en) | 2016-06-01 | 2016-06-01 | A method of setting intrusion detection DCA algorithm weight |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610380426.3A CN106022134B (en) | 2016-06-01 | 2016-06-01 | A method of setting intrusion detection DCA algorithm weight |
Publications (2)
Publication Number | Publication Date |
---|---|
CN106022134A true CN106022134A (en) | 2016-10-12 |
CN106022134B CN106022134B (en) | 2018-12-18 |
Family
ID=57092894
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201610380426.3A Expired - Fee Related CN106022134B (en) | 2016-06-01 | 2016-06-01 | A method of setting intrusion detection DCA algorithm weight |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN106022134B (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108199875A (en) * | 2017-12-29 | 2018-06-22 | 上海上讯信息技术股份有限公司 | A kind of Network Intrusion Detection System and method |
CN110061986A (en) * | 2019-04-19 | 2019-07-26 | 长沙理工大学 | A kind of network intrusions method for detecting abnormality combined based on genetic algorithm and ANFIS |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103679025A (en) * | 2013-11-26 | 2014-03-26 | 南京邮电大学 | Malicious code detection method based on dendritic cell algorithm |
US20160127387A1 (en) * | 2014-11-05 | 2016-05-05 | The Boeing Company | Method for Combining Multiple Signal Values in the Dendritic Cell Algorithm |
-
2016
- 2016-06-01 CN CN201610380426.3A patent/CN106022134B/en not_active Expired - Fee Related
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103679025A (en) * | 2013-11-26 | 2014-03-26 | 南京邮电大学 | Malicious code detection method based on dendritic cell algorithm |
US20160127387A1 (en) * | 2014-11-05 | 2016-05-05 | The Boeing Company | Method for Combining Multiple Signal Values in the Dendritic Cell Algorithm |
Non-Patent Citations (1)
Title |
---|
陈岳兵 等: "树突状细胞算法原理及其应用", 《计算机工程》 * |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108199875A (en) * | 2017-12-29 | 2018-06-22 | 上海上讯信息技术股份有限公司 | A kind of Network Intrusion Detection System and method |
CN110061986A (en) * | 2019-04-19 | 2019-07-26 | 长沙理工大学 | A kind of network intrusions method for detecting abnormality combined based on genetic algorithm and ANFIS |
CN110061986B (en) * | 2019-04-19 | 2021-05-25 | 长沙理工大学 | Network intrusion anomaly detection method based on combination of genetic algorithm and ANFIS |
Also Published As
Publication number | Publication date |
---|---|
CN106022134B (en) | 2018-12-18 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Otoum et al. | Adaptively supervised and intrusion-aware data aggregation for wireless sensor clusters in critical infrastructures | |
CN107103332B (en) | A kind of Method Using Relevance Vector Machine sorting technique towards large-scale dataset | |
CN109753998A (en) | The fault detection method and system, computer program of network are generated based on confrontation type | |
CN108052968B (en) | QSFLA-SVM perception intrusion detection method | |
CN108040073A (en) | Malicious attack detection method based on deep learning in information physical traffic system | |
CN108462711B (en) | Intrusion detection method of cosine time-varying PSO-SVM | |
CN109670302B (en) | SVM-based classification method for false data injection attacks | |
CN106453392A (en) | Whole-network abnormal flow identification method based on flow characteristic distribution | |
CN102184454A (en) | Granulator formula generation method based on neural network system | |
CN108875896A (en) | A kind of disturbance chaos artificial bee colony algorithm certainly of global optimum's guidance | |
CN106960244A (en) | A kind of genetic algorithm and the evolution algorithm of particle cluster algorithm Parallel Fusion | |
CN110362997A (en) | A kind of malice URL oversampler method based on generation confrontation network | |
CN106022134A (en) | Method for setting weight of intrusion detection DCA | |
CN110309887A (en) | Based on the Fuzzy C-Means Clustering method for detecting abnormality for improving flower pollination | |
CN109614967B (en) | License plate detection method based on negative sample data value resampling | |
CN105262715A (en) | Abnormal user detection method based on fuzzy sequential association pattern | |
CN114696466A (en) | State monitoring system and method suitable for low-voltage transformer area power distribution | |
Xie et al. | An anomaly detection method based on fuzzy c-means clustering algorithm | |
Das et al. | A cooperative spectrum sensing scheme using multiobjective hybrid IWO/PSO algorithm in cognitive radio networks | |
Guo et al. | A novel cluster-head selection algorithm based on hybrid genetic optimization for wireless sensor networks | |
Wei et al. | A generic neural network approach for filling missing data in data mining | |
Li et al. | Application of velocity adaptive shuffled frog leaping bat algorithm in ICS intrusion detection | |
Podgorelec et al. | Evolving balanced decision trees with a multi-population genetic algorithm | |
CN115270983A (en) | Switch cabinet fault prediction method based on AdaBoost-RBF algorithm | |
CN109636057A (en) | Based on the link prediction technique and storage medium for improving artificial immune system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant | ||
TR01 | Transfer of patent right | ||
TR01 | Transfer of patent right |
Effective date of registration: 20210604 Address after: 233000 south head workshop, No.11, building 2, liukmhuayuan, Changqing Township, Yuhui District, Bengbu City, Anhui Province Patentee after: Anhui Xuanwei Technology Co.,Ltd. Address before: 416000 No. 120 Renmin South Road, Jishou City, Xiangxi Tujia and Miao Autonomous Prefecture, Hunan Patentee before: JISHOU University |
|
CF01 | Termination of patent right due to non-payment of annual fee | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20181218 |