Credit card fraud detection using anti-k nearest neighbor algorithm
|
 |
|
Post a Comment
|
|
|
|
|
CONTRIBUTORS:
|
|
|
JOURNAL:
|
Unknown Journal,
??(??),
?? - ??.
|
|
|
|
YEAR:
|
2012
|
|
PUB TYPE:
|
Journal Article
|
|
SUBJECT(S):
|
None
|
|
DISCIPLINE:
|
No discipline assigned
|
|
HTTP:
|
|
|
LANGUAGE:
|
None
|
|
PUB ID:
|
103-503-680
(Last edited on
2012/06/21 03:32:44 GMT-6)
|
|
SPONSOR(S):
|
|
|
ABSTRACT:
Banks have used early fraud warning systems for some years. Improved fraud detection thus has become essential to maintain the viability of the payment system. Outlier mining in data mining is an important functionality of the existing algorithms which can be divided into methods based on statistical, distance based methods, density based methods and deviation based methods. In this article I propose the concept of credit card fraud detection by using a data stream outlier detection algorithm which is based on reverse k-nearest neighbors (SODRNN). The distinct quality of SODRNN algorithm is it needs only one pass of scan. Whereas traditional methods need to scan the database many times, it is not suitable for data stream environment.
|
|
|
|
STATISTICS
|
|
Click on # to view
|
|
Citations
|
|
0
|
|
References
|
|
0
|
|
Comments
|
|
0
|
|
Quality
|
|
1/6.00
|
|
Interest
|
|
1/6.00
|
|
View(er)s
|
|
2/62
|
|
|
|
|
|
|
| Prev |
Next |
|