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

利用可逆二元元胞自动机对高维数据进行层次聚类

Hierarchical Clustering using Reversible Binary Cellular Automata for High-Dimensional Data

National Institute of Technology, Tiruchirappalli(蒂鲁奇拉帕利国家理工学院)

Baby C. J., Kamalika Bhattacharjee

AI总结:

提出一种基于可逆有限元胞自动机循环空间的高维数据层次聚类算法,通过循环中位数合并、规则选择和频率编码,在基准数据集上达到与二次时间复杂度现有算法相当的性能。

摘要:

本工作提出了一种用于高维数据集的层次聚类算法,该算法利用可逆有限元胞自动机的循环空间。在基于元胞自动机(CA)的聚类中,如果两个对象属于同一个循环,则它们密切相关,并被视为同一簇的一部分。然而,如果使用一个CA的循环对高维数据集进行聚类,密切相关的对象可能属于不同的循环。本文基于每个循环中所有元素的中位数来识别两个不同循环中对象之间的关系,以便它们能够在下一阶段被分组。此外,为了最小化中间簇的数量,从而降低计算成本,采用了一种规则选择策略,基于信息传播和循环结构来寻找最佳规则。在使用基于频率的编码对数据集进行编码,使连续数据元素在编码形式中保持最小汉明距离后,我们提出的聚类算法在三个阶段之间迭代,最终将数据元素聚类为用户给定的期望簇数。该算法可应用于医疗保健、体育、化学研究、农业等多个领域。在标准基准数据集上使用各种性能指标进行验证时,我们的算法与现有的具有二次时间复杂度的算法相当。

英文摘要:

This work proposes a hierarchical clustering algorithm for high-dimensional datasets using the cyclic space of reversible finite cellular automata. In cellular automaton (CA) based clustering, if two objects belong to the same cycle, they are closely related and considered as part of the same cluster. However, if a high-dimensional dataset is clustered using the cycles of one CA, closely related objects may belong to different cycles. This paper identifies the relationship between objects in two different cycles based on the median of all elements in each cycle so that they can be grouped in the next stage. Further, to minimize the number of intermediate clusters which in turn reduces the computational cost, a rule selection strategy is taken to find the best rules based on information propagation and cycle structure. After encoding the dataset using frequency-based encoding such that the consecutive data elements maintain a minimum hamming distance in encoded form, our proposed clustering algorithm iterates over three stages to finally cluster the data elements into the desired number of clusters given by user. This algorithm can be applied to various fields, including healthcare, sports, chemical research, agriculture, etc. When verified over standard benchmark datasets with various performance metrics, our algorithm is at par with the existing algorithms with quadratic time complexity.

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

↑