scholarly journals Financial Fraud Detection in Plastic Payment Cards using Isolation Forest Algorithm

2021 ◽  
Vol 10 (8) ◽  
pp. 132-136
Author(s):  
Ankaj Kumar ◽  
Gouri Sankar Mishra ◽  
Parma Nand ◽  
Madhav Singh Chahar ◽  
Sonu Kumar Mahto
Keyword(s):  
Detection Algorithm ◽  
Financial Fraud ◽  
Data Set ◽  
Standard Data ◽  
Detection Algorithms ◽  
Payment Cards ◽  
Financial Transactions ◽  
Day By Day ◽  
Local Outlier ◽  
Isolation Forest

The need for technology has always found space in Financial Transaction as the number of fraud in financial transactions increases day by day. In this research we have proposed a new methodology by using the isolation forest algorithm and local outlier detection algorithm to detect the financial fraud. A standard data set is used in experimentation to classify a transaction occurred is a fraudulent or not. We have used neural networks and machine learning for classification. We have focused on the deployment of anomaly detection algorithms that is Local Outlier Factor and Isolation Forest algorithm (IFA) on financial fraud transactions data.

Local Outlier Detection Algorithm Based on Coefficient of Variation

2014 ◽  
Vol 635-637 ◽  
pp. 1723-1728
Author(s):  
Shi Bo Zhou ◽  
Wei Xiang Xu
Keyword(s):  
Data Mining ◽  
Outlier Detection ◽  
Coefficient Of Variation ◽  
Detection Algorithm ◽  
Experimental Results ◽  
Data Set ◽  
Outliers Detection ◽  
Deviation Factor ◽  
Local Deviation ◽  
Local Outlier

Local outliers detection is an important issue in data mining. By analyzing the limitations of the existing outlier detection algorthms, a local outlier detection algorthm based on coefficient of variation is introduced. This algorthms applies K-means which is strong in outliers searching, divides data set into sections, puts outliers and their nearing clusters into a local neighbourhood, then figures out the local deviation factor of each local neighbourhood by coefficient of variation, as a result, local outliers can more likely be found.The heoretic analysis and experimental results indicate that the method is ef fective and efficient.

scholarly journals Model-free detection of unique events in time series

2022 ◽  
Vol 12 (1) ◽  
Author(s):  
Zsigmond Benkő ◽  
Tamás Bábel ◽  
Zoltán Somogyvári
Keyword(s):  
Simulated Data ◽  
Normal Activity ◽  
Detection Algorithm ◽  
Superior Performance ◽  
Data Series ◽  
Data Sets ◽  
Data Set ◽  
Detection Algorithms ◽  
Model Free ◽  
Unique Event

AbstractRecognition of anomalous events is a challenging but critical task in many scientific and industrial fields, especially when the properties of anomalies are unknown. In this paper, we introduce a new anomaly concept called “unicorn” or unique event and present a new, model-free, unsupervised detection algorithm to detect unicorns. The key component of the new algorithm is the Temporal Outlier Factor (TOF) to measure the uniqueness of events in continuous data sets from dynamic systems. The concept of unique events differs significantly from traditional outliers in many aspects: while repetitive outliers are no longer unique events, a unique event is not necessarily an outlier; it does not necessarily fall out from the distribution of normal activity. The performance of our algorithm was examined in recognizing unique events on different types of simulated data sets with anomalies and it was compared with the Local Outlier Factor (LOF) and discord discovery algorithms. TOF had superior performance compared to LOF and discord detection algorithms even in recognizing traditional outliers and it also detected unique events that those did not. The benefits of the unicorn concept and the new detection method were illustrated by example data sets from very different scientific fields. Our algorithm successfully retrieved unique events in those cases where they were already known such as the gravitational waves of a binary black hole merger on LIGO detector data and the signs of respiratory failure on ECG data series. Furthermore, unique events were found on the LIBOR data set of the last 30 years.

scholarly journals DDoS Attack Detection Algorithms Based on Pattern Classification and Machine Learning

2021 ◽  
Vol 23 (2) ◽  
Author(s):  
Anup Ingle ◽  
◽  
Dr. Avinash Gour ◽  
Dr. Ketki Kshirsagar ◽  
◽  
...  
Keyword(s):  
Machine Learning ◽  
Pattern Classification ◽  
Detection Algorithm ◽  
Attack Detection ◽  
Machine Learning Algorithms ◽  
Memory Space ◽  
Detection Algorithms ◽  
Ddos Attack ◽  
Ddos Attack Detection ◽  
Day By Day

