A data intelligent interactive processing system

Abstract

The present invention provides a data intelligent interactive processing system, which relates to the technical field of data interactive processing. The system comprises: a data acquisition module, which is used to acquire raw data and set corresponding labels according to each acquisition channel; an encryption module, which is used to identify the encryption level of the raw data according to the label, and encrypt the raw data according to the encryption level to obtain encrypted data; a decryption module, which is used to decrypt the encrypted data to obtain decrypted data; and a data analysis and processing module, which is used to pre-process the decrypted data and fill the missing values ​​in the decrypted data by using an optimized hippopotamus algorithm. The present invention uses random encryption and parrot encryption to encrypt the collected data, which effectively improves data security. Random encryption is more cost-effective and can effectively reduce encryption costs. Parrot encryption is more secure and can effectively prevent data leakage.

Description

Technical Field

[0001] The present invention relates to the technical field of data processing, and in particular to a data intelligent interactive processing system. Background Art

[0002] The data intelligent interactive processing system is a system that uses data collection, analysis and intelligent algorithm technology to support the interaction between users and data, aiming to achieve efficient decision-making, optimize business processes, and improve user experience. Such a system integrates multiple data sources, processes and analyzes data to provide intuitive information and insights, thereby supporting decision-making and actions in practical applications.

[0003] The existing intelligent data interactive processing system generally includes data acquisition module, data storage system, data processing and analysis module, user interaction interface and feedback and optimization module to realize data collection monitoring, storage and analysis processing. Although the existing data interactive processing system can play a vital role in the modern environment and help enterprises and organizations effectively cope with various challenges in the ever-changing market, there are still data quality problems, missing data, outliers and security issues. Summary of the invention

[0004] The present invention provides a data intelligent interactive processing system to solve the problems in the prior art of data leakage risk in the process of data interactive processing, resulting in low data transmission security, and low filling accuracy and low filling efficiency when processing missing data.

[0005] On the one hand, the present invention provides a data intelligent interactive processing system, including: a data acquisition module, used to collect raw data, and set corresponding labels according to each acquisition channel; an encryption module, used to identify the encryption level of the raw data according to the label, and encrypt the raw data according to the encryption level to obtain encrypted data; the encrypted data includes random encrypted data and parrot encrypted data; a data transmission module, used to upload the encrypted data to a server; a decryption module, used to decrypt the encrypted data to obtain decrypted data; a data analysis and processing module, used to pre-process the decrypted data, and use an optimized hippo algorithm to fill in the missing values ​​in the decrypted data.

[0006] According to a data intelligent interactive processing system provided by the present invention, the encryption method of the encryption module includes: querying and obtaining the corresponding encryption level in a pre-stored tag level comparison table according to the tag; the tag level comparison table is used to characterize the mapping relationship between the tag and the encryption level; the encryption level includes the first level, the second level, and the third level. For each encryption level, a corresponding encryption strategy is set, including: for the first level: no encryption; for the second level: encryption using a random position replacement method; for the third level: encryption using a parrot algorithm based on a preset parameter combination.

[0007] According to a data intelligent interactive processing system provided by the present invention, the random position replacement method includes: cutting the original data into multiple continuous fragments according to a preset sequence length; dividing each of the fragments into N windows; adding a random sequence to the fragments and setting a sequence label for the random sequence; reorganizing the N windows according to the random sequence to obtain random sequence fragments; adding the sequence label to each of the random sequence fragments to obtain random encrypted data.

[0008] According to a data intelligent interactive processing system provided by the present invention, the method of encrypting using the Parrot algorithm based on preset parameter combinations includes: obtaining a data set based on the original data and the encrypted data, and dividing the data set into a training set and a test set; constructing an encryption model based on the Parrot algorithm; taking the original data as input and the encrypted data as output, training the encryption model using the training set, and testing the encryption model using the test set, retaining multiple parameter combinations that meet the test accuracy; creating a combination label for each of the parameter combinations; adding the combination label to the original data, and substituting the parameter combination corresponding to the combination label into the encryption model, and outputting the Parrot encrypted data.

[0009] According to a data intelligent interactive processing system provided by the present invention, the method for generating encrypted data of the parrot includes: converting the original data into the individual position of the parrot, and the formula is expressed as:

