Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Enhanced Clustering for Forensic Analysis


Affiliations
1 Computer Science and Engineering, Nagpur University, Nagpur, India
     

   Subscribe/Renew Journal


In todays digital world,the forensic analysis is of great importance. Huge amount of data has been examined by analyst to present evidences in court. But, usually the files in those computers consist of data is in unstructured form. Thus, it is very difficult to analyze such data. To overcome this difficulty, the automatic analyses of data are of great interest. The algorithms for automatic clustering can be used to retrieve the interesting knowledge and useful information from the data which is unstructured and unorganized. We will propose the algorithm for clustering of data in automatic manner useful for computer forensic experts for the analysis of data. We will experiment for such things by proposing an approach of enhanced K-medoid algorithm with representatives over well known clustering algorithms. We performed experiment on the data collected from different real time crime data sources found in Police investigation FIRs'. We will propose the enhanced preprocessing techniques which can be beneficial over the well known stemmer algorithms. Finally, we summarize the results using good visualization techniques.

Keywords

Improved Preprocessing, K-Representative, Dendrogram.
Subscription Login to verify subscription
User
Notifications
Font Size


Abstract Views: 289

PDF Views: 0




  • Enhanced Clustering for Forensic Analysis

Abstract Views: 289  |  PDF Views: 0

Authors

Rahul D. Kopulwar
Computer Science and Engineering, Nagpur University, Nagpur, India
Chetan Bawankar
Computer Science and Engineering, Nagpur University, Nagpur, India

Abstract


In todays digital world,the forensic analysis is of great importance. Huge amount of data has been examined by analyst to present evidences in court. But, usually the files in those computers consist of data is in unstructured form. Thus, it is very difficult to analyze such data. To overcome this difficulty, the automatic analyses of data are of great interest. The algorithms for automatic clustering can be used to retrieve the interesting knowledge and useful information from the data which is unstructured and unorganized. We will propose the algorithm for clustering of data in automatic manner useful for computer forensic experts for the analysis of data. We will experiment for such things by proposing an approach of enhanced K-medoid algorithm with representatives over well known clustering algorithms. We performed experiment on the data collected from different real time crime data sources found in Police investigation FIRs'. We will propose the enhanced preprocessing techniques which can be beneficial over the well known stemmer algorithms. Finally, we summarize the results using good visualization techniques.

Keywords


Improved Preprocessing, K-Representative, Dendrogram.