{"title":"Penerapan Algoritma Batchelor-Wilkins dalam Pengklasteran Graf","authors":"Christyan Tamaro Nadeak","doi":"10.35472/indojam.v3i1.1259","DOIUrl":null,"url":null,"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.","PeriodicalId":293313,"journal":{"name":"Indonesian Journal of Applied Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Indonesian Journal of Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.35472/indojam.v3i1.1259","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
