2006
DOI: 10.1016/j.patrec.2005.11.007
|View full text |Cite
|
Sign up to set email alerts
|

A clustering-based method for unsupervised intrusion detections

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
43
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 133 publications
(43 citation statements)
references
References 9 publications
0
43
0
Order By: Relevance
“…From a similar perspective, (Qiao et al 2012) proposes a two-stage clustering algorithm to analyze the spatial and temporal relation of the network intrusion behaviors' alert sequence. (Jiang et al 2006) describes a classification of network traces through an improved nearest neighbor method, while (Cui and Ieee 2012) applies data mining algorithms for the same purpose and the results of preformatted data are visually displayed. (Ge and Zhang 2012) discusses on how the clustering algorithm is applied to intrusion detection and analyses intrusion detection algorithm based on clustering problems.…”
Section: Related Previous Workmentioning
confidence: 99%
“…From a similar perspective, (Qiao et al 2012) proposes a two-stage clustering algorithm to analyze the spatial and temporal relation of the network intrusion behaviors' alert sequence. (Jiang et al 2006) describes a classification of network traces through an improved nearest neighbor method, while (Cui and Ieee 2012) applies data mining algorithms for the same purpose and the results of preformatted data are visually displayed. (Ge and Zhang 2012) discusses on how the clustering algorithm is applied to intrusion detection and analyses intrusion detection algorithm based on clustering problems.…”
Section: Related Previous Workmentioning
confidence: 99%
“…Xian et al [9] proposed to unite fuzzy KNN algorithm with clonal selection algorithm to design network intrusion detection. Jiang et al [10] used incremental KNN algorithm to detect intrusions. Authors used outlier factor to calculate the deviation degree of the cluster in this work.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Generally, a learning algorithm of this model generates f (x) by learning from all instances except the test instance, for example from v, w, y, and z represented by learning connections (dash lines). Many algorithms from recent studies learn from an entire data set [12] or require a certain amount of data [13] before detecting an individual or group of test instances are classified under "batch model" as well. However, this model is more suitable for an offline system rather than for a real-time system because in a real-time system we cannot acquire any information from instances that occur after the present instance.…”
Section: Related Work and Our Proposed Modelmentioning
confidence: 99%