[0010]

[0011] In the formula, u 0 is the initial position of the parrot individual, f is the imitation factor, P 0 To explore the lower bound of the space, P 1 To explore the upper bound of space;

[0012] The individual position of the parrot is updated according to the parrot's imitating behavior, and the formula is expressed as:

[0013]

[0014] In the formula, is the updated position of the parrot individual, Update the previous position for the parrot individual, is the simulated object position, and R is random noise.

[0015] According to a data intelligent interactive processing system provided by the present invention, the decryption module includes: a random decryption unit, which is used to decrypt the random encrypted data, including: identifying the sequence label of the random encrypted data; querying and obtaining the corresponding random sequence according to the sequence label; recombining the random sequence fragments according to the random sequence, so that the N windows in the random sequence fragments are restored to the original order to obtain decrypted data. A parrot decryption unit, which is used to decrypt the parrot encrypted data, includes: identifying the combination label of the parrot encrypted data; substituting the parameter combination corresponding to the combination label into the encryption model; inputting the parrot encrypted data into the encryption model for inverse solution to obtain decrypted data.

[0016] According to a data intelligent interactive processing system provided by the present invention, the data analysis and processing module includes: a preprocessing module, which is used to perform standardization processing on the decrypted data to obtain standardized data, and map the standardized data to a matrix diagram to screen out missing values ​​in the standardized data; a missing value filling module, which is used to identify the encryption level of the missing value, and fill the missing value with an optimized hippopotamus algorithm according to the encryption level; the filling strategy of the optimized hippopotamus algorithm includes: according to the position of the missing value, the first M normal values ​​and the last M normal values ​​of the missing value are respectively initialized as the individual position h of the male hippopotamus; fi ; For the first level of filling: use the exploration phase position update formula of the Hippo algorithm to fill the missing values, and obtain the first filling value; For the second level of filling: use the defense phase position update formula of the Hippo algorithm to fill the missing values, and obtain the second filling value; For the third level of filling: use the escape phase position update formula of the Hippo algorithm to fill the missing values, and obtain the third filling value.

[0017] According to a data intelligent interactive processing system provided by the present invention, the calculation method of the first filling value includes: defining the first filling value as y 1 , the first filling value is initialized to the position h that the male hippopotamus must pass through when exploring sc ; Generate the first male hippopotamus at the position of the first male hippopotamus individual; Generate the second male hippopotamus at the position of the last male hippopotamus individual; Use the male hippopotamus exploration update formula to update the position of the first male hippopotamus, so that the first male hippopotamus individual passes through the first M male hippopotamus individual positions in sequence, and continue to update the next position h of the first male hippopotamus fn1; Use the male hippopotamus exploration update formula to update the position of the second male hippopotamus, so that the second male hippopotamus passes through the positions of the last M male hippopotamus in reverse order, and continue to update the next position h of the second male hippopotamus fn2 ; Take h fn1 With h fn2 The midpoint of the male hippopotamus is the necessary location for exploration h sc , the male hippopotamus explores the necessary position h sc Perform a deinitialization operation to obtain a first padding value.

[0018] According to a data intelligent interactive processing system provided by the present invention, the calculation method of the second filling value includes: defining the second filling value as y 2 , initialize the second filling value to the Hippopotamus defense must pass position h dc ; Generate a first defense hippopotamus at the position of the first male hippopotamus individual; Generate a second defense hippopotamus at the position of the last male hippopotamus individual; Use the hippopotamus defense update formula to update the position of the first defense hippopotamus, so that the first defense hippopotamus individual passes through the first M male hippopotamus individual positions in sequence, and continue to update the next position h of the first male hippopotamus fd1 ; Use the hippopotamus defense update formula to update the position of the second defense hippopotamus, so that the second defense hippopotamus passes the positions of the last M male hippopotamus in reverse order, and continue to update the next position h of the second defense hippopotamus fd2 ; Take h fd1 With h fd2 The midpoint of the defense hippopotamus is the necessary position h dc , the defensive hippopotamus must pass through position h dc Perform a deinitialization operation to obtain a second padding value.

