Emails are utilised in practically all spheres of today's society, from the professional world to the academic sphere. Ham and spam are the two subcategories that may be found within emails. Email spam, also known as junk email or unwelcome email, is a sort of email that may be used to cause harm to any user by wasting his or her time, using an excessive amount of computing resources, and stealing important information. The proportion of unsolicited emails is rising at an alarming rate day by day. Predicting the value of a company's stock is difficult for academics, investors, and analysts. The majority of people are interested in learning about stock prices in order to enhance their own finances. Long-Short-Term Memory (LSTM) is the abbreviation for the time series notation. In today's market, a stock trading system needs to adhere to this paradigm and combine KNN and LSTM in order to achieve higher levels of accuracy in its models. The majority of people in today's world improve their financial situations by trading on the stock market. When this doesn't work, individuals’ resort to criminal behaviour. The two equities are compared using this procedure. In order to solve the problems that the pure KNN method was having with distance metrics, the suggested model uses an optimised version of the KNN technique. The fact that the majority of test data in the present KNN is focused on focal points has no impact on the stock prediction because all of the qualities are connected. The Programme places a greater emphasis on data points that are favorable rather than ones that are centered. The KNN distance probability is determined by an optimization procedure. The present iteration of the KNN model demands a significant amount of memory in addition to other resources so that it can compute the distance between each data point and the test point. By removing duplicates, the procedure eliminates the need to double-check the records. The procedure is sped up by reducing the number of iterations. The effectiveness of the model is demonstrated by comparisons with standard classifiers.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Machine Learning Algorithms for Identifying Spam Emails

  • Ajmeera Kiran,
  • Mudassir Khan,
  • J. Chinna Babu,
  • B. P. Santosh Kumar

摘要

Emails are utilised in practically all spheres of today's society, from the professional world to the academic sphere. Ham and spam are the two subcategories that may be found within emails. Email spam, also known as junk email or unwelcome email, is a sort of email that may be used to cause harm to any user by wasting his or her time, using an excessive amount of computing resources, and stealing important information. The proportion of unsolicited emails is rising at an alarming rate day by day. Predicting the value of a company's stock is difficult for academics, investors, and analysts. The majority of people are interested in learning about stock prices in order to enhance their own finances. Long-Short-Term Memory (LSTM) is the abbreviation for the time series notation. In today's market, a stock trading system needs to adhere to this paradigm and combine KNN and LSTM in order to achieve higher levels of accuracy in its models. The majority of people in today's world improve their financial situations by trading on the stock market. When this doesn't work, individuals’ resort to criminal behaviour. The two equities are compared using this procedure. In order to solve the problems that the pure KNN method was having with distance metrics, the suggested model uses an optimised version of the KNN technique. The fact that the majority of test data in the present KNN is focused on focal points has no impact on the stock prediction because all of the qualities are connected. The Programme places a greater emphasis on data points that are favorable rather than ones that are centered. The KNN distance probability is determined by an optimization procedure. The present iteration of the KNN model demands a significant amount of memory in addition to other resources so that it can compute the distance between each data point and the test point. By removing duplicates, the procedure eliminates the need to double-check the records. The procedure is sped up by reducing the number of iterations. The effectiveness of the model is demonstrated by comparisons with standard classifiers.