An Effective algorithm for Spam Filtering and Cluster Formation
Kavitha Guda, , , ,
Affiliations 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.
 Marek Rychly, Pavlina Ticha, â€œA tool for clustering in data miningâ€, International Federation for Information Processing, 2007.
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.
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.  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.
 Rushdi, S. and Robet, M, â€œClassification spam emails using text and readability featuresâ€, IEEE 13th International Conference on Data Mining, 2013.
 Androutsopoulos, I., Paliouras, G., and Michelakis, â€œE. Learning to filter unsolicited commercial e-mailâ€, Technical report NCSR Demokritos, 2011.
Na shi, â€œResearch on k-means clustering algorithmâ€, 3rd international symposium on intelligent information technology and security informatics, 2011.
 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.
 Boomjia M.D, â€œComparison of partitioning based clustering algorithmsâ€.
 Han kwai, â€œApproximate distributed k-means clustering over a peer-to-peer networkâ€, IEEE transactions on knowledge and data engineering, 2009.
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.
ML & KD- Machine Learning & Knowledge Discovery Group. http://mlkd.csd.auth.gr/concept drift.html.
 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.
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.
 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.
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
☞ INVITING SUBMISSIONS FOR THE NEXT ISSUE :
☞ LAST DATE OF SUBMISSION : 31st March 2023
☞ SUBMISSION TO FIRST DECISION : In 7 Days
☞ FINAL DECISION : IN 3 WEEKS FROM THE DAY OF SUBMISSION
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.