[0019] According to a data intelligent interactive processing system provided by the present invention, the calculation method of the third filling value includes: defining the third filling value as y 3 , the third filling value is initialized to the position h that the hippopotamus must pass through when escaping ec ; Generate the first escaped hippopotamus at the position of the first male hippopotamus individual; Generate the second escaped hippopotamus at the position of the last male hippopotamus individual; Use the hippopotamus escape update formula to update the position of the first escaped hippopotamus, so that the first escaped hippopotamus individual passes through the first M male hippopotamus individual positions in sequence, and continue to update the next position h of the first male hippopotamus fe1 ; Use the hippopotamus escape update formula to update the position of the second escaped hippopotamus, so that the second escaped hippopotamus passes through the positions of the last M male hippopotamus in reverse order, and continue to update the next position h of the second escaped hippopotamus fe2 ; Take h fe1 With h fe2The midpoint of the Hippopotamus is the necessary location to escape from the Hippopotamus. ec , the location h that the escaping hippopotamus must pass through ec A deinitialization operation is performed to obtain a third padding value.

[0020] The present invention provides a data intelligent interactive processing system, which uses random encryption and parrot encryption to encrypt collected data, effectively improving data security. Random encryption is more cost-effective and can effectively reduce encryption costs, while parrot encryption is more secure and can effectively prevent data leakage.

[0021] The present invention provides a data intelligent interactive processing system, which performs missing value filling processing on the decrypted data by optimizing the Hippo algorithm, and fills the missing values ​​of the data with different encryption levels using different update methods in the Hippo algorithm. The filling in the exploration phase can avoid the algorithm from falling into the local optimum through random search, enhance the diversity of solutions, make it more likely to find the global optimal solution, and more easily discover potential solutions, improve the overall search capability, and have better adaptability when processing data with complex structures and multimodality. The filling in the defense phase can avoid the abandonment of the good solutions found due to exploration through the defense mechanism, reduce the fluctuations in the optimization process, and protect the current solution to speed up the convergence process, and increase the algorithm's dependence on the found solution, improve the operating efficiency, and make small-scale adjustments around the best solution that has been found, so that the quality of the solution can be gradually improved on the basis of protection, and the accuracy of the final data filling can be enhanced. Filling in the escape stage, through the escape strategy, can avoid the algorithm from over-optimizing in a certain subspace, thereby reducing the overfitting problem of the algorithm. Escaping from the current solution can enable the algorithm to re-search for other potential optimal solutions and improve the ability to solve complex and multi-peak optimization problems. As the search process progresses, it can adaptively jump out of the local optimal solution area, thereby improving the ability to cope with dynamic environments and improving the accuracy of data filling. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] In order to more clearly illustrate the technical solutions in the present invention or the prior art, the following briefly introduces the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0023] Figure 1 is a structural diagram of a data intelligent interactive processing system provided by an embodiment of the present invention;

[0024] Figure 2 This is one of the flow charts of a data intelligent interactive processing system provided by an embodiment of the present invention;

[0025] Figure 3 This is the second flow chart of a data intelligent interactive processing system provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0026] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution of the present invention will be clearly and completely described below in conjunction with the drawings of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0027] Combine the following Figure 1-Figure 3 A data intelligent interactive processing system of the present invention is described.

[0028] Figure 1 It is a structural diagram of a data intelligent interactive processing system provided by an embodiment of the present invention.

[0029] like Figure 1 As shown, an embodiment of the present invention provides a data intelligent interactive processing system, including: a data acquisition module, an encryption module, a data transmission module, a decryption module, and a data analysis and processing module.

[0030] The data acquisition module is used to collect raw data and set corresponding labels according to each acquisition channel. The data acquisition module can include a variety of sensors, signal collectors, image acquisition devices, etc. For example, for the collection of network data, including the collection of performance data and flow data of network equipment, you can select temperature sensors, switches, network probes, etc. to collect temperature data, flow data and network data packets of network equipment respectively. When collecting data, the raw data is labeled through the data acquisition module. For example, a public label is set for the temperature data transmitted by the temperature sensor, a low-level confidentiality label is set for the flow data transmitted by the switch, and a high-level confidentiality label is set for the network data packet transmitted by the network probe. Each label corresponds to a different encryption level and has different levels of security during data transmission.

