• Corpus ID: 15596676


  author={N. Philip},
NIMISHA PHILIP, SHERLY K.K Department of Computer Science & Engineering, Toc H Institute of Science & Technology email:nimishavellapally@gmail.com Department of Information Technology, Toc H Institute of Science & Technology, Ernakulam, Kerala, India shrly_shilu@yahoo.com Abstract — Globalization and increased use of the Internet for online shopping has resulted in a considerable proliferation of credit card transactions throughout the world.Higher acceptability and convenience of credit cards… 

Figures and Tables from this paper


The proposed method builds personalize and aggregate model to predict deceitful transactions by implementing the Classifiers Naive Bayesian and Random Forest to predict the legitimate and fraudulent patterns.

Hybrid approaches for detecting credit card fraud

This paper proposed the use of six known models, namely, decision tree, random forest, Bayesian network, Naïve Bayes, support vector machine, and K* models to form an ensemble for the detection of credit card fraud and proposed optimistic, pessimistic, and weighted voting strategies.

Fraud detection system: A survey

Parameters of automated fraud detection techniques during online transactions

The purpose of this paper is to provide the clear pathway for researchers to move in the direction of development of automated fraud detection system to prevent the fraud during online transaction.

A novel cardholder behavior model for detecting credit card fraud

  • Yigit KulturM. U. Çaglayan
  • Computer Science
    2015 9th International Conference on Application of Information and Communication Technologies (AICT)
  • 2015
This paper focuses on analyzing the cardholder spending behavior and proposes a novel cardholder behavior model for detecting credit card fraud, named Cardholder Behavior Model (CBM).

Understanding payment card fraud through knowledge extraction from neural networks using large-scale datasets

The Sparse Oracle-based Adaptive Rule (SOAR) pedagogical extraction algorithm is proposed to extract generalising rules that explain patterns of fraud and results show that SOAR extracts comprehensible rules that are sound from a deep learning neural network.

ATM Fraud Detection using Behavior Model

This research study relationships between fraud and non-fraud transactions of the ATM in Thailand to compare the accuracy between different aggregation time windows and boundaries with different spreading factors.

An intelligent credit card fraud detection approach based on semantic fusion of two classifiers

Experimental results indicate that the proposed model can enhance the classification accuracy against the risk coming from suspicious transactions, and gives higher accuracy compared to traditional methods.



Toward Scalable Learning with Non-Uniform Class and Cost Distributions: A Case Study in Credit Card Fraud Detection

A multi-classifier meta-learning approach to address very large databases with skewed class distributions and non-uniform cost per error and empirical results indicate that the approach can significantly reduce loss due to illegitimate transactions.

Beyond market baskets: generalizing association rules to correlations

This work develops the notion of mining rules that identify correlations (generalizing associations), and proposes measuring significance of associations via the chi-squared test for correlation from classical statistics, enabling the mining problem to reduce to the search for a border between correlated and uncorrelated itemsets in the lattice.

Mining frequent patterns without candidate generation

This study proposes a novel frequent pattern tree (FP-tree) structure, which is an extended prefix-tree structure for storing compressed, crucial information about frequent patterns, and develops an efficient FP-tree-based mining method, FP-growth, for mining the complete set of frequent patterns by pattern fragment growth.

Mining sequential patterns

  • R. AgrawalR. Srikant
  • Computer Science
    Proceedings of the Eleventh International Conference on Data Engineering
  • 1995
Three algorithms are presented to solve the problem of mining sequential patterns over databases of customer transactions, and empirically evaluating their performance using synthetic data shows that two of them have comparable performance.

Cyclic association rules

This work devise a new technique called cycle pruning, which reduces the amount of time needed to find cyclic association rules by studying the interaction between association rules and time, and presents two new algorithms for discovering such rules.

Fast Algorithms for Mining Association Rules

Two new algorithms for solving thii problem that are fundamentally different from the known algorithms are presented and empirical evaluation shows that these algorithms outperform theknown algorithms by factors ranging from three for small problems to more than an order of magnitude for large problems.

Beyond Independence: Conditions for the Optimality of the Simple Bayesian Classifier

It is shown that the simple Bayesian classi er (SBC) does not in fact assume attribute independence, and can be optimal even when this assumption is violated by a wide margin, and the previously-assumed region of optimality is a second-order in nitesimal fraction of the actual one.

Mining association rules between sets of items in large databases

An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.

Maintenance of discovered association rules in large databases: an incremental updating technique

An incremental updating technique is developed for maintenance of the association rules discovered by database mining when new transaction data are added to a transaction database.