Damage from DDoS attack in increasing day by day and an efficient attack detection algorithm is urgently needed. Many current DDoS algorithms are based on anomaly detections which are ineffective in real environment. Detection DDoS attack can be tackled effectively with pattern classification based on flow of packet and machine learning algorithms. In this paper three such pattern classificationsbased on flow of packet and machine learning based algorithm for detection of DDoS attack are discussed. Implementation of these algorithms gives better accuracy in limited time and memory space; hence it’s one of the highly scalable and effective in detection of DDoS attack.

scholarly journals Credit Card Fraud Detection using Machine Learning and Data Science

2021 ◽  
Vol 9 (VII) ◽  
pp. 3788-3792
Author(s):  
Aman .
Keyword(s):  
Machine Learning ◽  
Credit Card ◽  
Data Science ◽  
Fraud Detection ◽  
Data Sets ◽  
Data Set ◽  
Credit Card Fraud ◽  
Detection Algorithms ◽  
Processing Data ◽  
Isolation Forest

It is important that companies are able to identify fraudulent credit card transactions so that customers are not charged for items that they did not purchase. These problems can be handled with Data Science and its importance, along with Machine Learning. This project aim is to illustrate the modelling of a data set using machine learning with Credit Card. Our objective is to detect 100% of the fraudulent transactions while minimizing the incorrect fraud classifications. Credit Card Fraud Detection is a sample of classification. In this process, we have focused on analysing and pre-processing data sets as well as the deployment of multiple anomaly detection algorithms such as Local Outlier Factor and Isolation Forest algorithm on the PCA transformed Credit Card Transaction data.

A dual U-Net algorithm for automating feature extraction from satellite imagery

2021 ◽  
pp. 154851292098354
Author(s):  
Samuel Humphries ◽  
Trevor Parker ◽  
Bryan Jonas ◽  
Bryan Adams ◽  
Nicholas J Clark
Keyword(s):  
Neural Networks ◽  
Object Detection ◽  
Satellite Images ◽  
Detection Algorithm ◽  
Military Operations ◽  
Detection Algorithms ◽  
Us Military ◽  
Standard Product ◽  
Different Types ◽  
Road Intersections

Quick identification of building and roads is critical for execution of tactical US military operations in an urban environment. To this end, a gridded, referenced, satellite images of an objective, often referred to as a gridded reference graphic or GRG, has become a standard product developed during intelligence preparation of the environment. At present, operational units identify key infrastructure by hand through the work of individual intelligence officers. Recent advances in Convolutional Neural Networks, however, allows for this process to be streamlined through the use of object detection algorithms. In this paper, we describe an object detection algorithm designed to quickly identify and label both buildings and road intersections present in an image. Our work leverages both the U-Net architecture as well the SpaceNet data corpus to produce an algorithm that accurately identifies a large breadth of buildings and different types of roads. In addition to predicting buildings and roads, our model numerically labels each building by means of a contour finding algorithm. Most importantly, the dual U-Net model is capable of predicting buildings and roads on a diverse set of test images and using these predictions to produce clean GRGs.

scholarly journals A novel algorithm to detect non-wear time from raw accelerometer data using deep convolutional neural networks

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Shaheen Syed ◽  
Bente Morseth ◽  
Laila A. Hopstock ◽  
Alexander Horsch
Keyword(s):  
Threshold Value ◽  
Detection Algorithm ◽  
Classification Model ◽  
Type I ◽  
Accelerometer Data ◽  
Deep Convolutional Neural Networks ◽  
Major Drawback ◽  
Wear Time ◽  
Detection Algorithms ◽  
Type Ii Errors

AbstractTo date, non-wear detection algorithms commonly employ a 30, 60, or even 90 mins interval or window in which acceleration values need to be below a threshold value. A major drawback of such intervals is that they need to be long enough to prevent false positives (type I errors), while short enough to prevent false negatives (type II errors), which limits detecting both short and longer episodes of non-wear time. In this paper, we propose a novel non-wear detection algorithm that eliminates the need for an interval. Rather than inspecting acceleration within intervals, we explore acceleration right before and right after an episode of non-wear time. We trained a deep convolutional neural network that was able to infer non-wear time by detecting when the accelerometer was removed and when it was placed back on again. We evaluate our algorithm against several baseline and existing non-wear algorithms, and our algorithm achieves a perfect precision, a recall of 0.9962, and an F1 score of 0.9981, outperforming all evaluated algorithms. Although our algorithm was developed using patterns learned from a hip-worn accelerometer, we propose algorithmic steps that can easily be applied to a wrist-worn accelerometer and a retrained classification model.

