A method and device for completing power sensing data based on nonlinear Tucker decomposition coupling

The power sensing data tensor and latent feature matrix are constructed by the nonlinear Tucker decomposition coupling method, which solves the problem of time series dynamics not being considered in power sensing data completion and achieves high-precision data completion effect.

CN119474696BActive Publication Date: 2025-09-26DONGGUAN UNIV OF TECH
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202411606546.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-11-12
Publication Date
2025-09-26
Estimated Expiration
2044-11-12

AI Technical Summary

Technical Problem

Existing technologies fail to effectively consider the temporal dynamics and time dependence of data in power sensing data completion, resulting in low accuracy of completion results.

Method used

A method based on nonlinear Tucker decomposition coupling is adopted to construct the power sensing data tensor. The core tensor and latent feature matrix are constructed through the nonlinear Tucker decomposition coupling model. The target loss function is defined and iterative optimization is performed. The data completion value is updated using the non-negative stochastic gradient descent rule.

Benefits of technology

The accuracy and precision of power sensing data completion are improved, and the data completion value can be dynamically adjusted. It is suitable for processing the problem of missing dynamic power sensing data containing time series information.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119474696B_ABST
    Figure CN119474696B_ABST
Patent Text Reader

Abstract

The present application discloses a method and device for completing power sensing data based on nonlinear Tucker decomposition coupling, the method comprising: receiving a completion instruction for power sensing data; collecting historical power sensing data based on the completion instruction; constructing a power sensing data tensor based on the collected historical power sensing data; performing nonlinear Tucker decomposition coupling on the historical power sensing data to construct a power sensing data core tensor and a latent feature matrix; constructing a target loss function based on the power sensing data tensor, the power sensing data core tensor, and the latent feature matrix and performing iterative optimization, and completing the power sensing data based on the iteratively optimized target loss function to obtain a power sensing data completion value. The present invention is used to process power sensing data and can perform high-precision data completion based on statistical laws to solve the problem of missing dynamic power sensing data containing time series information.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of power sensing data completion, and in particular to a power sensing data completion method based on nonlinear Tucker decomposition coupling Background Art

[0002] As the digitalization and intelligentization of power systems continue to advance, large amounts of power sensing data are collected in real time from various sensors and smart devices. This data is used to monitor power system operating status, detect anomalies, and optimize scheduling decisions. However, in practical applications, missing data often occurs due to sensor failures, communication delays, data loss, and other factors. Missing data not only affects the system's accurate assessment of the current state but also reduces the reliability of prediction models and optimization algorithms. Therefore, how to effectively complete power sensing data has become a key issue in ensuring the safe and stable operation of power systems.

[0003] Currently, many researchers have proposed models based on matrix decomposition to address the problem of power sensing data completion. These models typically construct historical power sensing data into a static two-dimensional matrix and decompose this matrix to predict and complete missing data. However, these methods often ignore the dynamic characteristics and time dependence of power sensing data. Power sensing data typically changes over time and is influenced by various factors such as the external environment, load fluctuations, and device status, exhibiting significant temporal characteristics and complex nonlinear characteristics. Traditional matrix decomposition methods simplify the data into a static structure, making it difficult to capture trends and cyclical changes in the data over time, resulting in low accuracy in the completion results.

[0004] Therefore, how to introduce time series dynamics into the process of power sensing data completion, fully consider the time dimension and potential change trend of the data, and improve the prediction accuracy is a technical problem to be solved. Summary of the Invention

[0005] Based on this, the technical problem to be solved by the present invention is to provide a power sensing data completion method and device based on nonlinear Tucker decomposition coupling.

[0006] In a first aspect, an embodiment of the present application provides a method for completing power sensing data based on nonlinear Tucker decomposition coupling, comprising the following steps:

[0007] S1: Receive the completion instruction of power sensing data;

[0008] S2: Based on the completion instruction, collect historical power sensing data;

[0009] S3: constructing a power sensing data tensor based on the collected historical power sensing data;

[0010] S4: performing nonlinear Tucker decomposition coupling on the historical power sensing data to construct a core tensor and latent feature matrix of the power sensing data;

[0011] S5: Based on the power sensing data tensor, the power sensing data core tensor and the latent feature matrix, a target loss function is constructed and iterative optimization is performed, and data completion is performed on the power sensing data based on the iteratively optimized target loss function to obtain a power sensing data completion value.