[0031] The encryption module is used to identify the encryption level of the original data according to the tag, and encrypt the original data according to the encryption level to obtain encrypted data. The encryption level includes the first level, the second level, and the third level. The encrypted data includes random encrypted data and parrot encrypted data.

[0032] The encryption methods of the encryption module include:

[0033] According to the tag, the corresponding encryption level is queried and obtained in the pre-stored tag level comparison table. The tag level comparison table is used to characterize the mapping relationship between the tag and the encryption level. In this embodiment, corresponding tags are set for different encryption levels. For example, for the original data of the first level, a tag starting with A is added, and the second field is used as the original data identification code. For example, an Aa tag is added to the temperature data transmitted by the temperature sensor, an Ab tag is added to the humidity data, a Ba tag is added to the network traffic data transmitted by the switch, and a Ca tag is added to the network data packet. When the encryption module recognizes the tag, the level corresponding to the tag can be queried in the tag level comparison table, and then different encryption strategies can be selected.

[0034] Set the corresponding encryption policy for each encryption level, including:

[0035] For the first level: no encryption. The data corresponding to the first level is public data, and encryption method can be set without setting it to reduce the cost of data interaction processing.

[0036] For the second level: random position replacement is used for encryption. Random position replacement is a basic encryption method and has a certain risk of leakage. However, its cracking cost is higher than the cost of data leakage. Even if data leakage occurs, the loss caused is relatively low. The encryption cost of random position replacement is relatively low, and it has a very high cost-effectiveness when protecting low-level confidential data.

[0037] Figure 2 This is one of the flow charts of a data intelligent interactive processing system provided by an embodiment of the present invention. Figure 2 As shown, specifically, the random position replacement method includes:

[0038] The original data is cut into multiple continuous segments according to a preset sequence length. For example, for signal wave data, the data can be cut according to a preset time length, such as every 30 seconds.

[0039] Each segment is divided into N windows. In a continuous segment of 30 seconds, it can also be evenly divided into multiple time windows, for example, divided into 30 windows with a length of 1 second.

[0040] Add random sequences to the fragments and set sequence labels for the random sequences. Randomly distribute the numbers 1 to 30, select Q groups from them and set sequence labels for them respectively. For example, select 20 random sequences and represent them respectively with specific symbols, including Greek letters, English letters, etc.

[0041] The N windows are reorganized according to the random sequence to obtain random sequence segments. The length of the reorganized random sequence segments is still 30 seconds, but there is a big difference with the original data.

[0042] Add a sequence tag to each random sequence fragment to obtain random encrypted data. After adding the sequence tag, the scrambled order can be identified by the tag, and the original data can be quickly restored by reorganizing according to the random sequence. Signal wave data is at risk of being cracked. In actual transmission, the signal wave data can be converted into a digital signal to reduce the risk of being cracked. Even if the encrypted random encrypted data is leaked, it cannot be cracked if the original random sequence is unknown.

[0043] For the third level: the Parrot algorithm based on the preset parameter combination is used for encryption. Compared with the random position replacement method, the Parrot algorithm encryption process is more complicated, the encryption cost is relatively higher, the confidentiality is relatively higher, and it is safer for high-level encrypted data.

[0044] Figure 3 This is the second flow chart of a data intelligent interactive processing system provided by an embodiment of the present invention. Figure 3 As shown, the encryption method using the Parrot algorithm based on preset parameters includes:

[0045] Obtain a data set based on the original data and the encrypted data, and divide the data set into a training set and a test set. Using the encryption method of the Parrot algorithm, a connection can be established between two completely different forms of data, that is, the original data and the encrypted data are completely unrelated, and the probability of being cracked is reduced to a minimum.

[0046] Build an encryption model based on the Parrot algorithm.

[0047] The original data is used as input and the encrypted data is used as output. The encryption model is trained with the training set and tested with the test set, retaining multiple parameter combinations that meet the test accuracy. By setting a variety of different parameter combinations, even if the encrypted data is leaked and still decrypted according to the Parrot algorithm, the results obtained are different due to different parameter combinations. Therefore, the probability of encrypted data being cracked is lower and more secure.

[0048] Create combination labels for each parameter combination.

