Abstract
dc:description.abstractSpam emails are a very current and ongoing issue. The sheer volume of spam emails makes the task of analysing them very tedious, for example, for campaign identification purposes. A spam email cluster is the abstraction of numerous spam emails. Clustering spam emails aids by analysing them by bulk. One such clustering algorithm, proposed by Han et al., revolves around using a data model called FP-Tree. We have implemented it in a practical system. We also made the algorithm harness the storage and processing capabilities of Hadoop, a distributed computing framework. The algorithm was also improved to produce less but more dissimilar clusters. Extensive experiments and evaluations were conducted. Results show that our implementation performs better in most circumstances than an original implementation by Dihn et al. This thesis presents the system design, improvements, and evaluation of our implementation of the FP-Tree based spam email clustering algorithm.
Degree
thesis:*- Name thesis:degree_name
- Master of Computer Science (M.C.S.)
- Level thesis:degree_level
- Master's
- Discipline thesis:degree_discipline
- Computer Science
- Grantor dc:publisher
- Carleton University
- Year dc:date.issued
- 2017
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Kirillov, Danil
Subjects
dc:subject × 1Rights
dc:rights- Statement dc:rights
-
- Copyright © 2017 the author(s). Theses may be used for non-commercial research, educational, or related academic purposes only. Such uses include personal study, research, scholarship, and teaching. Theses may only be shared by linking to Carleton University Institutional Repository and no part may be used without proper attribution to the author. No part may be used for commercial purposes directly or indirectly via a for-profit platform; no adaptation or derivative works are permitted without consent from the copyright owner.
- Language dc:language.iso
- en