[0012] Preferably, the historical power sensing data is stored in the form of a quadruple, and the quadruple is represented as Q=(l, d, p, v);

[0013] Wherein, l represents the measured parameter, d represents the measurement time point, p represents the measurement day, and v represents the power sensed value of the measured parameter l measured at the measurement time point d on the measurement day p.

[0014] Preferably, constructing a power sensing data tensor based on the collected historical power sensing data includes:

[0015] S31: Divide all the quadruples Q=(l, d, p, v) of the historical power sensing data into data of K measurement days according to the number of measurement days p;

[0016] S32: Quadruple Q based on p=1 (1) =(l,d,1,v) to get Q (1) Data (l, d, v), and according to Q (1) Construct the slice matrix P with measurement day p = 1 (1) ;

[0017] S33: Select the quadruple Q from the quadruple Q = (l, d, p, v) in sequence based on the above steps according to the remaining measurement days p (2) , Q (3) ,…,Q (K) , respectively construct the slice matrix P (2) 、P (3) ,…,P (K) ;

[0018] S34: Arrange the K slice matrices in order from front to back according to the divided time periods to construct the power sensing data tensor Ψ∈R I×J×K ;

[0019] Among them, P (1) The size of the slice matrix P is I rows and J columns, where I is the number of measurement parameters and J is the number of measurement time points. (1) The element P in (1) ijrepresents the power perception value of the i-th measurement parameter measured at the j-th measurement time point on the first measurement day, 1≤i≤I, 1≤j≤J; R represents a real number set.

[0020] Preferably, nonlinear Tucker decomposition coupling is performed on the historical power sensing data to construct a core tensor and latent feature matrix of the power sensing data, including:

[0021] S41: constructing a power sensing data core tensor G based on the historical power sensing data;

[0022] S42: Based on the historical power sensing data, construct a latent feature matrix A representing all measurement parameters l, a latent feature matrix B representing all measurement time points d, and a latent feature matrix C representing all measurement days p.

[0023] Preferably, based on the power sensing data tensor, the power sensing data core tensor and the latent feature matrix, a target loss function is constructed and iteratively optimized, and data completion is performed on the power sensing data based on the iteratively optimized target loss function to obtain the completed power sensing data, including:

[0024] S51: Initializing process parameters involved in the power sensing data completion process;

[0025] S52: Constructing an initial target loss function for power sensing data completion according to the power sensing data tensor, the power sensing data core tensor, the latent feature matrices A, B, and C, and the process parameters;

[0026] S53: Iteratively optimize the initial objective function to obtain an intermediate objective loss function;

[0027] S54: Determine whether the intermediate target loss function satisfies the iteration termination condition. If so, terminate the iteration and output the intermediate target loss function as the target loss function after iterative optimization; if not, continue the iteration.

[0028] S55: completing the power sensing data based on the iteratively optimized target loss function to obtain completed power sensing data.

[0029] Preferably, the process parameters include: power sensing data tensor Ψ, power sensing data core tensor G, latent feature matrices A, B, C; latent feature dimensions M, N, O; maximum number of training iterations L; iteration number control variable r during training; and convergence termination threshold τ.

[0030] Preferably, the initial target loss function ε of power sensing data completion is constructed according to formula (1):

[0031]

[0032] in, represents the variable value when the objective function ε takes the minimum value; (i, j, k)∈Λ represents the subscript set of known elements contained in the power sensing data tensor Ψ; y ijk represents the value of the power sensing data of the measured parameter l at the measurement time point d on the measurement day p; Φ() represents the nonlinear activation function; g mno represents the element in the nth row and oth column of the mth slice in the core tensor G of power sensing data, 1≤m≤M, 1≤n≤N, 1≤o≤O, and the size of G is M×N×O, where M, N, and O represent the dimensions of the latent features of the measurement parameter l, the measurement time point d, and the measurement day p, respectively. M, N, and O are positive integers; im represents the value of the i-th row and m-th column in the latent feature matrix A of the measurement parameter; b jn represents the value of the jth row and nth column in the latent feature matrix B at the measurement time point; c ko Represents the value of the kth row and oth column in the latent feature matrix C of the measurement days;

[0033] Among them, A (i) Represents the hidden features of the i-th measurement parameter, the size of A is I×M, 1≤i≤I; B (j) represents the latent feature at the jth measurement time point, the size of B is J×N, where 1≤j≤J; C (k) represents the latent feature of the kth measurement day, and the size of C is K×O, where 1≤k≤K.