[0049] Add a combination label to the original data, substitute the parameter combination corresponding to the combination label into the encryption model, and output the Parrot encrypted data. Similar to the random position replacement method, in the identification of parameter combinations, label identification is still used to obtain the corresponding parameter combination.

[0050] Specifically, the method for generating Parrot encrypted data includes:

[0051] The formula for converting the raw data into the individual position of the parrot is:

[0052]

[0053] In the formula, u 0 is the initial position of the parrot individual, f is the imitation factor, P 0 To explore the lower bound of the space, P 1 To explore the upper bound of space.

[0054] According to the parrot's imitation behavior, the individual position of the parrot is updated, and the formula is expressed as:

[0055]

[0056] In the formula, is the updated position of the parrot individual, Update the previous position for the parrot individual, is the simulated object position, and R is random noise.

[0057] The data transmission module is used to upload the encrypted data to the server. In this embodiment, the data intelligent interactive processing system may include a front end, a server and a terminal. The front end includes a data acquisition module, an encryption module and a data transmission module. The server includes a decryption module and a data analysis and processing module, and the terminal is used to receive the processed data and can send control instructions to the server.

[0058] The decryption module is used to decrypt the encrypted data to obtain the decrypted data. The decryption module includes: a random decryption unit and a parrot decryption unit.

[0059] The random decryption unit is used to decrypt the random encrypted data, including: identifying the sequence tag of the random encrypted data. Querying and obtaining the corresponding random sequence according to the sequence tag. Recombining the random sequence fragments according to the random sequence, so that the N windows in the random sequence fragments are restored to the original order, and the decrypted data is obtained. The decryption method is the reverse operation process of the encryption method. However, when the corresponding relationship between the random sequence and the sequence tag is not known, decryption cannot be performed, which effectively improves data security.

[0060] The parrot decryption unit is used to decrypt the parrot encrypted data, including: identifying the combination label of the parrot encrypted data. Substituting the parameter combination corresponding to the combination label into the encryption model. Inputting the parrot encrypted data into the encryption model for inverse solution to obtain the decrypted data. Similar to the random decryption unit, the parrot decryption unit is also an inverse operation of the parrot encrypted data. However, even with a known parrot algorithm, when the parameter combination is unknown or the parrot encrypted data is unknown, data cannot be cracked, and security is higher.

[0061] The data analysis and processing module is used to pre-process the decrypted data and use the optimized Hippo algorithm to fill in the missing values ​​in the decrypted data.

[0062] The data analysis and processing modules include:

[0063] The preprocessing module is used to standardize the decrypted data to obtain standardized data, and map the standardized data to a matrix diagram to filter out missing values ​​in the standardized data. After the standardized data is mapped to the matrix diagram, the missing values ​​can be quickly found.

[0064] The missing value filling module is used to identify the encryption level of missing values, and fill the missing values ​​using the optimized Hippo algorithm according to the encryption level. The filling strategies of the optimized Hippo algorithm include:

[0065] According to the position of the missing value, the first M normal values ​​and the last M normal values ​​of the missing value are initialized as the individual position h of the male hippopotamus. fi .

[0066] The initialization process is expressed as:

[0067]

[0068] In the formula, h min is the lower limit of the decision variable, h max is the upper limit of the decision variable, r 1 is a random number, ranging from 0 to 1.

[0069] For the first level of filling: the missing values ​​are filled using the position update formula in the exploration phase of the Hippo algorithm to obtain the first filling value.

[0070] The calculation method of the first filling value includes:

[0071] Define the first fill value as y 1 , initialize the first filling value to the position h that the male hippopotamus must pass through when exploring sc .

[0072] The first male hippopotamus is generated at the position of the first male hippopotamus individual. The second male hippopotamus is generated at the position of the last male hippopotamus individual.

[0073] The male hippopotamus exploration update formula is used to update the position of the first male hippopotamus, so that the first male hippopotamus individual passes through the positions of the first M male hippopotamus individuals in sequence, and continues to update the next position h of the first male hippopotamus fn1 .

[0074] The male hippopotamus exploration update formula is used to update the position of the second male hippopotamus, so that the second male hippopotamus passes through the positions of the last M male hippopotamus in reverse order, and continues to update the next position h of the second male hippopotamus. fn2 .

[0075] The Hippo exploration update formula is expressed as:

[0076]

