arrow
返回

Association rules redundancy processing algorithm based on hypergraph in data mining

delete2018-01-22
delete10
PRE
AI
M
Maozhu Jin
H
Hua Wang
Q
Qian Zhang *
DOI:10.1007/s10586-017-1632-7delete
delete原文链接
delete分享
delete收藏
摘要

摘要

En 中文
In order to achieve the research from individual data to data system and from passive verification of data to active discovery, taking high dimensional data oriented data mining technology as the research object, an association rule redundancy processing algorithm based on hypergraph in data mining technology is studied according to the project requirements. The concepts of hypergraph and system are introduced to explore the construction of hypergraph on 3D matrix model. In view of the characteristics of big data, a new method of super edge definition is adopted, which improves the ability of dealing with problems. In the association rules redundancy and loop detection based on directed hypergraph, the association rules are transformed into directed hypergraph, and the adjacency matrix is redefined. The detection of redundancy and loop is transformed into the processing of connected blocks and circles in hypergraph, which provides a new idea and method for the redundant processing of association rules. The new method is applied to the data processing of practical projects. The experimental results show that the 3D matrix mathematical model and related data mining algorithms in this paper can find new high-quality knowledge from high-dimensional data.
Keyword:
Data mining
Hypergraph
Association rules
Redundant processing
Smart economy
Business intelligence
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Cluster Computing-The Journal of Networks Software Tools and Applications
IF:
4.1
论文数:
5.1K
被引数:
7.5K

机构

S
sichuan university
学者数:
12.1W
论文数: 7.8W
被引数: 100
引用论文

引用论文

err分享
err收藏
err分享
err收藏
err分享
err收藏
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
err分享
err收藏
学者 查看更多内容