Association rules redundancy processing algorithm based on hypergraph in data mining

Maozhu Jin

doi:10.1007/s10586-017-1632-7

Return

Association rules redundancy processing algorithm based on hypergraph in data mining

2018-01-22

PRE

Maozhu Jin

Hua Wang

Qian Zhang *

DOI：10.1007/s10586-017-1632-7

Original

Original request for help

Save

Abstract

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.

Keywords:

Data mining

Hypergraph

Association rules

Redundant processing

Smart economy

Business intelligence