scholarly journals The Study of Multiple Classes Boosting Classification Method Based on Local Similarity

Algorithms ◽  
2021 ◽  
Vol 14 (2) ◽  
pp. 37
Author(s):  
Shixun Wang ◽  
Qiang Chen
Keyword(s):  
Image Retrieval ◽  
Loss Function ◽  
Single Mode ◽  
Local Similarity ◽  
Text And Image ◽  
Data Set ◽  
Standard Data ◽  
Weak Learner ◽  
Great Progress ◽  
Data Points

Boosting of the ensemble learning model has made great progress, but most of the methods are Boosting the single mode. For this reason, based on the simple multiclass enhancement framework that uses local similarity as a weak learner, it is extended to multimodal multiclass enhancement Boosting. First, based on the local similarity as a weak learner, the loss function is used to find the basic loss, and the logarithmic data points are binarized. Then, we find the optimal local similarity and find the corresponding loss. Compared with the basic loss, the smaller one is the best so far. Second, the local similarity of the two points is calculated, and then the loss is calculated by the local similarity of the two points. Finally, the text and image are retrieved from each other, and the correct rate of text and image retrieval is obtained, respectively. The experimental results show that the multimodal multi-class enhancement framework with local similarity as the weak learner is evaluated on the standard data set and compared with other most advanced methods, showing the experience proficiency of this method.

scholarly journals Out-of-Distribution Detection for Deep Neural Networks With Isolation Forest and Local Outlier Factor

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 132980-132989
Author(s):  
Siyu Luan ◽  
Zonghua Gu ◽  
Leonid B. Freidovich ◽  
Lili Jiang ◽  
Qingling Zhao
Keyword(s):  
Neural Networks ◽  
Deep Neural Networks ◽  
Local Outlier Factor ◽  
Local Outlier ◽  
Isolation Forest

scholarly journals A Fast and Lightweight Method with Feature Fusion and Multi-Context for Face Detection

2018 ◽  
Vol 10 (8) ◽  
pp. 80
Author(s):  
Lei Zhang ◽  
Xiaoli Zhi
Keyword(s):  
Face Detection ◽  
Graphics Processing Units ◽  
High Performance ◽  
Feature Fusion ◽  
Local Context ◽  
Data Set ◽  
Global Context ◽  
Detection Algorithms ◽  
Multi Scale ◽  
Benchmark Datasets

Convolutional neural networks (CNN for short) have made great progress in face detection. They mostly take computation intensive networks as the backbone in order to obtain high precision, and they cannot get a good detection speed without the support of high-performance GPUs (Graphics Processing Units). This limits CNN-based face detection algorithms in real applications, especially in some speed dependent ones. To alleviate this problem, we propose a lightweight face detector in this paper, which takes a fast residual network as backbone. Our method can run fast even on cheap and ordinary GPUs. To guarantee its detection precision, multi-scale features and multi-context are fully exploited in efficient ways. Specifically, feature fusion is used to obtain semantic strongly multi-scale features firstly. Then multi-context including both local and global context is added to these multi-scale features without extra computational burden. The local context is added through a depthwise separable convolution based approach, and the global context by a simple global average pooling way. Experimental results show that our method can run at about 110 fps on VGA (Video Graphics Array)-resolution images, while still maintaining competitive precision on WIDER FACE and FDDB (Face Detection Data Set and Benchmark) datasets as compared with its state-of-the-art counterparts.

Structural Design of Intrusion Detection System

2014 ◽  
Vol 530-531 ◽  
pp. 705-708
Author(s):  
Yao Meng
Keyword(s):  
Intrusion Detection ◽  
Structural Design ◽  
Intrusion Detection System ◽  
Detection System ◽  
Algorithm Design ◽  
Detection Algorithm ◽  
Attack Detection ◽  
Detection Algorithms ◽  
Defense Systems ◽  
Ddos Attack Detection

This paper first engine starting defense from Intrusion Detection, Intrusion detection engine analyzes the hardware platform, the overall structure of the technology and the design of the overall structure of the plug, which on the whole structure from intrusion defense systems were designed; then described in detail improved DDOS attack detection algorithm design thesis, and the design of anomaly detection algorithms.

Sign in / Sign up

Export Citation Format

Share Document