arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2405.04881cs.FLcs.ETcs.LG
收藏

基于哥德尔数的一阶十进制元胞自动机聚类算法

Gödel Number based Clustering Algorithm with Decimal First Degree Cellular Automata

National Institute of Technology(印度国家理工学院)

Vicky Vikrant, Narodia Parth P, Kamalika Bhattacharjee

AI总结:

提出一种利用哥德尔数编码和一阶十进制元胞自动机可达循环的聚类算法,并通过多项基准指标验证其优于现有方法。

摘要:

本文提出一种基于一阶十进制元胞自动机(FDCA)的聚类算法,其中簇依据可达性创建。算法构建循环空间,并将处于同一循环中的配置视为同一簇。这里,真实数据对象使用基于哥德尔数的编码被编码为十进制字符串。该方案的优点是在保持特征属性的同时缩短了编码字符串长度。候选CA规则依据自复制和信息流等理论准则确定。研究开发了一种迭代算法,通过三个阶段生成所需数量的簇。聚类结果基于Silhouette score、Davis Bouldin、Calinski Harabasz和Dunn Index等基准聚类指标进行评估。与现有最先进聚类算法相比,本文提出的算法表现出更优的性能。

英文摘要:

In this paper, a decimal first degree cellular automata (FDCA) based clustering algorithm is proposed where clusters are created based on reachability. Cyclic spaces are created and configurations which are in the same cycle are treated as the same cluster. Here, real-life data objects are encoded into decimal strings using Gödel number based encoding. The benefits of the scheme is, it reduces the encoded string length while maintaining the features properties. Candidate CA rules are identified based on some theoretical criteria such as self-replication and information flow. An iterative algorithm is developed to generate the desired number of clusters over three stages. The results of the clustering are evaluated based on benchmark clustering metrics such as Silhouette score, Davis Bouldin, Calinski Harabasz and Dunn Index. In comparison with the existing state-of-the-art clustering algorithms, our proposed algorithm gives better performance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