Probalistic model of spam filter system

Research Article
Open access

Probalistic model of spam filter system

Yanzhi Xiong 1* , Tianlan Wei 2
  • 1 Department of mathematics, Xi’an Jiaotong-Liverpool University, Suzhou, China    
  • 2 Department of mathematics, Xi’an Jiaotong University, XiAn, China    
  • *corresponding author Yanzhi.Xiong20@student.xjtlu.edu.cn
Published on 14 June 2023 | https://doi.org/10.54254/2755-2721/6/20230812
ACE Vol.6
ISSN (Print): 2755-273X
ISSN (Online): 2755-2721
ISBN (Print): 978-1-915371-59-1
ISBN (Online): 978-1-915371-60-7

Abstract

Numerous tasks have been carried out using probabilistic reasoning, including picture recognition, computer diagnosis, stock price prediction, movie recommendation, and cyber intrusion detection. But until recently, the breadth of probabilistic programming was constrained (partly because of the low processing power), and the majority of inference methods had to be created manually for every job. Nevertheless, in 2015, 3D representations of human faces were created from 2D photographs of such faces using a 50-line probabilistic computer vision software. The inference approach of the software, which was developed in Julia using the Picture package, was based on inverted graphics. "What used to require thousands of lines of code" might now be accomplished in just 50. Probabilistic computing is a method to create systems that help us make decisions in the face of uncertainty. In this paper we propose a spam-filtering system. The novelty of our spam-filtering system is that we utilize probabilistic programming to improve spam-filtering reasoning systems. We implement several factors from email to establish a model to get the output. Our preliminary results show that we successfully accomplish a spam-filtering system. More problem of classification of spam filter can be described in a probabilistic modelling language in our future work.

Keywords:

spam filter, probablistic programming, probablistic model

Xiong,Y.;Wei,T. (2023). Probalistic model of spam filter system . Applied and Computational Engineering,6,277-282.
Export citation

References

[1]. W. J. Anderson. Continuous-Time Markov Chains. Springer-Verlag, New York, 1991.

[2]. R. J. Adler. The Geometry of Random Fields., Wiley, New York, 1981.

[3]. P. Baldi, L. Mazliak and P. Priouret. Martingales and Markov Chains: Solved Exercises and Elements of Theory. Chapman-Hall/CRC, Boca Raton, 2002.

[4]. I. V. Basawa and B. L. S. Prakasa Rao. Statistical Inference for Stochastic Processes. Academic Press, London.

[5]. P. Billingsley. Convergence of Probability Measures, 2nd Ed., Wiley, New York, 2000.

[6]. K. L. Chung. Markov Chains with Stationary Transition Probabilities, 2nd Ed. Springer-Verlag,

[7]. New York, 1967.

[8]. K. L. Chung and R. J. Williams. Introduction to Stochastic Integration, 2nd Ed. Birkhauser, Boston, 1990.

[9]. P. Embrechts and M. Maejima. Selfsimilar Processes. Princeton University Press, Princeton, 2002.

[10]. T. Hida and M. Hitsuda. Gaussian Processes. American Mathematical Society, Providence, R.I. , 1991.

[11]. O. Kallenberg. Random Measures. Academic Press, London, 1976.

[12]. I. Karatzas and S. E. Shreve. Brownian Motion and Stochastic Calculus. Springer-Verlag, New York, 1991.

[13]. E. Lukacs. Characteristic Functions, 2nd Ed. Griffin, 1970.

[14]. [14] S. P. Meyn and R. L. Tweedie. Markov Chains and Stochastic Stability. Springer-Verlag, New York, 1993.

[15]. V. V. Petrov. Limit Theorems of Probability Theory. Oxford University Press, Oxford, 1995.

[16]. G. Samorodnitsky and M. S. Taqqu. Stable Non-Gaussian Random Processes. Chapman-Hall/CRC, Boca Raton, 1994.

[17]. G. R. Shorack. Probability for Statisticians. Springer-Verlag, New York, 2000.

[18]. R. Durrett. Probability: theory and examples (Vol. 49). Cambridge university press, 2019.

[19]. A. Pfeffer. Practical probabilistic programming. Simon and Schuster, 2016.


Cite this article

Xiong,Y.;Wei,T. (2023). Probalistic model of spam filter system . Applied and Computational Engineering,6,277-282.

Data availability

The datasets used and/or analyzed during the current study will be available from the authors upon reasonable request.

Disclaimer/Publisher's Note

The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of EWA Publishing and/or the editor(s). EWA Publishing and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

About volume

Volume title: Proceedings of the 3rd International Conference on Signal Processing and Machine Learning

ISBN:978-1-915371-59-1(Print) / 978-1-915371-60-7(Online)
Editor:Omer Burak Istanbullu
Conference website: http://www.confspml.org
Conference date: 25 February 2023
Series: Applied and Computational Engineering
Volume number: Vol.6
ISSN:2755-2721(Print) / 2755-273X(Online)

© 2024 by the author(s). Licensee EWA Publishing, Oxford, UK. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license. Authors who publish this series agree to the following terms:
1. Authors retain copyright and grant the series right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this series.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the series's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this series.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See Open access policy for details).

References

[1]. W. J. Anderson. Continuous-Time Markov Chains. Springer-Verlag, New York, 1991.

[2]. R. J. Adler. The Geometry of Random Fields., Wiley, New York, 1981.

[3]. P. Baldi, L. Mazliak and P. Priouret. Martingales and Markov Chains: Solved Exercises and Elements of Theory. Chapman-Hall/CRC, Boca Raton, 2002.

[4]. I. V. Basawa and B. L. S. Prakasa Rao. Statistical Inference for Stochastic Processes. Academic Press, London.

[5]. P. Billingsley. Convergence of Probability Measures, 2nd Ed., Wiley, New York, 2000.

[6]. K. L. Chung. Markov Chains with Stationary Transition Probabilities, 2nd Ed. Springer-Verlag,

[7]. New York, 1967.

[8]. K. L. Chung and R. J. Williams. Introduction to Stochastic Integration, 2nd Ed. Birkhauser, Boston, 1990.

[9]. P. Embrechts and M. Maejima. Selfsimilar Processes. Princeton University Press, Princeton, 2002.

[10]. T. Hida and M. Hitsuda. Gaussian Processes. American Mathematical Society, Providence, R.I. , 1991.

[11]. O. Kallenberg. Random Measures. Academic Press, London, 1976.

[12]. I. Karatzas and S. E. Shreve. Brownian Motion and Stochastic Calculus. Springer-Verlag, New York, 1991.

[13]. E. Lukacs. Characteristic Functions, 2nd Ed. Griffin, 1970.

[14]. [14] S. P. Meyn and R. L. Tweedie. Markov Chains and Stochastic Stability. Springer-Verlag, New York, 1993.

[15]. V. V. Petrov. Limit Theorems of Probability Theory. Oxford University Press, Oxford, 1995.

[16]. G. Samorodnitsky and M. S. Taqqu. Stable Non-Gaussian Random Processes. Chapman-Hall/CRC, Boca Raton, 1994.

[17]. G. R. Shorack. Probability for Statisticians. Springer-Verlag, New York, 2000.

[18]. R. Durrett. Probability: theory and examples (Vol. 49). Cambridge university press, 2019.

[19]. A. Pfeffer. Practical probabilistic programming. Simon and Schuster, 2016.