INDRAKUSUMA, HUBERTUS VEGA (2018) EMAIL CLUSTERING AND GROUPING BASED ON CONTENT SIMILARITY USING K-MEANS ALGORITHM. Other thesis, Fakultas Teknik Informatika.

	Text (BAB I) 12.02.0020 HUBERTUS VEGA INDRAKUSUMA BAB I.pdf Restricted to Registered users only 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 Restricted to Registered users only Download (0B)
	Text (BAB IV) 12.02.0020 HUBERTUS VEGA INDRAKUSUMA BAB IV.pdf Restricted to Registered users only Download (0B)
	Text (BAB V) 12.02.0020 HUBERTUS VEGA INDRAKUSUMA BAB V.pdf Restricted to Registered users only Download (0B)
	Text (BAB VI) 12.02.0020 HUBERTUS VEGA INDRAKUSUMA BAB VI.pdf Restricted to Registered users only 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

Actions (login required)

View Item