The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Cost-based modeling for fraud and intrusion detection: results from the JAM project
Open accessAbstract
We describe the results achieved using the JAM distributed data mining system for the real world problem of fraud detection in financial information systems. For this domain we provide clear evidence that state-of-the-art commercial fraud detection systems can be substantially improved in stopping losses due to fraud by combining multiple models of fraudulent transaction shared among banks. We demonstrate that the traditional statistical metrics used to train and evaluate the performance of learning systems (ie. statistical accuracy or ROC analysis) are misleading and perhaps inappropriate for this application. Cost-based metrics are more relevant in certain domains, and defining such metrics poses significant and interesting research questions both in evaluating systems and alternative models, and in formalizing the problems to which one may wish to apply data mining technologies. This paper also demonstrates how the techniques developed for fraud detection can be generalized and applied to the important area of intrusion detection in networked information systems. We report the outcome of recent evaluations of our system applied to tcpdump network intrusion data specifically with respect to statistical accuracy. This work involved building additional components of JAM that we have come to call, MADAM ID (Mining Audit Data for Automated Models for Intrusion Detection). However, taking the next step to define cost-based models for intrusion detection poses interesting new research questions. We describe our initial ideas about how to evaluate intrusion detection systems using cost models learned during our work on fraud detection.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907 · cited 1×
“MADAM ID includes variants of the “association rule” [1, 2] and “frequent episodes” [16, 15] algorithms used to define new feature setsthat are extracted from labeled tcpdumpdata in order to define training sets for a machine learning algorithm to compute detectors.”
MethodFast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
Wolpert, D. H. (1992) · Neural Networks · doi:10.1016/s0893-6080(05)80023-1 · Cited by 7,951 · cited 1×
“In this work, we do no such segmentation and partitioning, but rather we compute models of " fraudulent transaction " for the entire asset base.”
MethodCohen, W. W. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50023-2 · Cited by 3,787
Improved boosting algorithms using confidence-rated predictions
Schapire, R. E., & Singer, Y. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279960 · Cited by 2,547
Data Mining Approaches for Intrusion Detection
Lee, W., & Stolfo, S. J. (2000) · doi:10.21236/ada401496 · Cited by 1,179
Self-citationA data mining framework for building intrusion detection models
Lee, W., Stolfo, S. J., & Mok, K. W. (2003) · Proceedings of the 1999 IEEE Symposium on Security and Privacy (Cat. No.99CB36344) · doi:10.1109/secpri.1999.766909 · Cited by 1,148
Self-citationDiscovering Frequent Episodes in Sequences.
Mannila, H., Toivonen, H. T. T., & Verkamo, A. I. (1995) · Knowledge Discovery and Data Mining · Cited by 689
AdaCost: Misclassification Cost-Sensitive Boosting
Fan, W., Stolfo, S. J., Zhang, J., & Chan, P. K. (1999) · Cited by 612
Self-citationTurney, P. D. (1995) · Journal of Artificial Intelligence Research · doi:10.1613/jair.120 · Cited by 570
Discovering generalized episodes using minimal occurrences
Mannila, H., & Toivonen, H. T. T. (1996) · Cited by 306
JAM: java agents for meta-learning over distributed databases
Stolfo, S. J., Prodromidis, A. L., Tselepis, S., Lee, W., Fan, D. W., & Chan, P. K. (1997) · Cited by 285
Self-citationLearning Patterns from Unix Process Execution Traces for Intrusion Detection
Lee, W., Stolfo, S. J., & Chan, P. K. (1997) · doi:10.7916/d8b56rf2 · Cited by 268
Self-citationMining in a data-flow environment: experience in network intrusion detection
Lee, W., Stolfo, S. J., & Mok, K. W. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312212 · Cited by 223
Self-citationCredit Card Fraud Detection Using Meta-Learning: Issues and Initial Results 1
Stolfo, S. J., Fan, D. W., Lee, W., Prodromidis, A. L., & Chan, P. K. (1997) · Cited by 192
Self-citationTwo case studies in cost-sensitive concept acquisition
Tan, M., & Schlimmer, J. C. (1990) · National Conference on Artificial Intelligence · Cited by 52
Economic Induction: A Case Study.
Núñez, M. (1988) · Cited by 37
Mining databases with different schemas: integrating incompatible classifers
Prodromidis, A. L., & Stolfo, S. J. (1998) · Knowledge Discovery and Data Mining · Cited by 17
Self-citation
Cited by
A detailed analysis of the KDD CUP 99 data set
Tavallaee, M., Bagheri, E., Lu, W., & Ghorbani, A. A. (2009) · 2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications · doi:10.1109/cisda.2009.5356528 · Cited by 5,396
Anomaly-based network intrusion detection: Techniques, systems and challenges
García-Teodoro, P., Díaz-Verdejo, J., Maciá-Fernández, G., & Vázquez, E. (2009) · Computers & Security · doi:10.1016/j.cose.2008.08.003 · Cited by 2,085
A Deep Learning Approach to Network Intrusion Detection
Shone, N., Ngoc, T. N., Phai, V. D., & Shi, Q. (2018) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2017.2772792 · Cited by 1,819
An overview of anomaly detection techniques: Existing solutions and latest technological trends
Patcha, A., & Park, J.-M. (2007) · Computer Networks · doi:10.1016/j.comnet.2007.02.001 · Cited by 1,561
Statistical Fraud Detection: A Review
Bolton, R. J., & Hand, D. J. (2002) · Statistical Science · doi:10.1214/ss/1042727940 · Cited by 1,450
Metadata
- Authors
- Stolfo, S. J., Fan, W., Lee, W., Prodromidis, A., & Chan, P. K.
- Venue
- Proceedings DARPA Information Survivability Conference and Exposition. DISCEX'00
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-07
- Volume
- 2
- Pages
- 130-144
- OpenAlex
- W2167287136
- Cited by
- 610
- References
- 18
- FWCI
- 11.15
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.