[0034] Preferably, the Euclidean distance is used as the optimization target, and the non-negative stochastic gradient descent rule is used to iteratively optimize the initial target loss function. The formula for iterative optimization is as follows:

[0035]

[0036] Wherein, (i,j,k)∈Λ, (i,j,k)∈Λ(i), (i,j,k)∈Λ(j), and (i,j,k)∈Λ(k) represent the subscript set of known elements in the power sensing data tensor Ψ, the subscript set of known elements related to i, the subscript set of known elements related to j, and the subscript set of known elements related to k, respectively; is the power sensing data completion value, which is expressed by formula (6):

[0037]

[0038] Preferably, the iteration termination condition is that r reaches the maximum number of training iterations L or the absolute difference between the target loss function after the current iteration and the target loss function of the previous iteration is less than τ.

[0039] In a second aspect, an embodiment of the present application provides a power sensing data completion device based on nonlinear Tucker decomposition coupling, characterized in that the device includes:

[0040] A power sensing data completion instruction receiving module receives a power sensing data completion instruction;

[0041] A power sensing data collection module, configured to collect historical power sensing data based on the completion instruction;

[0042] A power sensing data tensor construction module, configured to construct a power sensing data tensor based on the collected historical power sensing data;

[0043] A power sensing data nonlinear Tucker decomposition coupling module is used to perform nonlinear Tucker decomposition coupling on the historical power sensing data to construct a core tensor and latent feature matrix of the power sensing data;

[0044] The power sensing data completion module is used to construct a target loss function and perform iterative optimization based on the power sensing data tensor, the power sensing data core tensor and the latent feature matrix, and to complete the power sensing data based on the iteratively optimized target loss function to obtain a power sensing data completion value.

[0045] Compared with the prior art, the present invention has the following beneficial effects: the present invention uses historical power sensing data to construct a power sensing data tensor, and through the nonlinear Tucker decomposition coupling model, constructs a power sensing data core tensor and a latent feature matrix, and defines a target loss function to measure the difference between the observed power sensing data and the completion value. In the iterative optimization process, the non-negative stochastic gradient descent rule is used to update the target loss function, and the data completion value is dynamically adjusted, thereby accelerating the convergence process of the model and improving the accuracy of data completion. The present invention is specifically used to process power sensing data, and can perform high-precision data completion based on statistical laws to solve the problem of missing dynamic power sensing data containing time series information. The method of the present invention can be widely used in power system monitoring, smart grid, traffic flow prediction and other fields. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] A more complete understanding of the exemplary embodiments of the present invention can be obtained by referring to the following drawings. The drawings are intended to provide a further understanding of the embodiments of the present application and constitute a part of the specification. Together with the embodiments of the present application, they are used to explain the present invention and do not constitute a limitation of the present invention. In the drawings, the same reference numerals generally represent the same components or steps.

[0047] Figure 1This is a flowchart of a method for completing power sensing data based on nonlinear Tucker decomposition coupling according to an exemplary embodiment of the present application;

[0048] Figure 2 Schematic diagram of the structure of a power sensing data completion device based on nonlinear Tucker decomposition coupling according to an exemplary embodiment of the present application. DETAILED DESCRIPTION

[0049] Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although exemplary embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be limited by the embodiments described herein. Rather, these embodiments are provided to enable a more thorough understanding of the present disclosure and to fully convey the scope of the present disclosure to those skilled in the art.

[0050] It should be noted that, unless otherwise specified, the technical or scientific terms used in this application should have the common meanings understood by those skilled in the art to which this application belongs.

[0051] In addition, the terms "first" and "second" are used to distinguish different objects, not to describe a specific order. Furthermore, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product, or apparatus comprising a series of steps or elements is not limited to the listed steps or elements, but may optionally include steps or elements not listed, or may optionally include other steps or elements inherent to the process, method, product, or apparatus.

[0052] Example 1

[0053] The present application provides a method for completing power sensing data based on nonlinear Tucker decomposition coupling, including the following steps:

[0054] S1: Receive the completion instruction of power sensing data;

[0055] Specifically, the server may send instructions to the power sensing data acquisition module by sending instructions to complete the power sensing data periodically, or according to a notification from the device, or according to a notification from a server.

[0056] S2: Based on the completion instruction, collect historical power sensing data;

