dc.contributor.advisor | Chakrabarty, Dr. Amitabha | |
dc.contributor.advisor | Mostakim, Moin | |
dc.contributor.author | Khan, Behroz Newaz | |
dc.contributor.author | Saroar, Sk Golam | |
dc.contributor.author | Alam, Md. Mosfaiul | |
dc.contributor.author | Gomes, Sebastian Romy | |
dc.date.accessioned | 2017-05-11T06:08:08Z | |
dc.date.available | 2017-05-11T06:08:08Z | |
dc.date.copyright | 2017 | |
dc.date.issued | 2017-04 | |
dc.identifier.other | ID 12101023 | |
dc.identifier.other | ID 13101251 | |
dc.identifier.other | ID 13101047 | |
dc.identifier.other | ID 13101058 | |
dc.identifier.uri | http://hdl.handle.net/10361/8116 | |
dc.description | This thesis report is submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2017. | en_US |
dc.description | Cataloged from PDF version of thesis report. | |
dc.description | Includes bibliographical references (page 71-74). | |
dc.description.abstract | This research investigates a comparison between two different approaches for classifying emails based on their categories. Naive Bayes and Hidden Markov Model (HMM), two different machine learning algorithms, both have been used for detecting whether an email is important or spam. Naive Bayes Classifier is based on conditional probabilities. It is fast and works great with small dataset. It considers independent words as a feature. HMM is a generative, probabilistic model that provides us with distribution over the sequences of observations. HMMs can handle inputs of variable length and help programs come to the most likely decision, based on both previous decisions and current data. Various combinations of NLP techniques- stopwords removing, stemming, lemmatizing have been tried on both the algorithms to inspect the differences in accuracy as well as to find the best method among them. Along with classifying emails, this paper also describes the methodologies used for automatic meeting scheduling by an intelligent email assistant. Users who regularly send or receive messages for setting up meetings will be greatly benefitted by this system as it will classify their emails and schedule their meetings automatically. | en_US |
dc.description.statementofresponsibility | Khan, Behroz Newaz | |
dc.description.statementofresponsibility | Saroar, Sk Golam | |
dc.description.statementofresponsibility | Alam, Md. Mosfaiul | |
dc.description.statementofresponsibility | Gomes, Sebastian Romy | |
dc.format.extent | 74 pages | |
dc.language.iso | en | en_US |
dc.publisher | BRAC University | en_US |
dc.rights | BRAC University thesis are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. | |
dc.subject | Email classification | en_US |
dc.subject | Meeting scheduling | en_US |
dc.subject | Classifier algorithm | en_US |
dc.title | Email classification and meeting scheduling using classifier algorithm | en_US |
dc.type | Thesis | en_US |
dc.contributor.department | Department of Computer Science and Engineering, BRAC University | |
dc.description.degree | B. Computer Science and Engineering | |