2017 Computing Conference 2017
DOI: 10.1109/sai.2017.8252127
|View full text |Cite
|
Sign up to set email alerts
|

High dimensional nearest neighbor search considering outliers based on fuzzy membership

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 20 publications
0
7
0
Order By: Relevance
“…e method of dimension reduction can eliminate some features and reduce the time complexity, but each feature represents a different outlier value. If the features are selected incorrectly, it will get the wrong outlier value, which will produce an approximate result that is not suitable for future calculation [7]. e complexity, sparsity, and diversity of high-dimensional data restrict the traditional mining algorithm.…”
Section: Literature Surveymentioning
confidence: 99%
See 1 more Smart Citation
“…e method of dimension reduction can eliminate some features and reduce the time complexity, but each feature represents a different outlier value. If the features are selected incorrectly, it will get the wrong outlier value, which will produce an approximate result that is not suitable for future calculation [7]. e complexity, sparsity, and diversity of high-dimensional data restrict the traditional mining algorithm.…”
Section: Literature Surveymentioning
confidence: 99%
“…Prajapati and Bhartiya [10] proposed a nearest neighbour search algorithm based on the advantages of K-mean algorithm and fuzzy C-mean (FCM) algorithm to solve the problem of uneven data and rigid clustering in high-dimensional data, which can realize nearest neighbour search in a shorter time.…”
Section: Literature Surveymentioning
confidence: 99%
“…Where Precision represents the fraction of correctly classified records to that totally classified by IDS as attacks FN) . (12) This metric measures how sensitive is the IDS against attacks traffic over the network system. As FN increases, the Recall of the model decreases .…”
Section: Referring Tomentioning
confidence: 99%
“…A realistic insight into the future of malicious activities we face reveals a notable direction towards intelligent intrusion detections that have the artificial intelligence to detect the novel, unknown attacks. Intelligent intrusion detection systems lie in one of four major categories, ie, (1) Clustering techniques, 3-7 (2) Genetic algorithms, 8-11 (3) Fuzzy logic, 12-16 and (4) Artificial neural networks, ie, supervised 22-26 and unsupervised 22-26 …”
Section: Introductionmentioning
confidence: 99%
“…Many approaches to unsupervised intrusion detection follow k‐means clustering and Euclidean distance for weighting the presence of anomalies ; other approaches are emerging as well, relying on other clustering techniques and density‐based definition of anomalies . Quite a few investigate rule extraction techniques through decision tree (DT) .…”
Section: Introductionmentioning
confidence: 99%