[0077] In the formula, Updated position for male hippopotamus individuals, Update the previous position for the male hippopotamus individual, To explore the decision variables, is a random integer, either 1 or 2.

[0078] Take h fn1 With h fn2 The midpoint of the male hippopotamus is the necessary location for exploration h sc , the male hippopotamus explores the necessary locations h sc Perform a deinitialization operation to obtain a first padding value.

[0079] For the second level of filling: the missing values ​​are filled using the defense phase position update formula of the Hippo algorithm to obtain the second filling value.

[0080] The calculation method of the second padding value includes:

[0081] Define the second fill value as y 2 , initialize the second filling value to the Hippo defense must pass position h dc .

[0082] The first defense hippopotamus is generated at the location of the first male hippopotamus individual. The second defense hippopotamus is generated at the location of the last male hippopotamus individual.

[0083] The hippopotamus defense update formula is used to update the position of the first defense hippopotamus, so that the first defense hippopotamus individual passes through the positions of the first M male hippopotamus individuals in sequence, and continues to update the next position h of the first male hippopotamus fd1 The Hippo defense update formula is expressed as:

[0084]

[0085] In the formula, The updated position of the male hippopotamus in defensive mode. is the position of the male hippopotamus before defensive updating, r 2 is a random number, with a value of [0,1]. is the upper limit of the defense decision variable, is the lower bound of the defense decision variable.

[0086] The hippopotamus defense update formula is used to update the position of the second defense hippopotamus, so that the second defense hippopotamus passes through the positions of the last M male hippopotamus in reverse order, and continues to update the next position h of the second defense hippopotamus. fd2 .

[0087] Take hfd1 With h fd2 The midpoint of the defense hippopotamus is the necessary position h dc , to defend the hippopotamus must pass position h dc Perform a deinitialization operation to obtain a second padding value.

[0088] For the third level of filling: the missing values ​​are filled using the position update formula of the escape phase of the Hippo algorithm to obtain the third filling value.

[0089] The calculation method of the third padding value includes:

[0090] Define the third fill value as y 3 , initialize the third filling value to the position h that the hippopotamus must pass through when escaping ec .

[0091] The first escaped hippopotamus is generated at the location of the first male hippopotamus individual. The second escaped hippopotamus is generated at the location of the last male hippopotamus individual.

[0092] The hippopotamus escape update formula is used to update the position of the first escaped hippopotamus, so that the first escaped hippopotamus individual passes through the positions of the first M male hippopotamus individuals in sequence, and continues to update the next position h of the first male hippopotamus fe1 The hippopotamus escape update formula is expressed as:

[0093]

[0094] In the formula, The position of the male hippopotamus after the escape update. is the position of the male hippopotamus before the escape update, r 3 is a random number, with a value of [0,1]. is the upper limit of the defense decision variable, To defend the lower limit of the decision variable, θ is a random number, which takes the value of [0,1] or [1,2] or a random number that conforms to the normal distribution.

[0095] The hippopotamus escape update formula is used to update the position of the second escaped hippopotamus, so that the second escaped hippopotamus passes through the positions of the last M male hippopotamus in reverse order, and continues to update the next position h of the second escaped hippopotamus. fe2 .

[0096] Take h fe1 With h fe2 The midpoint of the Hippopotamus is the necessary location to escape from the Hippopotamus. ec , the location h that must be passed to escape from the hippopotamus ec A deinitialization operation is performed to obtain a third padding value.

[0097] The data intelligent interactive processing system provided in this embodiment uses random encryption and parrot encryption to encrypt the collected data, effectively improving data security. Random encryption is more cost-effective and can effectively reduce encryption costs. Parrot encryption is more secure and can effectively prevent data leakage. In addition, the missing value filling process is performed on the decrypted data by optimizing the Hippo algorithm. Different update methods in the Hippo algorithm are used to fill in data of different encryption levels. Among them, the filling in the exploration stage can avoid the algorithm from falling into the local optimum through random search, enhance the diversity of solutions, make it more likely to find the global optimal solution, and more easily discover potential solutions. The overall search ability is improved, and it has better adaptability when processing data with complex structures and multimodalities. The filling in the defense stage can avoid the abandonment of the good solutions found due to exploration through the defense mechanism, reduce the fluctuations in the optimization process, and protect the current solution to speed up the convergence process, and increase the algorithm's dependence on the found solution, improve the operating efficiency, and make small adjustments around the best solution that has been found. The quality of the solution can be gradually improved on the basis of protection, and the accuracy of the final data filling can be enhanced. Filling in the escape stage, through the escape strategy, can avoid the algorithm from over-optimizing in a certain subspace, thereby reducing the overfitting problem of the algorithm. Escaping from the current solution can enable the algorithm to re-search for other potential optimal solutions and improve the ability to solve complex and multi-peak optimization problems. As the search process progresses, it can adaptively jump out of the local optimal solution area, thereby improving the ability to cope with dynamic environments and improving the accuracy of data filling.