[0057] Specifically, historical power sensing data is stored in the form of a four-tuple, which is represented by Q = (l, d, p, v);

[0058] Wherein, l represents the measured parameter, d represents the measurement time point, p represents the measurement day, and v represents the power sensed value of the measured parameter l measured at the measurement time point d on the measurement day p.

[0059] S3: Construct a power sensing data tensor based on the collected historical power sensing data;

[0060] Specifically, step S3 includes:

[0061] S31: Divide all the quadruples Q = (l, d, p, v) of the historical power sensing data into data of K measurement days according to the number of measurement days p;

[0062] S32: Quadruple Q based on p=1 (1) =(l,d,1,v) to get Q (1) Data (l, d, v), and according to Q (1) Construct the slice matrix P with measurement day p = 1 (1) ;

[0063] S33: Select the quadruple Q from the quadruple Q = (l, d, p, v) in sequence based on the above steps according to the remaining measurement days p (2) , Q (3) ,…,Q (K) , respectively construct the slice matrix P (2) 、P (3) ,…,P (K) ;

[0064] S34: Arrange the K slice matrices in the order of the divided time periods from front to back to construct the power sensing data tensor Ψ∈R I×J×K ;

[0065] Among them, P (1) The size of the slice matrix P is I rows and J columns, where I is the number of measurement parameters and J is the number of measurement time points. (1) The element P in (1) ij represents the power perception value of the i-th measurement parameter measured at the j-th measurement time point on the first measurement day, 1≤i≤I, 1≤j≤J; R represents a real number set.

[0066] S4: Perform nonlinear Tucker decomposition coupling on historical power sensing data to construct the core tensor and latent feature matrix of power sensing data;

[0067] Specifically, step S4 includes:

[0068] S41: Based on historical power sensing data, construct the power sensing data core tensor G;

[0069] S42: Based on the historical power sensing data, construct a latent feature matrix A representing all measurement parameters l, a latent feature matrix B representing all measurement time points d, and a latent feature matrix C representing all measurement days p.

[0070] Among them, g mno A represents the element of the nth row and oth column of the mth slice in the core tensor G of power sensing data, and the size of G is M×N×O, where M, N, and O are all positive integers, representing the dimensions of the latent features of the measurement parameter l, the measurement time point d, and the measurement day p, respectively. (i) represents the hidden feature of the i-th measurement parameter, and the size of A is I×M, where 1≤i≤I, and M is a positive integer representing the dimension of the hidden feature of the measurement parameter l. (j) represents the latent feature at the jth measurement time point, and the size of B is J×N, where 1≤j≤J, and N is a positive integer representing the dimension of the latent feature at the measurement time point d.

[0071] S5: Based on the power sensing data tensor, the power sensing data core tensor and the latent feature matrix, a target loss function is constructed and iteratively optimized, and the power sensing data is completed based on the iteratively optimized target loss function to obtain a power sensing data completion value.

[0072] Specifically, step S5 includes:

[0073] S51: Initializing process parameters involved in the power sensing data completion process;

[0074] Specifically, the power sensing data tensor Ψ, the power sensing data core tensor G, and the latent feature matrices A, B, and C are initialized; the latent feature dimensions M, N, and O of the factor matrix are initialized; the maximum number of training iterations L is initialized; the iteration number control variable r during training is initialized; and the convergence termination threshold τ is initialized.

[0075] In this embodiment, the specific operations for initializing each parameter are as follows:

[0076] (1) The latent feature dimension M of the factor matrix determines the latent feature space dimension of the latent feature matrix A and is initialized to a positive integer;

[0077] (2) The latent feature dimension N of the factor matrix determines the latent feature space dimension of the latent feature matrix B and is initialized to a positive integer;

[0078] (3) The latent feature dimension O of the factor matrix determines the latent feature space dimension of the latent feature matrix C and is initialized to a positive integer;

[0079] (4) The size of the core tensor G is determined by the dimensions M, N, and O of the latent feature matrix; the sizes of the latent feature matrices A, B, and C are determined by the corresponding dimension values ​​of the power sensing data tensor Ψ and the latent feature dimensions M, N, and O of the factor matrix, that is, A is a factor matrix with I rows and M columns, B is a factor matrix with J rows and N columns, and C is a factor matrix with K rows and O columns. The core tensor and the three latent feature matrices are initialized with small random positive numbers respectively;

