Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Towards event ordering in digital forensics

Tools
- Tools
+ Tools

Levett, C., Jhumka, Arshad and Anand, Sarabjot Singh (2010) Towards event ordering in digital forensics. In: 12th ACM Multimedia Security Workshop, Univ Studi Roma TRE, Roma, Italy, 09-10 Sep 2010 . Published in: MM&Sec '10 : proceedings of the 2010 ACM SIGMM Multimedia and Security Workshop ; September 9-10, 2010, Roma, Italy / sponsored by ACM SIGMM pp. 35-42. doi:10.1145/1854229.1854238 ISSN 9781450302869.

Research output not available from this repository.

Request-a-Copy directly from author or use local Library Get it For Me service.

Request Changes to record.

Abstract

In criminal investigation and criminal justice, investigators are usually faced with several reports, which contain a set of events of interest. Often, it is important to be able to order these events so that relevant queries can be posed on this ordering, such as "was X at location Y when the murder took place?" However, ordering of these events is very difficult, especially if very few events are anchored in time, i.e., few events are associated with an explicit time. Manual extraction of all the events of interest from these reports is tedious. On the other hand, automated extraction is inaccurate at best, in the sense that either several events that may not be important could be included. This ultimately gives a large set of events to consider, and imposing an ordering on this set can yield a large tree structure, where nodes represent an event of interest, and an edge (i, j) indicates that event i occurred before or at the same time as event j, and the root node represents a special "start" event. In this paper, we investigate two techniques for automating extraction of events, and then ordering these. We compare the efficiency of the techniques through the size of the tree structure obtained.

Item Type: Conference Item (Paper)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH): Forensic sciences -- Data processing, Forensic sciences -- Technological innovations
Journal or Publication Title: MM&Sec '10 : proceedings of the 2010 ACM SIGMM Multimedia and Security Workshop ; September 9-10, 2010, Roma, Italy / sponsored by ACM SIGMM
Publisher: Association for Computing Machinery
ISSN: 9781450302869
Official Date: 2010
Dates:
DateEvent
2010Published
Page Range: pp. 35-42
DOI: 10.1145/1854229.1854238
Status: Peer Reviewed
Publication Status: Published
Conference Paper Type: Paper
Title of Event: 12th ACM Multimedia Security Workshop
Type of Event: Conference
Location of Event: Univ Studi Roma TRE, Roma, Italy
Date(s) of Event: 09-10 Sep 2010

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item
twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us