Penerapan Algoritma Batchelor-Wilkins dalam Pengklasteran Graf
Abstract
Batchelor-Wilkins Algorithm is a simple and heuristic clustering algorithm used when the number of classes is unknown. In this paper we will use Batchelor-Wilkins algorithm in graph clustering, specifically a Banana Tree Graph B(n,k), a graph obtained by connecting one leaf of each of n copies of a complete bipartite graph K_{1,k-1} to a single root vertex.
Downloads
Download data is not yet available.
References
[1] R. Diestel, Graph Theory. Springer-Verlag Heidelberg, 2005.
[2] N. Biggs, Algebraic Graph Theory. Cambridge University Press, 1993.
[3] S. Bow, Pattern Recognition and Image Preprocessing. Marcel Dekker, 2002.
[4] W. C. Chen, H. I. Lu, dan Y. N. Neh, “Operations of Interlaced Trees and Graceful Trees,” Southeast Asian Bull, Math, Vol. 21: 337-348, 1997.
[2] N. Biggs, Algebraic Graph Theory. Cambridge University Press, 1993.
[3] S. Bow, Pattern Recognition and Image Preprocessing. Marcel Dekker, 2002.
[4] W. C. Chen, H. I. Lu, dan Y. N. Neh, “Operations of Interlaced Trees and Graceful Trees,” Southeast Asian Bull, Math, Vol. 21: 337-348, 1997.
Published
2023-07-30
How to Cite
NADEAK, Christyan Tamaro.
Penerapan Algoritma Batchelor-Wilkins dalam Pengklasteran Graf.
Indonesian Journal of Applied Mathematics, [S.l.], v. 3, n. 1, p. 1-5, july 2023.
ISSN 2774-2016.
Available at: <https://journal.itera.ac.id/index.php/indojam/article/view/1259>. Date accessed: 19 may 2024.
doi: https://doi.org/10.35472/indojam.v3i1.1259.
Section
Articles
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