[0080] (5) The maximum number of training iterations L is a variable that controls the upper limit of the iteration process and is initialized to a large positive integer;

[0081] (6) The iteration number control variable r is initialized to 0;

[0082] (7) The convergence termination threshold τ is a parameter used to determine whether the iterative process has converged and is initialized with a very small positive number.

[0083] S52: constructing an initial target loss function for power sensing data completion based on the power sensing data tensor, the power sensing data core tensor, the latent feature matrix, and the process parameters;

[0084] In this embodiment, based on the constructed power sensing data tensor Ψ and the core tensor G and three latent feature matrices A, B, and C created by the power sensing data nonlinear Tucker decomposition coupling module, as well as the relevant parameters involved in the initialized power sensing data completion process, a target loss function ε is constructed for the known data set Λ of the power sensing data tensor Ψ to train and obtain the latent eigenvalues ​​of the core tensor G and the three latent feature matrices A, B, and C of the historical power sensing data. The initial target loss function ε for power sensing data completion is constructed according to formula (1):

[0085]

[0086] in, represents the variable value when the objective function ε takes the minimum value; (i, j, k)∈Λ represents the subscript set of known elements contained in the power sensing data tensor Ψ; y ijk represents the value of the power sensing data of the measured parameter l at the measurement time point d on the measurement day p; Φ() represents the nonlinear activation function; g mno represents the element in the nth row and oth column of the mth slice in the core tensor G of power sensing data, 1≤m≤M, 1≤n≤N, 1≤o≤O, and the size of G is M×N×O, where M, N, and O represent the dimensions of the latent features of the measurement parameter l, the measurement time point d, and the measurement day p, respectively. M, N, and O are positive integers; im represents the value of the i-th row and m-th column in the latent feature matrix A of the measurement parameter; b jn represents the value of the jth row and nth column in the latent feature matrix B at the measurement time point; c koRepresents the value of the kth row and oth column in the latent feature matrix C of the measurement days;

[0087] Among them, A (i) Represents the hidden features of the i-th measurement parameter, the size of A is I×M, 1≤i≤I; B (j) represents the latent feature at the jth measurement time point, the size of B is J×N, where 1≤j≤J; C (k) represents the latent feature of the kth measurement day, and the size of C is K×O, where 1≤k≤K.

[0088] S53: Iteratively optimize the initial objective function to obtain an intermediate objective loss function;

[0089] In this embodiment, the Euclidean distance is used as the optimization target. To ensure the non-negativity in the update process, the target loss function ε is iteratively optimized using the non-negative stochastic gradient descent rule to minimize the value of the target loss function ε. The formula for training iteration is as follows:

[0090]

[0091]

[0092] Among them, (i,j,k)∈Λ, (i,j,k)∈Λ(i), (i,j,k)∈Λ(j) and (i,j,k)∈Λ(k) respectively represent the subscript set of known elements in the power sensing data tensor Ψ, the subscript set of known elements related to i, the subscript set of known elements related to j and the subscript set of known elements related to k.

[0093] S54: Determine whether the intermediate target loss function meets the iteration termination condition. If so, terminate the iteration and output the intermediate target loss function as the target loss function after iterative optimization. If not, continue the iteration.

[0094] In this step, the training of the loss function ε on Λ reaches termination conditions in two situations. The first is that the value of the training iteration control variable r is incremented by 1 with each iteration of ε. When the value of r reaches the maximum number of training iterations L, ε training stops. The second is that during ε training, ε training stops when the absolute difference between the calculated ε value after the current iteration and the ε value of the previous iteration is less than the convergence termination threshold τ.

[0095] S55: completing the power sensing data based on the iteratively optimized target loss function to obtain completed power sensing data.

[0096] Specifically, when the target loss function ε converges on the known data set Λ, the core tensor and three latent feature matrices A, B, and C obtained by training when the target loss function ε reaches the minimum value are used to calculate the highest accuracy measurement parameter l at the measurement time point d on the measurement day p. It is expressed by formula (6):

[0097]

[0098] Example 2

[0099] In the above embodiments, a method is provided. Accordingly, the present application also provides an apparatus. The apparatus provided in the embodiments of the present application can implement the above methods. The apparatus can be implemented through software, hardware, or a combination of software and hardware. For example, the apparatus can include integrated or separate functional modules or units to perform the corresponding steps in each of the above methods.