[0098] Through the description of the above implementation methods, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus a necessary general hardware platform, and of course, can also be implemented by hardware. Based on this understanding, the above technical solution is essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.

[0099] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A data intelligent interactive processing system, characterized in that: include: The data acquisition module is used to collect raw data and set corresponding labels according to each acquisition channel; An encryption module, used for identifying the encryption level of the original data according to the tag, and encrypting the original data according to the encryption level to obtain encrypted data; the encrypted data includes random encrypted data and parrot encrypted data; The encryption method of the encryption module includes: According to the label, query and obtain the corresponding encryption level in the pre-stored label level comparison table; the label level comparison table is used to characterize the mapping relationship between the label and the encryption level; the encryption level includes the first level, the second level, and the third level; For each encryption level, a corresponding encryption strategy is set, including: For the first level: no encryption; For the second level: encryption is performed using a random position replacement method; the random position replacement method includes: Cutting the original data into a plurality of continuous segments according to a preset sequence length; Dividing each of the segments into N windows; adding a random sequence to the fragment, and setting a sequence tag for the random sequence; Rearrange the N windows according to the random sequence to obtain random sequence fragments; Adding the sequence tag to each of the random sequence fragments to obtain random encrypted data; For the third level: using the Parrot algorithm based on a preset parameter combination for encryption; the method of using the Parrot algorithm based on a preset parameter combination for encryption includes: Acquire a data set based on the original data and the encrypted data, and divide the data set into a training set and a test set; Construct an encryption model based on the Parrot algorithm; Taking the original data as input and the encrypted data as output, training the encryption model with the training set, and testing the encryption model with the test set, retaining multiple parameter combinations that meet the test accuracy; Creating a combination label for each of the parameter combinations; Add the combination tag to the original data, substitute the parameter combination corresponding to the combination tag into the encryption model, and output the parrot encrypted data; A data transmission module, used for uploading the encrypted data to a server; A decryption module, used for decrypting the encrypted data to obtain decrypted data; A data analysis and processing module, used to pre-process the decrypted data and fill in the missing values ​​in the decrypted data using an optimized Hippo algorithm; The data analysis and processing module includes: a missing value filling module, which is used to identify the encryption level of the missing value, and according to the encryption level, use the optimized hippopotamus algorithm to fill the missing value; the filling strategy of the optimized hippopotamus algorithm includes: according to the position of the missing value, the first M normal values ​​and the last M normal values ​​of the missing value are respectively initialized as the individual position h of the male hippopotamus; fi ; Use the position update formula of the optimized Hippo algorithm to fill in the missing values.

2. A data intelligent interactive processing system according to claim 1, characterized in that: The method for generating the parrot encrypted data comprises: The raw data is converted into the individual position of the parrot, and the formula is expressed as: Where u0 is the initial position of the parrot individual, f is the imitation factor, P0 is the lower bound of the exploration space, and P1 is the upper bound of the exploration space; The individual position of the parrot is updated according to the parrot's imitation behavior, and the formula is expressed as: In the formula, is the updated position of the parrot individual, Update the previous position for the parrot individual, is the simulated object position, and R is random noise.

3. The data intelligent interactive processing system according to claim 1, characterized in that: The decryption module comprises: A random decryption unit, used to decrypt the random encrypted data, including: identifying a sequence tag of the random encrypted data; querying and acquiring a corresponding random sequence according to the sequence tag; recombining the random sequence fragments according to the random sequence, so that the N windows in the random sequence fragments are restored to their original order, and obtaining decrypted data; The parrot decryption unit is used to decrypt the parrot encrypted data, including: identifying the combination label of the parrot encrypted data; substituting the parameter combination corresponding to the combination label into the encryption model; inputting the parrot encrypted data into the encryption model for inverse solution to obtain decrypted data.

