arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.03387stat.MLcs.AIcs.LG
收藏

学习顺序森林用于定性-属性数据聚类

Learning Order Forest for Qualitative-Attribute Data Clustering

School of Computer Science and Technology, Guangdong University of Technology, Guangzhou, China(计算机科学与技术学院,广东工业大学,广州,中国);Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ), Shenzhen, China(人工智能与数字经济广东实验室(深圳));School of Computer Science and Software Engineering, Shenzhen University, Shenzhen, China(计算机科学与软件工程学院,深圳大学,深圳,中国);Fujian Key Laboratory of Sensing and Computing for Smart City, School of Informatics, Xiamen University, China(智能城市感知与计算福建省重点实验室,厦门大学信息学院,中国);Key Laboratory of Multimedia Trusted Perception and Efficient Computing, Ministry of Education of China, Xiamen University, China(多媒体可信感知与高效计算重点实验室,中华人民共和国教育部,厦门大学,中国);Department of Computer Science, Hong Kong Baptist University, Hong Kong, China(计算机科学系,香港 Baptist 大学,香港,中国)

Mingjie Zhao, Sen Feng, Yiqun Zhang, Mengke Li, Yang Lu, Yiu-ming Cheung

AI总结:

本文提出学习顺序森林方法,通过树状结构捕捉定性属性间的局部顺序关系,以提高聚类任务的准确性。

摘要:

聚类是理解数据模式的基本方法,其中直观的欧几里得距离空间通常被采用。然而,对于隐含的聚类分布,如症状、婚姻状况等属性的名义值,这并不适用。因此,本文发现了一种树状的距离结构,以灵活地表示属性内定性值之间的局部顺序关系。也就是说,将一个值视为树的顶点,可以捕捉顶点值与其他值之间的丰富顺序关系。为了以聚类友好的形式获得这些树,提出了一种联合学习机制,以迭代地获得更合适的树结构和聚类。结果表明,整个数据集的潜在距离空间可以很好地由由学习到的树组成的森林表示。广泛的实验表明,联合学习使森林适应聚类任务,以获得准确的结果。在12个真实基准数据集上对10个对手的比较以及显著性检验验证了所提出方法的优越性。

英文摘要:

Clustering is a fundamental approach to understanding data patterns, wherein the intuitive Euclidean distance space is commonly adopted. However, this is not the case for implicit cluster distributions reflected by qualitative attribute values, e.g., the nominal values of attributes like symptoms, marital status, etc. This paper, therefore, discovered a tree-like distance structure to flexibly represent the local order relationship among intra-attribute qualitative values. That is, treating a value as the vertex of the tree allows to capture rich order relationships among the vertex value and the others. To obtain the trees in a clustering-friendly form, a joint learning mechanism is proposed to iteratively obtain more appropriate tree structures and clusters. It turns out that the latent distance space of the whole dataset can be well-represented by a forest consisting of the learned trees. Extensive experiments demonstrate that the joint learning adapts the forest to the clustering task to yield accurate results. Comparisons of 10 counterparts on 12 real benchmark datasets with significance tests verify the superiority of the proposed method.

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

↑