[0100] In some implementations of the embodiments of the present application, the device 10 provided in the embodiments of the present application is based on the same inventive concept as the method provided in the aforementioned embodiments of the present application and has the same beneficial effects.

[0101] Please refer to Figure 2 , which shows a schematic diagram of a device provided by some embodiments of the present application. Since the device embodiments are basically similar to the method embodiments, the description is relatively simple. For relevant details, please refer to the partial description of the method embodiments. The device embodiments described below are merely illustrative.

[0102] like Figure 2 As shown, the apparatus 10 may include:

[0103] The power sensing data completion instruction receiving module 110 receives the power sensing data completion instruction;

[0104] The power sensing data collection module 120 is configured to collect historical power sensing data based on the completion instruction;

[0105] A power sensing data tensor construction module 130 is configured to construct a power sensing data tensor based on the collected historical power sensing data;

[0106] The power sensing data nonlinear Tucker decomposition coupling module 140 is used to perform nonlinear Tucker decomposition coupling on the historical power sensing data to construct a power sensing data core tensor and a latent feature matrix;

[0107] The power sensing data completion module 150 is used to construct a target loss function and perform iterative optimization based on the power sensing data tensor, the power sensing data core tensor and the latent feature matrix, and to complete the power sensing data based on the iteratively optimized target loss function to obtain a power sensing data completion value.

[0108] The power sensing data acquisition module 120 includes a power sensing data storage unit 121 and a power sensing supplementary data storage unit 122. The power sensing data storage unit 121 is used to store the received historical power sensing data in the form of a quad. The representation of the quad is Q = (l, d, p, v), where l represents the measurement parameter, d represents the measurement time point, p represents the measurement day, and v represents the power sensing value measured at the measurement parameter l at the measurement time point d on the measurement day p. The power sensing supplementary data storage unit 122 is used to store the supplemented power sensing data, wherein the supplemented data is also stored in the form of a quad.

[0109] In this embodiment, the power sensing data completion module 150 includes an initialization unit 151 , a training unit 152 , and a power sensing data completion value calculation unit 153 .

[0110] The initialization unit 151 is used to initialize the relevant parameters involved in the power sensing data completion process. The relevant parameters have been described in the above embodiments and will not be repeated here.

[0111] Among them, the training unit 152 is used to combine the constructed initial power sensing data tensor, the initial power sensing data core tensor, the initial latent feature matrix and the relevant parameters initialized by the initialization unit 151 to train and calculate the core tensor Ψ and latent feature matrices A, B, and C of the power sensing data.

[0112] The power sensing data supplement value calculation unit 153 is used to calculate the power sensing data supplement value based on the core tensor and latent feature matrix of the historical power sensing data obtained by the training unit 152. The calculated supplement data is then stored in the power sensing supplement data storage unit 122.

[0113] The iterative optimization process and parameter-related definitions involved in this embodiment have been explained in the previous embodiments and will not be repeated here.

[0114] It should be noted that the flowcharts and block diagrams in the accompanying drawings show the possible architectures, functions and operations of the systems, methods and computer program products according to multiple embodiments of the present application. In this regard, each box in the flowchart or block diagram can represent a module, a program segment or a part of a code, and the module, program segment or a part of the code contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in an order different from that marked in the accompanying drawings. For example, two consecutive boxes can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flowchart, and the combination of boxes in the block diagram and / or flowchart, can be implemented with a dedicated hardware-based system that performs the specified function or action, or can be implemented with a combination of dedicated hardware and computer instructions.

[0115] Those skilled in the art will clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0116] In the several embodiments provided in this application, it should be understood that the disclosed devices and methods can be implemented in other ways. The device embodiments described above are merely schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some communication interface, the indirect coupling or communication connection of the device or unit can be electrical, mechanical or other forms.

[0117] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0118] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0119] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0120] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application 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 or all of the technical features therein. These modifications or replacements do not deviate the essence of the corresponding technical solutions from the scope of the technical solutions of the embodiments of the present application, and they should all be included in the scope of the claims and description of the present application.

Claims

