首页|基于改进关联规则的交互式元数据快速聚类方法

基于改进关联规则的交互式元数据快速聚类方法

扫码查看
针对交互式元数据样本分布不均、聚类时间较长、离群点检测效果不佳的问题,提出基于改进关联规则的交互式元数据快速聚类方法.将交互式元数据划分为多个数据片,形成元数据分布式处理框架,根据待聚类数据对象的标识和定位信息建立数据网格索引机制,采用布尔矩阵和内积运算算法取代基础关联规则的编码方式和运算方法,定义分类算法所需的值函数,将特征点排列方式换变为按数据维度排序,获取改进关联规则,结合模糊均值算法和拉格朗 日乘数法完成交互式元数据快速聚类.实验结果表明,比较原先的方法,所提出方法的聚类运行时间减少了 81.27%、79.03%,有效提升了元数据聚类效率.
Interactive Metadata Fast Clustering Method Based on Improved Association Rules
Aiming at the problems of uneven distribution of interactive metadata samples,long clustering time and poor detec-tion effect of outliers,an interactive metadata fast clustering method based on improved association rules is proposed.The in-teractive metadata are divided into multiple data slices to form a metadata distributed processing framework.According to the i-dentification and positioning information of the data object to be clustered,the data grid index mechanism is established.The Boolean matrix and inner product algorithm are used to replace the coding method and operation method of the basic association rules,define the value function required by the classification algorithm,change the arrangement mode of feature points into sor-ting by data dimension,and obtain improved association rules.Combined with fuzzy mean algorithm and Lagrange multiplier method to achieve interactive metadata fast clustering.The experimental results show that compocred with the original meth-ods,the clustering running times of the proposed method are reduced by 81.27%and 79.03%,which effectively improves the efficiency of metadata clustering.

improved association ruleBoolean matrixdata clusteringinteractivemetadata

张全明、王猛、薛亚波

展开 >

包神铁路集团机务分公司,陕西,神木 719300

安徽安为科技有限公司,安徽,合肥 230000

改进关联规则 布尔矩阵 数据聚类 交互式 元数据

2024

微型电脑应用
上海市微型电脑应用学会

微型电脑应用

CSTPCD
影响因子:0.359
ISSN:1007-757X
年,卷(期):2024.40(3)
  • 15