MML inference of Finite State Automata for probabilistic spam detection

Abstract

MML (Minimum Message Length) has emerged as a powerful tool in inductive inference of discrete, continuous and hybrid structures. The Probabilistic Finite State Automaton (PFSA) is one such discrete structure that needs to be inferred for classes of problems in the field of Computer Science including artificial intelligence, pattern recognition and data mining. MML has also served as a viable tool in many classes of problems in the field of Machine Learning including both supervised and unsupervised learning. The classification problem is the most common among them. This research is a two-fold solution to a problem where one part focusses on the best inferred PFSA using MML and the second part focusses on the classification problem of Spam Detection. Using the best PFSA inferred in part 1, the Spam Detection theory has been tested using MML on a publicly available Enron Spam dataset. The filter was evaluated on various performance parameters like precision and recall. The evaluation was also done taking into consideration the cost of misclassification in terms of weighted accuracy rate and weighted error rate. The results of our empirical evaluation indicate the classification accuracy to be around 93%, which outperforms well-known established spam filters.

DOI: 10.1109/ICAPR.2015.7050655

Extracted Key Phrases

7 Figures and Tables

Cite this paper

@inproceedings{Saikrishna2015MMLIO, title={MML inference of Finite State Automata for probabilistic spam detection}, author={Vidya Saikrishna and David L. Dowe and Sid Ray}, booktitle={ICAPR}, year={2015} }