1. A power sensing data completion method based on nonlinear Tucker decomposition coupling, characterized in that: The steps include: S1: Receive the completion instruction of power sensing data; S2: Based on the completion instruction, collect historical power sensing data; S3: constructing a power sensing data tensor based on the collected historical power sensing data; S4: performing nonlinear Tucker decomposition coupling on the historical power sensing data to construct a core tensor and latent feature matrix of the power sensing data; S5: Based on the power sensing data tensor, the power sensing data core tensor, and the latent feature matrix, construct a target loss function and perform iterative optimization, and perform data completion on the power sensing data based on the iteratively optimized target loss function to obtain a power sensing data completion value; The historical power sensing data is stored in the form of a four-tuple, which is represented by Q = (l, d, p, v); wherein l represents the measured parameter, d represents the measurement time point, p represents the measurement day, and v represents the power sensing value of the measured parameter l measured at the measurement time point d on the measurement day p; The step of constructing a power sensing data tensor based on the collected historical power sensing data includes: S31: Divide all the quadruples Q=(l, d, p, v) of the historical power sensing data into data of K measurement days according to the number of measurement days p; S32: Quadruple Q based on p=1 (1) =(l,d,1,v) to get Q (1) Data (l, d, v), and according to Q (1) Construct the slice matrix P with measurement day p = 1 (1) ; S33: Select the quadruple Q from the quadruple Q = (l, d, p, v) in sequence based on the above steps according to the remaining measurement days p (2) , Q (3) ,…,Q (K) , respectively construct the slice matrix P (2) 、P (3) ,…,P (K) ; S34: Arrange the K slice matrices in order from front to back according to the divided time periods to construct the power sensing data tensor Ψ∈R I×J×K ; Among them, P (1) The size of the slice matrix P is I rows and J columns, where I is the number of measurement parameters and J is the number of measurement time points. (1) The element P in (1) ij represents the power sensed value of the i-th measurement parameter measured at the j-th measurement time point on the first measurement day, 1≤i≤I, 1≤j≤J; R represents a real number set; Nonlinear Tucker decomposition coupling is performed on the historical power sensing data to construct a core tensor and latent feature matrix of the power sensing data, including: S41: constructing a power sensing data core tensor G based on the historical power sensing data; S42: Based on the historical power sensing data, construct a latent feature matrix A representing all measured parameters l, a latent feature matrix B representing all measurement time points d, and a latent feature matrix C representing all measurement days p; Based on the power sensing data tensor, the power sensing data core tensor, and the latent feature matrix, a target loss function is constructed and iteratively optimized, and data completion is performed on the power sensing data based on the iteratively optimized target loss function to obtain completed power sensing data, including: S51: Initializing process parameters involved in the power sensing data completion process; S52: Constructing an initial target loss function for power sensing data completion according to the power sensing data tensor, the power sensing data core tensor, the latent feature matrices A, B, and C, and the process parameters; S53: Iteratively optimize the initial objective function to obtain an intermediate objective loss function; S54: Determine whether the intermediate target loss function satisfies the iteration termination condition. If so, terminate the iteration and output the intermediate target loss function as the target loss function after iterative optimization; if not, continue the iteration. S55: completing the power sensing data based on the iteratively optimized target loss function to obtain completed power sensing data.

2. The method according to claim 1, characterized in that The process parameters include: latent feature dimensions M, N, O; maximum training iteration number L; iteration number control variable r during training; and convergence termination threshold τ.

3. The method according to claim 2, characterized in that According to formula (1), the initial target loss function ε of power sensing data completion is constructed: in, represents the variable value when the objective function ε takes the minimum value; (i, j, k)∈Λ represents the subscript set of known elements contained in the power sensing data tensor Ψ; y ijk represents the value of the power sensing data of the measured parameter l at the measurement time point d on the measurement day p; Φ() represents the nonlinear activation function; g mno represents the element in the nth row and oth column of the mth slice in the core tensor G of power sensing data, 1≤m≤M, 1≤n≤N, 1≤o≤O, and the size of G is M×N×O, where M, N, and O represent the dimensions of the latent features of the measurement parameter l, the measurement time point d, and the measurement day p, respectively. M, N, and O are positive integers; im represents the value of the i-th row and m-th column in the latent feature matrix A of the measurement parameter; b jn represents the value of the jth row and nth column in the latent feature matrix B at the measurement time point; c ko Represents the value of the kth row and oth column in the latent feature matrix C of the measurement days; Among them, A (i) Represents the hidden features of the i-th measurement parameter, the size of A is I×M, 1≤i≤I; B (j) represents the latent feature at the jth measurement time point, the size of B is J×N, where 1≤j≤J; C (k) represents the latent feature of the kth measurement day, and the size of C is K×O, where 1≤k≤K.

