Difference between revisions of "Bibliography:Ascription"

From ForensicsWiki
Jump to: navigation, search
m
Line 12: Line 12:
 
}
 
}
  
 +
</bibtex>
 +
 +
<bibtex>
 +
@inproceedings{170072,
 +
author = {Rakesh Agrawal and Tomasz Imieli\'{n}ski and Arun Swami},
 +
title = {Mining association rules between sets of items in large databases},
 +
booktitle = {SIGMOD '93: Proceedings of the 1993 ACM SIGMOD international conference on Management of data},
 +
year = {1993},
 +
isbn = {0-89791-592-5},
 +
pages = {207--216},
 +
location = {Washington, D.C., United States},
 +
doi = {http://doi.acm.org/10.1145/170035.170072},
 +
publisher = {ACM Press},
 +
address = {New York, NY, USA},
 +
}
 
</bibtex>
 
</bibtex>

Revision as of 11:31, 23 October 2007

Bibliographic references for those working on the carved data ascription problem:

Simson Garfinkel - Carving Contiguous and Fragmented Files with Fast Object Validation
Digital Investigation , August 2007
Bibtex
Author : Simson Garfinkel
Title : Carving Contiguous and Fragmented Files with Fast Object Validation
In : Digital Investigation -
Address :
Date : August 2007

Rakesh Agrawal, Tomasz Imieli\'nski, Arun Swami - Mining association rules between sets of items in large databases
SIGMOD '93: Proceedings of the 1993 ACM SIGMOD international conference on Management of data pp. 207--216, New York, NY, USA,1993
Bibtex
Author : Rakesh Agrawal, Tomasz Imieli\'nski, Arun Swami
Title : Mining association rules between sets of items in large databases
In : SIGMOD '93: Proceedings of the 1993 ACM SIGMOD international conference on Management of data -
Address : New York, NY, USA
Date : 1993