Sequential tree recognition method of sensitive data in energy big data center based on rule matching.

Sequential tree recognition method of sensitive data in energy big data center based on rule matching.

BIG data

big data center

DATABASES

DECISION trees

ENERGY security

multidimensional energy

ordered tree

RECOGNITION (Psychology)

recognition methods

Rule matching

sensitive data

SERVER farms (Computer network management)

WORD frequency

In this paper, the sequential tree recognition method of sensitive data in energy big data center based on rule matching is studied, to accurately identify sensitive data in energy big data center, and improve the operation security of energy big data center. The RETE rule matching algorithm is used to match the sensitive data rules of the energy big data center. The algorithm automatically finds the optimal rete topology, reduces the join intermediate node data, and realizes rule matching. The data cut points after rule matching are divided into balanced cutting points and unbalanced cutting points. The maximum sorting mutual information only exists at the unbalanced cut points. The ordered decision tree can be constructed by traversing the unbalanced cutting points. The data to be identified can be retrieved in the form of data flow to obtain the word frequency, regional information and sensitivity of sensitive words, and the sensitive data can be identified according to the sensitivity calculation results. The experimental results show that the proposed method can effectively identify the sensitive data of energy big data center with high recognition accuracy, and can be applied to the practical application of energy big data center. [ABSTRACT FROM AUTHOR]

101-112

1

44

Peng Chen

Dongge Zhu

Journal of Intelligent & Fuzzy Systems

2023

journalArticle

10641246

https://libproxy.lamar.edu/login?url=https://search.ebscohost.com/login.aspx?direct=true&

db=syh&

AN=161352125&

site=ehost-live