4. The method according to claim 3, characterized in that Taking the Euclidean distance as the optimization target, the non-negative stochastic gradient descent rule is used to iteratively optimize the initial target loss function. The iterative optimization formula is as follows: Wherein, (i,j,k)∈Λ, (i,j,k)∈Λ(i), (i,j,k)∈Λ(j), and (i,j,k)∈Λ(k) represent the subscript set of known elements in the power sensing data tensor Ψ, the subscript set of known elements related to i, the subscript set of known elements related to j, and the subscript set of known elements related to k, respectively; is the power sensing data completion value, which is expressed by formula (6):

5. The method according to claim 4, characterized in that The iteration termination condition is that r reaches the maximum number of training iterations L or the absolute difference between the target loss function after the current iteration and the target loss function of the previous iteration is less than τ.

6. A power sensing data completion device based on nonlinear Tucker decomposition coupling, characterized in that: The device includes: A power sensing data completion instruction receiving module receives a power sensing data completion instruction; A power sensing data collection module, configured to collect historical power sensing data based on the completion instruction; A power sensing data tensor construction module, configured to construct a power sensing data tensor based on the collected historical power sensing data; A power sensing data nonlinear Tucker decomposition coupling module is used to perform nonlinear Tucker decomposition coupling on the historical power sensing data to construct a core tensor and latent feature matrix of the power sensing data; a power sensing data completion module, configured to construct a target loss function based on the power sensing data tensor, the power sensing data core tensor, and the latent feature matrix, and perform iterative optimization, and perform data completion on the power sensing data based on the iteratively optimized target loss function to obtain a power sensing data completion value; The historical power sensing data is stored in the form of a four-tuple, which is represented by Q = (l, d, p, v); wherein l represents the measured parameter, d represents the measurement time point, p represents the measurement day, and v represents the power sensing value of the measured parameter l measured at the measurement time point d on the measurement day p; The step of constructing a power sensing data tensor based on the collected historical power sensing data includes: S31: Divide all the quadruples Q=(l, d, p, v) of the historical power sensing data into data of K measurement days according to the number of measurement days p; S32: Quadruple Q based on p=1 (1) =(l,d,1,v) to get Q (1) Data (l, d, v), and according to Q (1) Construct the slice matrix P with measurement day p = 1 (1) ; S33: Select the quadruple Q from the quadruple Q = (l, d, p, v) in sequence based on the above steps according to the remaining measurement days p (2) , Q (3) ,…,Q (K) , respectively construct the slice matrix P (2) 、P (3) ,…,P (K) ; S34: Arrange the K slice matrices in order from front to back according to the divided time periods to construct the power sensing data tensor Ψ∈R I×J×K ; Among them, P (1) The size of the slice matrix P is I rows and J columns, where I is the number of measurement parameters and J is the number of measurement time points. (1) The element P in (1) ij represents the power sensed value of the i-th measurement parameter measured at the j-th measurement time point on the first measurement day, 1≤i≤I, 1≤j≤J; R represents a real number set; Nonlinear Tucker decomposition coupling is performed on the historical power sensing data to construct a core tensor and latent feature matrix of the power sensing data, including: S41: constructing a power sensing data core tensor G based on the historical power sensing data; S42: Based on the historical power sensing data, construct a latent feature matrix A representing all measured parameters l, a latent feature matrix B representing all measurement time points d, and a latent feature matrix C representing all measurement days p; Based on the power sensing data tensor, the power sensing data core tensor, and the latent feature matrix, a target loss function is constructed and iteratively optimized, and data completion is performed on the power sensing data based on the iteratively optimized target loss function to obtain completed power sensing data, including: S51: Initializing process parameters involved in the power sensing data completion process; S52: Constructing an initial target loss function for power sensing data completion according to the power sensing data tensor, the power sensing data core tensor, the latent feature matrices A, B, and C, and the process parameters; S53: Iteratively optimize the initial objective function to obtain an intermediate objective loss function; S54: Determine whether the intermediate target loss function satisfies the iteration termination condition. If so, terminate the iteration and output the intermediate target loss function as the target loss function after iterative optimization; if not, continue the iteration. S55: completing the power sensing data based on the iteratively optimized target loss function to obtain completed power sensing data.

Citation Information

Patent Citations

  • Internet of Things data completion method and device based on low-rank tensor decomposition, and medium

    CN116450636A

  • Network throughput prediction method and device based on tensor Tucker decomposition

    CN117255041A