INDRAKUSUMA, HUBERTUS VEGA (2018) EMAIL CLUSTERING AND GROUPING BASED ON CONTENT SIMILARITY USING K-MEANS ALGORITHM. Other thesis, Fakultas Teknik Informatika.
![[img]](http://repository.unika.ac.id/style/images/fileicons/text.png) |
Text (BAB I)
12.02.0020 HUBERTUS VEGA INDRAKUSUMA BAB I.pdf Download (0B) |
|
Text (COVER)
COVER.pdf Download (0B) |
|
Text (BAB II)
12.02.0020 HUBERTUS VEGA INDRAKUSUMA BAB II.pdf Restricted to Registered users only Download (0B) |
|
Text (BAB III)
12.02.0020 HUBERTUS VEGA INDRAKUSUMA BAB III.pdf Download (0B) |
|
Text (BAB IV)
12.02.0020 HUBERTUS VEGA INDRAKUSUMA BAB IV.pdf Download (0B) |
|
Text (BAB V)
12.02.0020 HUBERTUS VEGA INDRAKUSUMA BAB V.pdf Download (0B) |
|
Text (BAB VI)
12.02.0020 HUBERTUS VEGA INDRAKUSUMA BAB VI.pdf Download (0B) |
|
Text (DAFTAR PUSTAKA)
12.02.0020 HUBERTUS VEGA INDRAKUSUMA DAFTAR PUSTAKA.pdf Download (0B) |
Abstract
ABSTRACT Amount of email has been increasing dramatically as the growth of Internet, social media, and information management. Similarity measure of a group emails play an important role in email classification and clustering using K-means data clustering algorithm. K-means algorithm is one of many data clustering algorithm techniques. To overcome these problems Eucledian calculation also needed to do the data clustering. Grouped emails inside of different clusters based on the email similarities will become the final result of this project. Keyword: K-means, email classification, data clustering, eucledian
| Item Type: | Thesis (Other) |
|---|---|
| Subjects: | 000 Computer Science, Information and General Works > 005 Computer programming, programs & data > Information Systems |
| Divisions: | Faculty of Computer Science > Department of Information Systems |
| Depositing User: | Mr Lucius Oentoeng |
| Date Deposited: | 21 Jun 2018 03:37 |
| Last Modified: | 11 Feb 2021 04:00 |
| URI: | http://repository.unika.ac.id/id/eprint/16104 |
Actions (login required)
 |
View Item |
