An optimized k-NN classifier based on minimum spanning tree for email filtering

In the era of internet where mailboxes are being flooded by unnecessary emails, it becomes troublesome and time consuming to organize and classify legitimate emails into folders. Although there has been extensive investigation of automatic document categorization, email classification gives rise to a number of challenges, and there has been relatively little study in this domain. This paper presents a framework for email classification using Enron email dataset based on an improved k-NN classification using a minimum spanning tree clustering algorithm considering the case where the number of clusters (email folders) are unknown initially. Such a classification can be useful in maintaining email and web directories, identifying spam and valid mails. Experimental results show that the proposed algorithm outperforms state of art classification algorithms like standard k-NN and Naïve Bayes classifiers and c4.5 decision tree classifier.