• Journal of IKEEE
• /
• v.23 no.4
• /
• pp.1393-1399
• /
• 2019

With the rapid growth of the Internet, millions of indiscriminate advertising SMS are sent every day because of the convenience of sending and receiving data. Although we still use methods to block spam words manually, we have been actively researching how to filter spam in a various ways as machine learning emerged. However, spam words and patterns are constantly changing to avoid being filtered, so existing machine learning mechanisms cannot detect or adapt to new words and patterns. Recently, the concept of Lifelong Learning emerged to overcome these limitations, using existing knowledge to keep learning new knowledge continuously. In this paper, we propose a method of spam filtering system using ensemble techniques of naive bayesian which is most commonly used in document classification and LLML(Lifelong Machine Learning). We validate the performance of lifelong learning by applying the model ELLA and the Naive Bayes most commonly used in existing spam filters.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.261-265
• /
• 2008

As increasing the user of VoIP service using ITSP(Internet Telephony Service Provider), the VoIP spam becomes a big problem. The spam used in the existing public telephone is detected by using the pattern inspection of call behavior because it is difficult to filter contents for the characteristic of real-time voice communication. However there is a false-positive problem. The threat on spam remains where spam with low threshold can't be detected or users share one number. In this paper, we propose anti-spam for VoIP based on luring test. The proposed method gives a user luring test and he/she can connect to a receiver if passing turing test. A ticket is given to a user that pass luring test and it reduces overhead of luring test in re-dial. The proposed method is implemented on ASUS WL-500G wireless router and Asterisk IP-PBX. Experimental results show the effectiveness of the proposed method.

• Journal of KIISE:Software and Applications
• /
• v.34 no.1
• /
• pp.30-39
• /
• 2007

The existing content-based spam mail filtering algorithms have difficulties in filtering spam mails when e-mails contain images but little text. In this thesis we propose an efficient spam mail classification algorithm that utilizes the link structure of e-mails. We compute the number of hyperlinks in an e-mail and the in-link frequencies of the web pages hyperlinked in the e-mail. Using these two features we classify spam mails and legitimate mails based on the decision tree trained for spam mail classification. We also suggest a hybrid system combining three different algorithms by majority voting: the link structure analysis algorithm, a modified link structure analysis algorithm, in which only the host part of the hyperlinked pages of an e-mail is used for link structure analysis, and the content-based method using SVM (support vector machines). The experimental results show that the link structure analysis algorithm slightly outperforms the existing content-based method with the accuracy of 94.8%. Moreover, the hybrid system achieves the accuracy of 97.0%, which is a significant performance improvement over the existing method.

• The KIPS Transactions:PartB
• /
• v.15B no.1
• /
• pp.61-68
• /
• 2008

This paper presents a spam filter system using co-training with spamminess features and URL features based on the maximum entropy model. Spamminess features are the emphasizing patterns or abnormal patterns in spam messages used by spammers to express their intention and to avoid being filtered by the spam filter system. Since spammers use URLs to give the details and make a change to the URL format not to be filtered by the black list, normal and abnormal URLs can be key features to detect the spam messages. Co-training with spamminess features and URL features uses two different features which are independent each other in training. The filter system can learn information from them independently. Experiment results on TREC spam test collection shows that the proposed approach achieves 9.1% improvement and 6.9% improvement in accuracy compared to the base system and bogo filter system, respectively. The result analysis shows that the proposed spamminess features and URL features are helpful. And an experiment result of the co-training shows that two feature sets are useful since the number of training documents are reduced while the accuracy is closed to the batch learning.

• KIISE Transactions on Computing Practices
• /
• v.23 no.1
• /
• pp.57-64
• /
• 2017

Short message service (SMS) is one of the most important communication methods for people who use mobile phones. However, illegal advertising spam messages exploit people because they can be used without the need for friend registration. Recently, spam message filtering systems that use machine learning have been developed, but they have some disadvantages such as requiring many calculations. In this paper, we implemented a spam message filtering system using the set-based POI search algorithm and sentence similarity without servers. This algorithm can judge whether the input query is a spam message or not using only letter composition without any server computing. Therefore, we can filter the spam message although the input text message has been intentionally modified. We added a specific preprocessing option which aims to enable spam filtering. Based on the experimental results, we observe that our spam message filtering system shows better performance than the original set-based POI search algorithm. We evaluate the proposed system through extensive simulation. According to the simulation results, the proposed system can filter the text message and show high accuracy performance against the text message which cannot be filtered by the 3 major telecom companies.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.2
• /
• pp.160-166
• /
• 2007

When a mail was given to users, each user's response could be different according to his or her preference. This paper presents a solution for this situation by constructing a user preferred ontology for anti-spam systems. To define an ontology for describing user behaviors, we applied associative classification mining to study preference information of users and their responses to emails. Generated classification rules can be represented in a formal ontology language. A user preferred ontology can explain why mail is decided to be spam or ron-spam in a meaningful way. We also suggest a new rule optimization procedure inspired from logic synthesis to improve comprehensibility and exclude redundant rules.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.143-151
• /
• 2005

As the internet and I-commerce have been developing. a novel method for marketing is needed. A new advertisement using E-mail is becoming popular, because it has characteristics with low costs and relative efficiency. However. as the spam mails are increasing rapidly, mail service companies and users are deeply damaged in their mind and economically. In this paper, we design a hierarchical spam mail blocking policy through cooperation of all the participants-user, administrator, ISP to cut off the spam mail efficiently and Propose an efficient model to block and manage the spam mails based on the Policy. Also we prove the efficiencies and effectiveness of the proposed model through evaluation process .

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.7
• /
• pp.271-276
• /
• 2014

Short message service(SMS) in a mobile communication environment is a very convenient method. However, it caused a serious side effect of generating spam messages for advertisement. Those who send spam messages distort or deform SMS sentences to avoid the messages being filtered by automatic filtering system. In order to increase the performance of spam filtering system, we need to recover the distorted sentences into normal sentences. This paper proposes a method of normalizing the various types of distorted sentence and extracting keywords through automatic word spacing and compound noun decomposition.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.04a
• /
• pp.403-414
• /
• 2005

Most of the currently used spam-filters are based on a Bayesian classification technique, where some serious problems occur such as a limited precision/recall rate and the false positive error. This paper addresses a solution to the problems using a modified Bayesian classifier based on chi-square statistics. The resulting spam-filter is more accurate and flexible than traditional Bayesian spam-filters and can be a personalized one providing some parameters when the filter is teamed from training data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.7
• /
• pp.1501-1505
• /
• 2004

The authentication system of high-speed internet in IP-infra is not warm enough to administration of systematic authentication information for user's legalization, connection right and resources allocation in order to both methods of authentication-unauthentication connection system according to transmission method . Also unauthentication connection raises a difficulty condition to user's needs satisfaction in order to a load weighting of system and network and a drop of transmission speed. Accordingly, this study brings forth authentication system construction in a high-speed IP infrastructure using spam sever able to construct the suitable network condition according to unifying authentication-unauthentication system for single authentication system.