The base-rate fallacy and the difficulty of intrusion detection

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> ACM Transactions on Information and System Security (TISSEC)

The base-rate fallacy and the difficulty of intrusion detection

Stefan Axelsson

Journal Title: ACM Transactions on Information and System Security (TISSEC)

Date: 2000

Volume: 3

Issue: 3

p. 186 - 205

We have been looking for this document on the Web. We think we have found the following, freely available version(s) of it:

http://www.cert.org/research/isw/isw2001/papers/Varner-10-09.pdf

http://www.cs.virginia.edu/~jck/publications/security.visualization.isw-2001.pdf

http://www.math.chalmers.se/~sax/pub/difficulty-final.ps

For further information about this item go to:

http://doi.acm.org/10.1145/357830.357849

This data comes from DBLP

This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12