通过学习类别值顺序关系,提升分类数据聚类效果
Categorical Data Clustering via Value Order Estimated Distance Metric Learning
- 基于聚类联合学习类别值的最优顺序关系
- 在混合数据集上达到更高聚类准确率
- 让难以理解的分类数据变得直观易管理
聚类是数据挖掘中常用的技术,可自动揭示样本分布模式。由于分类数据天然缺乏如数值数据般的欧氏距离空间,其分布常被低估,导致有价值信息在聚类中失真。本文提出一种新的顺序距离度量学习方法,通过学习类别属性值的最优顺序关系,将其在类似数值属性的直线上量化距离。由于主观创建的分类值存在模糊性,该顺序距离度量在聚类上下文中学习,构建了交替进行聚类与顺序距离学习的新联合学习范式,具有低时间复杂度和收敛性保证。由于聚类友好的顺序学习机制及顺序距离与欧氏距离的同质性,所提方法在分类和混合数据集上实现更优聚类精度。更重要的是,学习到的顺序距离度量显著降低理解与管理非直观分类数据的难度。消融实验、显著性检验、案例研究等验证了方法有效性。源代码见:https://github.com/DAJ0612/OCL_Source_Code。
原文摘要 · Abstract (English)
Clustering is a popular machine learning technique for data mining that can process and analyze datasets to automatically reveal sample distribution patterns. Since the ubiquitous categorical data naturally lack a well-defined metric space such as the Euclidean distance space of numerical data, the distribution of categorical data is usually under-represented, and thus valuable information can be easily twisted in clustering. This paper, therefore, introduces a novel order distance metric learning approach to intuitively represent categorical attribute values by learning their optimal order relationship and quantifying their distance in a line similar to that of the numerical attributes. Since subjectively created qualitative categorical values involve ambiguity and fuzziness, the order distance metric is learned in the context of clustering. Accordingly, a new joint learning paradigm is developed to alternatively perform clustering and order distance metric learning with low time complexity and a guarantee of convergence. Due to the clustering-friendly order learning mechanism and the homogeneous ordinal nature of the order distance and Euclidean distance, the proposed method achieves superior clustering accuracy on categorical and mixed datasets. More importantly, the learned order distance metric greatly reduces the difficulty of understanding and managing the non-intuitive categorical data. Experiments with ablation studies, significance tests, case studies, etc., have validated the efficacy of the proposed method. The source code is available at https://github.com/DAJ0612/OCL_Source_Code.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。