2020
DOI: 10.3390/bdcc4040024
|View full text |Cite
|
Sign up to set email alerts
|

Multi-Level Clustering-Based Outlier’s Detection (MCOD) Using Self-Organizing Maps

Abstract: Outlier detection is critical in many business applications, as it recognizes unusual behaviours to prevent losses and optimize revenue. For example, illegitimate online transactions can be detected based on its pattern with outlier detection. The performance of existing outlier detection methods is limited by the pattern/behaviour of the dataset; these methods may not perform well without prior knowledge of the dataset. This paper proposes a multi-level outlier detection algorithm (MCOD) that uses multi-level… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
2

Relationship

2
7

Authors

Journals

citations
Cited by 17 publications
(4 citation statements)
references
References 23 publications
0
4
0
Order By: Relevance
“…Munoz and Muruzábal used SOMs for outlier detection in distorted characters and in milk container data [8]. Li et al used them for outlier detection in biomedical and credit card applications [9]. Shahreza used a method combining a SOM with particle swarm optimization for anomaly detection applied to forest fire detection [10].…”
Section: Methods a Som Distancementioning
confidence: 99%
“…Munoz and Muruzábal used SOMs for outlier detection in distorted characters and in milk container data [8]. Li et al used them for outlier detection in biomedical and credit card applications [9]. Shahreza used a method combining a SOM with particle swarm optimization for anomaly detection applied to forest fire detection [10].…”
Section: Methods a Som Distancementioning
confidence: 99%
“…Here, t is the iteration number, η(t) is the learning rate at iteration t , and h(c i , t) is the neighbourhood function that determines the influence of the input vector x i on the weight vector w i based on the distance between c i and the winning node, and c i is the index of the winning node in the grid for the input vector x i [ 68 , 69 , 70 ].…”
Section: Clustering Analysismentioning
confidence: 99%
“…Precision, Recall, F1 score, and Accuracy [49][50][51][52][53][54] the well-known evaluation metrics to assess the performance of a classifier. Precision finds pertinent instances among the gathered instances.…”
Section: Evaluation Metricsmentioning
confidence: 99%