scholarly journals A Novel Approach to Outlier Detection using Modified Grey Wolf Optimization and k-Nearest Neighbors Algorithm

2016 ◽  
Vol 9 (44) ◽  
Author(s):  
Reema Aswani ◽  
S. P. Ghrera ◽  
Satish Chandra
Keyword(s):  
Outlier Detection ◽  
Nearest Neighbors ◽  
Grey Wolf ◽  
Grey Wolf Optimization ◽  
K Nearest Neighbors ◽  
Novel Approach

K-NN Based Outlier Detection Technique on Intrusion Dataset

2017 ◽  
Vol 7 (1) ◽  
pp. 58-70 ◽  
Author(s):  
Santosh Kumar Sahu ◽  
Sanjay Kumar Jena ◽  
Manish Verma
Keyword(s):  
Outlier Detection ◽  
Time Complexity ◽  
Nearest Neighbor ◽  
Nearest Neighbors ◽  
The Other ◽  
Detection Technique ◽  
K Nearest Neighbors ◽  
Time Required ◽  
Local Outlier ◽  
Quick Sort

Outliers in the database are the objects that deviate from the rest of the dataset by some measure. The Nearest Neighbor Outlier Factor is considering to measure the degree of outlier-ness of the object in the dataset. Unlike the other methods like Local Outlier Factor, this approach shows the interest of a point from both neighbors and reverse neighbors, and after that, an object comes into consideration. We have observed that in GBBK algorithm that based on K-NN, used quick sort to find k nearest neighbors that take O (N log N) time. However, in proposed method, the time required for searching on K times which complete in O (KN) time to find k nearest neighbors (k < < log N). As a result, the proposed method improves the time complexity. The NSL-KDD and Fisher iris dataset is used, and experimental results compared with the GBBK method. The result is same in both the methods, but the proposed method takes less time for computation.

A Data Stream Outlier Detection Algorithm Based on Reverse K Nearest Neighbors

2011 ◽  
Vol 225-226 ◽  
pp. 1032-1035 ◽  
Author(s):  
Zhong Ping Zhang ◽  
Yong Xin Liang
Keyword(s):  
Outlier Detection ◽  
Data Stream ◽  
Concept Drift ◽  
Real Data ◽  
Nearest Neighbors ◽  
Detection Algorithm ◽  
Data Sets ◽  
K Nearest Neighbors ◽  
Query Manager ◽  
Current Window

This paper proposes a new data stream outlier detection algorithm SODRNN based on reverse nearest neighbors. We deal with the sliding window model, where outlier queries are performed in order to detect anomalies in the current window. The update of insertion or deletion only needs one scan of the current window, which improves efficiency. The capability of queries at arbitrary time on the whole current window is achieved by Query Manager Procedure, which can capture the phenomenon of concept drift of data stream in time. Results of experiments conducted on both synthetic and real data sets show that SODRNN algorithm is both effective and efficient.

Hybrid Kernel Support Vector Machine Classifier and Grey Wolf Optimization Algorithm Based Intelligent Classification Algorithm for Chronic Kidney Disease

2020 ◽  
Vol 10 (10) ◽  
pp. 2297-2307
Author(s):  
L. Jerlin Rubini ◽  
Eswaran Perumal
Keyword(s):  
Chronic Kidney Disease ◽  
Support Vector Machine ◽  
Kidney Disease ◽  
Classification Model ◽  
Support Vector ◽  
Grey Wolf ◽  
Grey Wolf Optimization ◽  
Novel Approach ◽  
Kernel Support Vector Machine ◽  
Hybrid Kernel

In the present day, distributed algorithms become more popular due to their diversity in several applications. The prediction and reorganization of medical data required more practice and information. We propose a novel approach feature selection based on efficient chronic kidney disease (CKD) prediction and classification. Primarily, the pre-processing pace will be implemented over the input data. Then, the grey wolf optimization (GWO) algorithm gets executed to choose the optimal features from the pre-processed data. Next, the projected technique exploits the Hybrid Kernel Support Vector Machine (HKSVM) as a classification model to identify the presence of CKD or not. The simulation takes place in MATLAB. The validation of the presented model takes place using a benchmark CKD dataset as of machine learning repository such as UCI under the presence of several measures. New outcome specified that the planned categorization arrangement has surpassed by containing enhanced 97.26% accuracy for kidney chronic dataset when contrasted with existing SVM technique only accomplished 94.77% and fuzzy min–max GSO neural network (FMMGNN) classifier accomplished 93.78%.

Evaluation of Grey Wolf Optimization Algorithm on Rigid and Flexible Receptor Docking

2020 ◽  
Author(s):  
Kin Meng Wong ◽  
Shirley Siu
Keyword(s):  
Scoring Function ◽  
Ligand Docking ◽  
Receptor Protein ◽  
Pose Prediction ◽  
Grey Wolf ◽  
Success Rates ◽  
Autodock Vina ◽  
Grey Wolf Optimization ◽  
Structure Based Drug Design ◽  
Docking Program

Protein-ligand docking programs are indispensable tools for predicting the binding pose of a ligand to the receptor protein in current structure-based drug design. In this paper, we evaluate the performance of grey wolf optimization (GWO) in protein-ligand docking. Two versions of the GWO docking program – the original GWO and the modified one with random walk – were implemented based on AutoDock Vina. Our rigid docking experiments show that the GWO programs have enhanced exploration capability leading to significant speedup in the search while maintaining comparable binding pose prediction accuracy to AutoDock Vina. For flexible receptor docking, the GWO methods are competitive in pose ranking but lower in success rates than AutoDockFR. Successful redocking of all the flexible cases to their holo structures reveals that inaccurate scoring function and lack of proper treatment of backbone are the major causes of docking failures.

Sign in / Sign up

Export Citation Format

Share Document