Batchelor-Wilkins 算法在图形聚类中的应用

Indonesian Journal of Applied Mathematics Pub Date : 2023-07-30 DOI:10.35472/indojam.v3i1.1259

Christyan Tamaro Nadeak

{"title":"Batchelor-Wilkins 算法在图形聚类中的应用","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":"{\"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}","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

摘要

Batchelor-Wilkins 算法是一种简单的启发式聚类算法，用于未知类数的情况。在本文中，我们将把 Batchelor-Wilkins 算法用于图聚类，特别是香蕉树图 B(n,k)，这是一种通过将完整双熵图 K_{1,k-1} 的 n 份副本中每份副本的一个叶子连接到一个根顶点而得到的图。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Penerapan Algoritma Batchelor-Wilkins dalam Pengklasteran Graf

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Indonesian Journal of Applied Mathematics

自引率

0.00%

发文量