Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Network Intrusion Detection Using FP Tree Rules (1006.2689v1)

Published 14 Jun 2010 in cs.NI

Abstract: In the faceless world of the Internet,online fraud is one of the greatest reasons of loss for web merchants.Advanced solutions are needed to protect e businesses from the constant problems of fraud.Many popular fraud detection algorithms require supervised training,which needs human intervention to prepare training cases.Since it is quite often for an online transaction database to ha e Terabyte level storage,human investigation to identify fraudulent transactions is very costly.This paper describes the automatic design of user profiling method for the purpose of fraud detection.We use a FP (Frequent Pattern) Tree rule learning algorithm to adaptively profile legitimate customer behavior in a transaction database.Then the incoming transactions are compared against the user profile to uncover the anomalies The anomaly outputs are used as input to an accumulation system for combining evidence to generate high confidence fraud alert value. Favorable experimental results are presented.

Citations (2)

Summary

We haven't generated a summary for this paper yet.