Impact Factor:6.549
 Scopus Suggested Journal: UNDER REVIEW for TITLE INCLUSSION

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Open Access and Multidisciplinary

Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed,Open Access and Multidisciplinary

ISSN(Online):2349-7084                 Submit Paper    Check Paper Status    Conference Proposal

Back to Current Issues

An Effective algorithm for Spam Filtering and Cluster Formation

Kavitha Guda, , , ,
Associate Professor, Department of Computer Science and Engineering.

K-means clustering algorithm is one of the most widely used partitioning algorithms used for grouping the elements over spatiotemporal data. It is the fast, simple and can work with large datasets. It has some of the pitfalls regarding Number of iterations are more due to clusters details not known at an initial stage. It can detect only spherical clusters. Here we will propose a Hybrid K-Means clustering algorithm which will mostly work on the concept of splitting dataset and reducing the number of iterations. It will inherit the some of the features from two revised K-means algorithms. The advantage of separating more massive datasets is that handle easy, and the benefit of reducing iterations leads the easy cluster formation in this way the efficiency of the traditional K-means clustering algorithm is increased. Furthermore, we also proposed Naïve Bayes Algorithm for Email Spam Filtering on SPAMBASE Dataset.

Kavitha Guda, “An Effective algorithm for Spam Filtering and Cluster Formation”, International Journal Of Computer Engineering In Research Trends, 3(12):659-666, December-2016.

Keywords : Data Mining, KDD, E-Mail, Spam, Naïve Bayes Algorithm, Spam Filter, K-Means Algorithm, Hybrid K-means Algorithm, SPAMBASE dataset.

[1] Marek Rychly, Pavlina Ticha, “A tool for clustering in data mining”, International Federation for Information Processing, 2007.
[2]P.Verma, D.Kumar, “Association Rule Mining Algorithm’s Variant Analysis”, International Journal of Computer Application (IJCA), vol. 78, no. 14, September 2013, pp. 26–34.
[3]L.Firte, C.Lemnaru, R.Potolea, “Spam Detection Filter using KNN Algorithm and Resampling”, 6th International Conference on Intelligent Computer Communication and Processing- IEEE, 2010, pp.27-33. [4] G.Kaur, R.K.Gurm, “A Survey on Classification Techniques in Internet Environment”, International Journal of Advance Research in Computer and Communication Engineering, vol. 5, no. 3, March 2016, pp. 589–593.
[5] Rushdi, S. and Robet, M, “Classification spam emails using text and readability features”, IEEE 13th International Conference on Data Mining, 2013.
 [6] Androutsopoulos, I., Paliouras, G., and Michelakis, “E. Learning to filter unsolicited commercial e-mail”, Technical report NCSR Demokritos, 2011.
[7]Na shi, “Research on k-means clustering algorithm”, 3rd international symposium on intelligent information technology and security informatics, 2011. 
[8] Shah Sourabh, Singh Manmohan, “comparison of a time efficient modified k-mean algorithm with k-mean and kmedoid algorithm” international conference on communication systems and network technologies, 2012.
 [9] Boomjia M.D, “Comparison of partitioning based clustering algorithms”. 
[10] Han kwai, “Approximate distributed k-means clustering over a peer-to-peer network”, IEEE transactions on knowledge and data engineering, 2009.
[11]Tariq, M., B., Jameel A. Tariq, Q., Jan, R. Nisar, A. S., “Detecting Threat E-mails using Bayesian Approach”, IJSDIA International Journal of Secure Digital Information Age, Vol. 1. No. 2, December 2009.
[12]ML & KD- Machine Learning & Knowledge Discovery Group. drift.html.
[13] Rizky, W. M., Ristu, S., Afrizal, D. “The Effect of Best First and Spreadsubsample on Selection of a Feature Wrapper With Naïve Bayes Classifier for The Classification of the Ratio of Inpatients”. Scientific Journal of Informatics, Vol. 3(2), p. 41-50, Nov. 2016.
[14]Feng, W., Sun, J., Zhang, L., Cao, C. and Yang,Q., “A support vector machine based naive Bayes algorithm for spam filtering,” 2016 IEEE 35th International Performance Computing and Communications Conference (IPCCC), Las Vegas, NV, 2016, pp. 1-8.
[15] Lalchand G. Titare1, Prof. Riya Qureshi,” Cloud Centric loT Based Farmer’s Virtual Market place” International Journal of Computer Engineering In Research Trends., vol.3, no.12, pp. 654-658, 2016.

DOI Link : 10.22362/ijcert/2016/v3/i12/4321

Download :

Refbacks : Currently There are norefbacks


Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors. 

News & Events

Latest issue :Volume 10 Issue 1 Articles In press

A plagiarism check will be implemented for all the articles using world-renowned software. Turnitin.

Digital Object Identifier will be assigned for all the articles being published in the Journal from September 2016 issue, i.e. Volume 3, Issue 9, 2016.

IJCERT is a member of the prestigious.Each of the IJCERT articles has its unique DOI reference.
DOI Prefix : 10.22362/ijcert

IJCERT is member of The Publishers International Linking Association, Inc. (“PILA”)

Emerging Sources Citation Index (in process)

IJCERT title is under evaluation by Scopus.

Key Dates

☞   LAST DATE OF SUBMISSION : 31st March 2023
In 7 Days

Important Announcements

All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.

Citation Index

Citations Indices All
Citations 1026
h-index 14
i10-index 20
Source: Google Scholar

Acceptance Rate (By Year)

Acceptance Rate (By Year)
Year Rate
2021 10.8%
2020 13.6%
2019 15.9%
2018 14.5%
2017 16.6%
2016 15.8%
2015 18.2%
2014 20.6%

Important Links

Conference Proposal