Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal Aiti: Jurnal Teknologi Informasi
Theophilus Wellem
Fakultas Teknologi Informasi, Universitas Kristen Satya Wacana Jl. Diponegoro 52-60 Salatiga 50711, Jawa Tengah
Computer Science & IT

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Clustering Graf dengan Algoritma Rantai Markov Theophilus Wellem; Yessica Nataliani
AITI Vol 14 No 2 (2017)
Publisher : Fakultas Teknologi Informasi Universitas Kristen Satya Wacana

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1860.552 KB)

Abstract

Graph clustering is the task of grouping the vertices of the graph into clusters taking into consideration the edge structure of the graph in such a way that there should be many edges within each cluster and relatively few between the clusters. The objective of this paper is to apply Markov clustering algorithm. Two examples are used to demonstrate the algorithm. In the first example, simple graph is presented to illustrate the computation of this algorithm. While the second example is to study the hosts’ interaction behavior using graph clustering algorithm. The Markov clustering algorithm is used to group (cluster) hosts which have interaction using the HTTP protocol. Using real network traces, the clustering results show that the algorithm successfully group the hosts to their corresponding clusters.
Co-Authors Yessica Nataliani