CLUSTERING FOR FORENSIC ANALYSIS
Journal: IMPACT : International Journal of Research in Engineering & Technology ( IMPACT : IJRET ) (Vol.2, No. 4)Publication Date: 2014-04-30
Authors : SAHIL KHENAT; PRATIK KOLHATKAR; SARANG PARIT; SHARDUL JOSHI;
Page : 129-136
Keywords : Clustering; CSPA; K-Mean; K-Medoids;
Abstract
In today’s digital world, information in computers has great importance and this information is very essential in context for future references and studies irrespective of various fields. So surveying of such information is critical and important task. In computer forensic analysis, a lot of information present in the digital devices (computers in context of our paper) is examined to extract information. And computer consists of hundreds of thousands of files which contain unstructured text or information, so clustering algorithms are of great interest. Clustering helps to improve analysis of documents under consideration. This document clustering analysis is very useful for crime investigations to analyze the information from seized digital devices like computers, laptops, hard disks, tablets. There are total six algorithms used for clustering of documents like K-means, K-medoids, single link, complete link, Average Link, CSPA. These six algorithms are very efficiently used to cluster the digital documents. These algorithms make the analysis very fast by clustering very close documents in one cluster. Also two validity index are used to find out how many clusters are formed.
Other Latest Articles
- EXPERIMENTAL INVESTIGATION TO CONTROL ALCOHOLIC DRIVING
- AN ARCHITECTURAL FRAME WORK OF ANN BASED SHORT TERM ELECTRICITY PRICE FORECAST ENGINE FOR INDIAN ENERGY EXCHANGE USING
- A NOVEL STRATEGY FOR FINDING FREQUENT ITEMS IN DYNAMIC XML DISSEMINATION
- SIMPLE TUNING OF PID CONTROLLERS USED WITH OVER DAMPED SECOND-ORDER PROCESSES
- SIMPLE WEAKLY STANDARD RINGS
Last modified: 2014-04-25 21:19:44