Abstract
Finding telecommunications fraud in masses of call records is more difficult than finding a needle in a haystack. In the haystack problem, there is only one needle that does not look like hay, the pieces of hay all look similar, and neither the needle nor the hay changes much over time. Fraudulent calls may be rare like needles in haystacks, but they are much more challenging to find. Callers are dissimilar, so calls that look like fraud for one account look like expected behavior for another, while all needles look the same. Moreover, fraud has to be found repeatedly, as fast as fraud calls are placed, the nature of fraud changes over time, the extent of fraud is unknown in advance, and fraud may be spread over more than one type of service. For example, calls placed on a stolen wireless telephone may be charged to a stolen credit card. Finding fraud is like finding a needle in a haystack only in the sense of sifting through masses of data to find something rare. This chapter describes some issues involved in creating tools for building fraud systems that are accurate, able to adapt to changing legitimate and fraudulent behavior, and easy to use.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Bibliography
P. J. Bickel and K. A. Doksum. Mathematical statistics. Holden-Day, San Francisco, CA, 1976.
Fei Chen, Diane Lambert, and José C. Pinheiro. Sequential percentile estimation. Technical memorandum, Bell Labs, Lucent Technologies, 2000a.
Fei Chen, Diane Lambert, José C. Pinheiro, and Don X. Sun. Reducing transaction databases, without lagging behind the data or losing information. Technical memorandum, Bell Labs, Lucent Technologies, 2000b.
Jay L. Devore. Probability and Statistics for Engineering and the Sciences. Wadsworth, Belmont, CA, 5th edition, 2000.
Tom Fawcett and Foster Provost. Adaptive fraud detection. Data Mining and Knowledge Discovery, 1: 291–316, 1997.
Philip B. Gibbons, Yannis E. Ioannidis, and Viswanath Poosala. Fast incremental maintenance of approximate histograms. In Proceedings of the 23rd VLDB Conference, pages 466–475, 1997.
Yannis E. Ioannidis and Viswanath Poosala. Histogram-based approximations to set-valued query answers. In Proceedings of the 25th VLDB Conference, pages 174–185, 1999.
Diane Lambert, José C. Pinheiro, and Don X. Sun. Updating timing profiles for millions of customers in real-time. Technical memorandum, Bell Labs, Lucent Technologies, 1999.
Yan Yu and Diane Lambert. Fitting trees to functional data, with an application to time-ofday patterns. Journal of Computational and Graphical Statistics, 8 (4): 749–762, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Cahill, M.H., Lambert, D., Pinheiro, J.C., Sun, D.X. (2002). Detecting Fraud in the Real World. In: Abello, J., Pardalos, P.M., Resende, M.G.C. (eds) Handbook of Massive Data Sets. Massive Computing, vol 4. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0005-6_26
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0005-6_26
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4882-5
Online ISBN: 978-1-4615-0005-6
eBook Packages: Springer Book Archive