Clustering Graf dengan Algoritma Rantai Markov
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.
 Schaeffer, S. (2007). Graph clustering. Computer Science Review, 1, 27--64.
 Xu, X., Yuruk, N., Feng, Z. & Schweiger, T. A. J. (2007). SCAN: A Structural Clustering Algorithm for Networks. Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (p./pp. 824-833).
 Wilkinson, D. J. (2006). Stochastic modelling for systems biology. Boca Raton, Fla. [u.a.]: Chapman & Hall/CRC. ISBN: 978-1-584-88540-5.
 M. Iliofotou, P. Pappu, M. Faloutsos, M. Mitzenmacher, S. Singh, and G. Varghese, “Network monitoring using tra_c dispersion graphs (TDGs)," in Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement, IMC '07, (New York, NY, USA), pp. 315-320, ACM, 2007.
 M. Iliofotou, “Exploring graph-based network traffic monitoring," in IEEE INFOCOM Workshops 2009, pp. 1-2, 2009.
 van Dongen, S. (2000). Graph Clustering by Flow Simulation. Unpublished doctoral dissertation, University of Utrecht.
 MAWI Working Group, “MAWI Working Group Traffic Archive."
 “Graphviz: Open source graph visualization software."
 Nataliani, Y., Wellem, T. (2014) HTTP Traffic Graph Clustering using Markov Clustering Algorithm. International Journal of Computer Applications 90(2):37-41.