4. The data intelligent interactive processing system according to claim 1, characterized in that: The data analysis and processing module comprises: The preprocessing module is used to perform standardization processing on the decrypted data to obtain standardized data, and map the standardized data to a matrix diagram to filter out missing values ​​in the standardized data.

5. The data intelligent interactive processing system according to claim 1, characterized in that: The position update formula of the optimized Hippo algorithm is used to fill the missing values, including: For the first level of filling: the missing values ​​are filled using the exploration phase position update formula of the Hippo algorithm to obtain the first filling value; For the second level of filling: the missing value is filled using the defense phase position update formula of the Hippo algorithm to obtain a second filling value; For the third level of filling: the missing values ​​are filled using the escape phase position update formula of the Hippo algorithm to obtain the third filling value.

6. A data intelligent interactive processing system according to claim 5, characterized in that: The calculation method of the first padding value includes: Define the first filling value as y1, and initialize the first filling value to the position h that the male hippopotamus must pass through when exploring sc ; Generate the first male hippopotamus at the position of the first male hippopotamus individual; Generate the second male hippopotamus at the position of the last male hippopotamus individual; The male hippopotamus exploration update formula is used to update the position of the first male hippopotamus, so that the first male hippopotamus individual passes through the positions of the first M male hippopotamus individuals in sequence, and continues to update the next position h of the first male hippopotamus fn1 ; The male hippopotamus exploration update formula is used to update the position of the second male hippopotamus, so that the second male hippopotamus passes through the positions of the last M male hippopotamus in reverse order, and continues to update the next position h of the second male hippopotamus fn2 ; Take h fn1 With h fn2 The midpoint of the male hippopotamus is the necessary location for exploration h sc , the male hippopotamus explores the necessary position h sc Perform a deinitialization operation to obtain a first padding value.

7. The data intelligent interactive processing system according to claim 6, characterized in that: The calculation method of the second padding value includes: Define the second filling value y2, and initialize the second filling value to the position h that the hippopotamus must pass through for defense dc ; Generate the first defensive hippopotamus at the position of the first male hippopotamus individual; Generate the second defensive hippopotamus at the position of the last male hippopotamus individual; The hippopotamus defense update formula is used to update the position of the first defense hippopotamus, so that the first defense hippopotamus individual passes through the first M male hippopotamus individual positions in sequence, and continues to update the next position h of the first male hippopotamus fd1 ; The hippopotamus defense update formula is used to update the position of the second defense hippopotamus, so that the second defense hippopotamus passes the positions of the last M male hippopotamus in reverse order, and continues to update the next position h of the second defense hippopotamus. fd2 ; Take h fd1 With h fd2 The midpoint of the defensive hippopotamus is the necessary position h dc , the defense hippopotamus must pass through the position h dc Perform a deinitialization operation to obtain a second padding value.

8. The data intelligent interactive processing system according to claim 6, characterized in that: The calculation method of the third padding value includes: Define the third filling value y3, and initialize the third filling value to the position h that the hippopotamus must pass through when escaping ec ; Generate the first escaped hippopotamus at the location of the first male hippopotamus individual; Generate the second escaped hippopotamus at the location of the last male hippopotamus individual; The position of the first escaped hippopotamus is updated by using the hippopotamus escape update formula, so that the first escaped hippopotamus individual passes through the positions of the first M male hippopotamus individuals in sequence, and the next position h of the first male hippopotamus is continuously updated. fe1 ; The position of the second escaped hippopotamus is updated by using the hippopotamus escape update formula, so that the second escaped hippopotamus passes the positions of the last M male hippopotamus in reverse order, and continues to update the next position h of the second escaped hippopotamus. fe2 ; Take h fe1 With h fe2 The midpoint of the Hippopotamus is the necessary location to escape from the Hippopotamus. ec , the location h that the escaping hippopotamus must pass through ec A deinitialization operation is performed to obtain a third padding value.

Images