Personal information security storage method and system based on Internet of Things
Through the Internet of Things data clustering and classification technology, the resource waste and security risks caused by data concentration in traditional data storage methods are solved, and the detailed classification and secure storage of data are realized, which reduces the risk of storage consumption and loss, and improves the risk of The stability of the information system.
Patent Information
- Application Number
- CN202411197215.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-29
- Publication Date
- 2024-12-06
- Estimated Expiration
- 2044-08-29
AI Technical Summary
Traditional data storage methods lead to excessive concentration of data, high resource waste and security risks, and are prone to data loss or failure.
The Internet of Things-based personal information security storage method is adopted, and through clustering and small classification technologies, data is carefully classified and useless data is eliminated to realize decentralized storage and security management of data.
It effectively reduces the total amount of data and storage space consumption, reduces the risk of data loss, and improves the storage utilization efficiency and the stability and reliability of the information system.
Smart Images

Figure CN119089499A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of data processing technology, and in particular to a method and system for securely storing personal information based on the Internet of Things. Background Art
[0002] In the Internet, data privacy and security are of vital importance. It is not only related to the protection of personal information, but also involves the security of the entire network. With the continuous development of the information industry, information security technology has become one of the key forces driving the progress of this industry. A computer network is a distributed system that ensures the security of data interaction through communication and encryption operations between nodes. However, the traditional data storage method is data-centric and stores high-density information in a centralized manner on specific nodes. Although this method simplifies data management, it also brings some problems. First, due to the excessive concentration of data, the storage space may be consumed too quickly, resulting in a waste of resources. Second, centralized stored data is more likely to become a target of attack. Once these nodes are attacked or fail, data may be lost or invalidated. Summary of the invention
[0003] The present invention provides a personal information security storage method and system based on the Internet of Things to solve the existing problems.
[0004] The method and system for secure storage of personal information based on the Internet of Things of the present invention adopt the following technical solutions:
[0005] An embodiment of the present invention provides a method for securely storing personal information based on the Internet of Things, the method comprising the following steps:
[0006] Obtain a sample space of all information data points to be stored, and obtain several clusters of data points in the sample space;
[0007] According to the distance between the data points in each cluster and the distance from the data point to the center point of the cluster, the classification consistency of any two data points in each cluster belonging to the same small category is obtained; according to the classification consistency of any two data points in each cluster belonging to the same small category, all the data points in each cluster are clustered to obtain several small categories and data scatter points in each cluster, and the small category contains several data points;
[0008] According to the distance between each data scatter point in each cluster and the center point of each small classification, and the classification consistency that each data scatter point and the center point of each small classification belong to the same small classification, the feature similarity between each data scatter point in each cluster and each small classification and the suspected target scatter points of each small classification are obtained;
[0009] According to the changes of each small classification before and after the suspected target scattered points of each small classification in each cluster are added, and the feature similarity between each data scattered point and each small classification, the similarity between each small classification in each cluster and each suspected target scattered point in each small classification is obtained; according to the similarity between each small classification in each cluster and each suspected target scattered point in each small classification, it is determined whether the suspected target scattered points of each small classification in each cluster are added;
[0010] Obtain useless data classification based on the number of small categories in each cluster, the distance between the updated center points of each small category, the number of data points in each small category and the number of suspected target scattered points finally added; eliminate the data in the useless data classification and complete the data storage.
[0011] Preferably, the step of obtaining the classification consistency of any two data points in each cluster belonging to the same sub-classification according to the distance between the data points in each cluster and the distance from the data point to the center point of the cluster includes the following specific steps:
[0012]
[0013] In the formula, Q v,k,y is the classification consistency that the kth data point and the yth data point in the vth cluster belong to the same sub-category, l v,k,y is the Euclidean distance between the kth data point and the yth data point in the vth cluster in the sample space, L v,k is the distance between the kth data point in the vth cluster and the center point of the vth cluster, L v,y is the distance between the yth data point in the vth cluster and the center point of the vth cluster, || is the absolute value, and Sigmoid() is the normalization function.
[0014] Preferably, the method of obtaining the feature similarity between each data scatter point in each cluster and each small classification and the suspected target scatter points of each small classification according to the distance between each data scatter point in each cluster and the center point of each small classification, and the classification consistency that each data scatter point and the center point of each small classification belong to the same small classification, includes the following specific steps:
[0015]
[0016] Where W v,i,j is the feature similarity between the i-th data point and the j-th small classification in the v-th cluster, l v,i,j is the Euclidean distance between the ith data point in the vth cluster and the jth small classification center point, Q v,i,j is the classification consistency that the i-th data scatter point in the v-th cluster and the j-th small classification center point belong to the same small classification, max(Q v,i,j) is the maximum value of the classification consistency between the ith data point in the vth cluster and all data points in the jth sub-category belonging to the same sub-category;
[0017] According to the feature similarity between each data scatter point and each small category, the suspected target scatter points of each small category are obtained.
[0018] Preferably, the method of obtaining the suspected target scatter points of each sub-category according to the feature similarity between each data scatter point and each sub-category comprises the following specific steps:
[0019] Among the feature similarities between the ith data point and all small categories in the vth cluster, a small category corresponding to the maximum feature similarity is selected, and the ith data point is used as the suspected target point of the small category corresponding to the maximum feature similarity.
[0020] Preferably, the steps of obtaining the similarity between each small classification in each cluster and each suspected target scattered point in each small classification according to the changes of each small classification before and after the suspected target scattered point in each small classification in each cluster is added, and the feature similarity between each data scattered point and each small classification, include the following specific steps:
[0021] The principal component analysis method is used to obtain the projection difference on the principal component before and after the f-th suspected target scattered point of the j-th sub-category in the v-th cluster is added to the j-th sub-category to quantify the change value of the direction, and the change value is recorded as the change value of the overall direction of the j-th sub-category in the v-th cluster after the f-th suspected target scattered point is added to the j-th sub-category;
[0022] Add the fth suspected target scattered point of the jth sub-classification to the center point of the jth sub-classification, and record it as the updated center point of the jth sub-classification;
[0023] Calculate the absolute value of the difference between the distance from the fth suspected target scattered point of the jth sub-classification to the center point of the jth sub-classification and the distance to the updated center point of the jth sub-classification, and record the absolute value of the difference in distance as the change in the size of the jth sub-classification space in the vth cluster after the fth suspected target scattered point is added to the jth sub-classification;
[0024] According to the change value of the overall direction and spatial size of each small classification in each cluster after adding each suspected target scattered point, and the feature similarity between each data scattered point and each small classification, the similarity between each small classification in each cluster and each suspected target scattered point in each small classification is obtained.
[0025] Preferably, the method of obtaining the similarity between each small classification in each cluster and each suspected target scattered point in each small classification according to the change value of the overall direction and the change value of the spatial size of each small classification in each cluster after adding each suspected target scattered point, and the feature similarity between each data scattered point and each small classification, comprises the following specific steps:
[0026]
[0027] In the formula, R v,f,j is the similarity between the jth sub-category in the vth cluster and the fth suspected target scattered point in the jth sub-category, W v,f,j is the feature similarity between the jth sub-category in the vth cluster and the fth suspected target scatter point in the jth sub-category, S v,f,j is the change value of the overall direction of the jth sub-category in the vth cluster after adding the fth suspected target scattered point to the jth sub-category, θ v,f,j N is the change in the size of the jth sub-classification space in the vth cluster after adding the fth suspected target scattered point to the jth sub-classification. v,j,f is the number of suspected target scattered points in the jth sub-category in the vth cluster except the fth suspected target scattered point, S j,m,v After adding the mth suspected target scattered point to the jth sub-classification, the change value of the size of the jth sub-classification space in the vth cluster is, θ j,m,v is the change value of the overall direction of the jth sub-category in the vth cluster after adding the mth suspected target scattered point to the jth sub-category, and || is the absolute value.
[0028] Preferably, judging whether to add the suspected target scattered points of each small category in each cluster cluster according to the similarity of each small category in each cluster cluster and each suspected target scattered point in each small category includes the following specific steps:
[0029] When the similarity between the jth sub-classification in the vth cluster and the fth suspected target scatter point in the jth sub-classification is greater than the preset threshold, the fth suspected target scatter point in the jth sub-classification is added to the jth sub-classification in the vth cluster to obtain the updated classification of each sub-classification in the vth cluster.
[0030] Preferably, the method of obtaining useless data classification according to the number of small categories in each cluster, the distance between the updated center points of each small category, the number of data points in each small category and the number of suspected target scattered points finally added includes the following specific steps:
[0031]
[0032] Where U v,e The uselessness of updating the classification data for the eth in the vth cluster, nv,e Update the number of all data points in the e-th updated classification in the v-th cluster, n v is the number of updated categories in the vth cluster, l v,e,h is the distance between the center points of the e-th updated classification and the h-th updated classification in the v-th cluster, N v,e is the number of scattered data points in the e-th updated classification in the v-th cluster, R v,e,b is the similarity between the small category corresponding to the e-th updated category in the v-th cluster and the b-th data scatter point in the e-th updated category, and Sigmoid() is the normalization function;
[0033] Obtain useless data classification based on the uselessness of each updated classification data in each cluster.
[0034] Preferably, the step of obtaining useless data classification according to the uselessness of each updated classification data in each clustering cluster comprises the following specific steps:
[0035] When the uselessness of the e-th updated classification in the v-th cluster is greater than a preset threshold, it is determined that the e-th updated classification belongs to the useless data classification.
[0036] The present invention also proposes a personal information security storage system based on the Internet of Things, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program stored in the memory to implement the steps of the aforementioned personal information security storage method based on the Internet of Things.
[0037] The beneficial effect of the technical solution of the present invention is that the present invention can effectively reduce the total amount of data and the amount of data transmitted per unit time by more carefully classifying data and deleting abnormal classified data. This not only reduces the consumption rate of storage space, but also avoids data loss and failure. The detailed classification ensures that similar data is stored reasonably, while identifying and eliminating abnormal data, further optimizing storage utilization efficiency. This method not only protects data privacy and security, but also improves the stability and reliability of the entire information system. BRIEF DESCRIPTION OF THE DRAWINGS
[0038] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only 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.
[0039] Figure 1 This is a flowchart of the steps of the method for secure storage of personal information based on the Internet of Things of the present invention. DETAILED DESCRIPTION
[0040] In order to further explain the technical means and effects adopted by the present invention to achieve the predetermined invention purpose, the specific implementation method, structure, features and effects of the personal information security storage method and system based on the Internet of Things proposed by the present invention are described in detail below in combination with the accompanying drawings and preferred embodiments. In the following description, different "one embodiment" or "another embodiment" does not necessarily refer to the same embodiment. In addition, specific features, structures or characteristics in one or more embodiments may be combined in any suitable form.
[0041] Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.
[0042] The specific scheme of the method and system for secure storage of personal information based on the Internet of Things provided by the present invention is described in detail below with reference to the accompanying drawings.
[0043] See also Figure 1 , which shows a flowchart of a method for securely storing personal information based on the Internet of Things provided by an embodiment of the present invention, the method comprising the following steps:
[0044] Step S001: Obtain a sample space of all information data points to be stored, and obtain a number of clusters of data points in the sample space.
[0045] Obtain all information data points to be stored, classify the large amount of data to be stored, and treat each of the data as a data point, and map each data point to a multidimensional sample space according to the data feature, where each dimension is regarded as a coordinate axis, representing an attribute or feature of the data.
[0046] The K-means clustering algorithm is used for clustering to obtain multiple clusters. In this embodiment, K=30, and the K-means clustering algorithm is a well-known technology, and is taken as an example.
[0047] It should be noted that the information data in this embodiment takes device data, user behavior data, geographic location information, and personal privacy information as examples.
[0048] Step S002: According to the distance between the data points in each cluster and the distance from the data point to the center point of the cluster, obtain the classification consistency that any two data points in each cluster belong to the same small category; according to the classification consistency that any two data points in each cluster belong to the same small category, cluster all the data points in each cluster to obtain several small categories and data scatter points in each cluster, and the small category contains several data points.
[0049] When clustering is used to classify data, especially when data content is used as the main storage classification condition, there may be too much data in some categories. This will not only lead to a rapid reduction in storage space, but also increase the risk of data loss. For example, when processing data from a nursing home, the amount of data in the medical examination category may be particularly large, and this category can be subdivided into multiple small categories such as heart examination, brain examination, and blood examination. In order to optimize the storage process and ensure the security of data, the large category can be further subdivided into multiple small categories for storage, which can effectively slow down the reduction of storage space and reduce the risk of data loss.
[0050] The center point of each cluster is obtained by the centroid formula. It should be noted that the cluster center point of a cluster may not be a data point in the cluster.
[0051] In any cluster, obtain the classification consistency that any two data points belong to the same sub-category.
[0052] This implementation provides a method for calculating the classification consistency of the kth data point and the yth data point in the same cluster belonging to the same sub-category:
[0053]
[0054] In the formula, Q v,k,y is the classification consistency that the kth data point and the yth data point in the vth cluster belong to the same sub-category, l v,k,y is the Euclidean distance between the kth data point and the yth data point in the vth cluster in the sample space, L v,k is the distance between the kth data point in the vth cluster and the center point of the vth cluster, L v,y is the distance between the yth data point in the vth cluster and the center point of the vth cluster, || is the absolute value, and Sigmoid() is the normalization function.
[0055] In the above formula, |L v,k -L v,y | is the absolute value of the difference between the distances of two data points and the center point of the vth cluster. The smaller the value, the more likely the two data points belong to the same sub-category.
[0056] According to the inverse of the classification consistency of all two data points in any cluster belonging to the same sub-classification, all data points in any cluster are clustered by the DBSCAN clustering algorithm to obtain several sub-classifications and data scatter points. In this embodiment, the preset parameter radius value in the clustering process is 20, and the preset number of points in the MinPts neighborhood is 5. Among them, the DBSCAN clustering algorithm is a well-known technology, which is taken as an example.
[0057] It should be noted that the core idea of the DBSCAN clustering algorithm is to define clusters by density, and a cluster consists of a set of density-connected points. If a point is located in the density area of the core point, it will be assigned to a cluster; otherwise, it may be marked as a noise point, that is, a data scatter point.
[0058] Step S003: According to the distance between each data scatter point in each cluster and the center point of each small category, and the classification consistency that each data scatter point and the center point of each small category belong to the same small category, obtain the feature similarity between each data scatter point in each cluster and each small category and the suspected target scatter points of each small category.
[0059] Finally, the data points in each cluster can be divided into multiple small categories and multiple undefined scattered points. These scattered points may contain the characteristics of multiple categories. For example, blood pressure testing may involve the characteristics of both blood testing and heart testing. In order to store this data more orderly and ensure that each data point is accurately classified, it is necessary to further classify these data scattered points with unclear boundaries.
[0060] A method based on distance and classification consistency is used to classify these data points, and the feature similarity between all undefined points and subcategories is determined. Specifically, if a data point is close to the center point of a subcategories and has a high classification consistency with the subcategories, it can be considered that the data point is more likely to belong to this subcategories.
[0061] This embodiment provides a method for calculating the similarity between the i-th data scatter point and the j-th small classification feature in the v-th cluster:
[0062] For each small category in the vth cluster, the average position of all data points in each small category in the sample space is calculated, and the average value is recorded as the center point of each small category.
[0063] According to the method of calculating the classification consistency that the kth data point and the yth data point in the same cluster belong to the same small category, the classification consistency that the i-th data scatter point and the j-th small category center point in the same cluster belong to the same small category is obtained.
[0064]
[0065] Where W v,i,j is the feature similarity between the i-th data point and the j-th small classification in the v-th cluster, l v,i,j is the Euclidean distance between the ith data point in the vth cluster and the jth small classification center point, Q v,i,j is the classification consistency that the i-th data scatter point in the v-th cluster and the j-th small classification center point belong to the same small classification, max(Q v,i,j) is the maximum value of the classification consistency between the ith data point in the vth cluster and all data points in the jth sub-category belonging to the same sub-category.
[0066] In the feature similarities between the ith data point and all small categories in the vth cluster, a small category corresponding to the maximum feature similarity is selected, and the ith data point is used as the suspected target point of the small category corresponding to the maximum feature similarity. It should be noted that in this embodiment, when there are multiple small categories corresponding to the maximum feature similarity, one small category is selected for analysis.
[0067] Step S004: According to the changes of each small category in each cluster before and after the suspected target scatter points of each small category are added, and the feature similarity between each data scatter point and each small category, obtain the similarity between each small category in each cluster and each suspected target scatter point in each small category; according to the similarity between each small category in each cluster and each suspected target scatter point in each small category, determine whether the suspected target scatter points of each small category in each cluster should be added.
[0068] In cluster analysis, it is crucial to maintain the consistency of information description. When new information leads to deviations, it needs to be screened to maintain the accuracy of clustering. In the sample space, the distribution of similar data points shows regularity, and the degree of conformity between a single data point and a small category determines its classification. If the change of a small category is similar to that before after the data point is added, and the overall direction and area do not change much, then the data point is likely to belong to this small category. Such precise classification helps to improve the accuracy of data analysis and the consistency of clustering.
[0069] This embodiment provides a method for calculating the similarity between the suspected target scattered points of the jth sub-category in the vth cluster and the jth sub-category as follows:
[0070] The principal component analysis method is used to obtain the projection difference on the principal component before and after the f-th suspected target scattered point of the j-th sub-category in the v-th cluster is added to the j-th sub-category to quantify the change value of the direction, and the change value is recorded as the change value of the overall direction of the j-th sub-category in the v-th cluster after the f-th suspected target scattered point is added to the j-th sub-category. Among them, the principal component analysis method is a well-known technology and will not be described in detail here.
[0071] According to the method of obtaining the center point of each small category in each cluster, the center point of each small category after adding the suspected target scattered points is obtained, and the f-th suspected target scattered point of the j-th small category is added to the center point of the j-th small category, which is recorded as the updated center point of the j-th small category.
[0072] Calculate the absolute value of the difference between the distance from the fth suspected target scatter point of the jth small classification to the center point of the jth small classification and the distance to the updated center point of the jth small classification, and record the absolute value of the difference in distance as the change in the size of the jth small classification space in the vth cluster after the fth suspected target scatter point is added to the jth small classification.
[0073]
[0074] In the formula, R v,f,j is the similarity between the jth sub-category in the vth cluster and the fth suspected target scattered point in the jth sub-category, W v,f,j is the feature similarity between the jth sub-category in the vth cluster and the fth suspected target scatter point in the jth sub-category, S v,f,j is the change value of the overall direction of the jth sub-category in the vth cluster after adding the fth suspected target scattered point to the jth sub-category, θ v,f,j N is the change in the size of the jth sub-classification space in the vth cluster after adding the fth suspected target scattered point to the jth sub-classification. v,j,f is the number of suspected target scattered points in the jth sub-category in the vth cluster except the fth suspected target scattered point, S j,m,v After adding the mth suspected target scattered point to the jth sub-classification, the change value of the size of the jth sub-classification space in the vth cluster is, θ j,m,v is the change value of the overall direction of the jth sub-category in the vth cluster after adding the mth suspected target scattered point to the jth sub-category, and || is the absolute value.
[0075] In the above formula, S v,f,j ×θ v,f,j This is the distribution difference of the small classification range before and after adding the suspected target scattered points. It is the sum of the differences in the distribution of the sub-category range before and after the f-th suspected target scatter point is added to the j-th sub-category except the f-th suspected target scatter point. The smaller the value, the more similar the characteristics of the f-th suspected target scatter point are to those of other added suspected target scatter points, and the more it belongs to this sub-category.
[0076] When the similarity between the jth sub-category in the vth cluster and the fth suspected target scatter point in the jth sub-category is greater than the preset threshold, the fth suspected target scatter point in the jth sub-category is added to the jth sub-category in the vth cluster, thereby obtaining the updated classification of each sub-category in the vth cluster.
[0077] Step S005: Obtain useless data classification according to the number of small categories in each cluster, the distance between the updated center points of each small category, the number of data points in each small category and the number of suspected target scattered points finally added; eliminate the data in the useless data classification and complete data storage.
[0078] The useless data classification has a different distribution in the sample interval compared to the useful data classification. Because there are fewer useless data than useful data, and because the difference between useless data and useful data is large, the useless data will be distributed closer to the edge in the cluster and farther away from other useful data. The characteristics of different data points contained in the useless data classification are generally very different, and most of them become data scatter points during the initial classification. Therefore, the data points in the useless data classification are more likely to be added later as data scatter points. Therefore, the sub-classification can be screened for useless data classification based on the amount of data in the sub-classification, the distance from other sub-classifications, and the similarity of the data scatter points in the sub-classification and the sub-classification.
[0079] This implementation provides a method for calculating the uselessness of the e-th updated classification data in the v-th cluster as follows:
[0080]
[0081] Where U v,e The uselessness of updating the classification data for the eth in the vth cluster, n v,e Update the number of all data points in the e-th updated classification in the v-th cluster, n v is the number of updated categories in the vth cluster, l v,e,h is the distance between the center points of the e-th updated classification and the h-th updated classification in the v-th cluster, N v,e is the number of scattered data points in the e-th updated classification in the v-th cluster, R v,e,b is the homogeneity between the small category corresponding to the e-th updated category in the v-th cluster and the b-th data scatter point in the e-th updated category, and Sigmoid() is the normalization function.
[0082] When the uselessness of the Eth update classification in the vth cluster is greater than a preset threshold, it is determined that the Eth update classification belongs to the useless data classification. In this embodiment, the preset threshold is 0.5, which is used as an example for description.
[0083] Eliminate useless data categories, use hash storage method to store the remaining useful data, and use a single updated category as the amount of data stored at one time to complete data storage.
[0084] It should be noted that this embodiment reclassifies the data points in different clusters through density cluster analysis and identifies useless data classifications. After eliminating these useless data, the total data volume and the data transmission volume of a single time length can be effectively reduced, the security of stored data can be improved, and data loss can be avoided. This storage solution is not only economical and efficient, but also easy to expand and suitable for processing large-scale data sets.
[0085] It should be noted that: in this embodiment, when the denominator in the formula is 0, the denominator is set to 1 to ensure that the formula is valid, and this example is used for description.
[0086] The present invention also provides a personal information security storage system based on the Internet of Things, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program stored in the memory to implement the steps of the aforementioned personal information security storage method based on the Internet of Things.
[0087] So far, the present invention is completed.
[0088] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the principles of the present invention should be included in the protection scope of the present invention.
Claims
1. A method for secure storage of personal information based on the Internet of Things, characterized in that: The method comprises the following steps: Obtain a sample space of all information data points to be stored, and obtain several clusters of data points in the sample space; According to the distance between the data points in each cluster and the distance from the data point to the center point of the cluster, the classification consistency of any two data points in each cluster belonging to the same small category is obtained; according to the classification consistency of any two data points in each cluster belonging to the same small category, all the data points in each cluster are clustered to obtain several small categories and data scatter points in each cluster, and the small category contains several data points; According to the distance between each data scatter point in each cluster and the center point of each small classification, and the classification consistency that each data scatter point and the center point of each small classification belong to the same small classification, the feature similarity between each data scatter point in each cluster and each small classification and the suspected target scatter points of each small classification are obtained; According to the changes of each small classification before and after the suspected target scattered points of each small classification in each cluster are added, and the feature similarity between each data scattered point and each small classification, the similarity between each small classification in each cluster and each suspected target scattered point in each small classification is obtained; according to the similarity between each small classification in each cluster and each suspected target scattered point in each small classification, it is determined whether the suspected target scattered points of each small classification in each cluster are added; Obtain useless data classification based on the number of small categories in each cluster, the distance between the updated center points of each small category, the number of data points in each small category and the number of suspected target scattered points finally added; eliminate the data in the useless data classification and complete the data storage.
2. According to claim 1, the method for secure storage of personal information based on the Internet of Things is characterized in that: The method of obtaining the classification consistency of any two data points in each cluster belonging to the same sub-classification according to the distance between the data points in each cluster and the distance from the data point to the center point of the cluster includes the following specific steps: In the formula, Q v,k,y is the classification consistency that the kth data point and the yth data point in the vth cluster belong to the same sub-category, l v,k,y is the Euclidean distance between the kth data point and the yth data point in the vth cluster in the sample space, L v,k is the distance between the kth data point in the vth cluster and the center point of the vth cluster, L v,y is the distance between the yth data point in the vth cluster and the center point of the vth cluster, | | is the absolute value, and Sigmoid() is the normalization function.
3. According to the method for secure storage of personal information based on the Internet of Things according to claim 1, it is characterized in that: According to the distance between each data scatter point in each cluster and the center point of each small classification, and the classification consistency that each data scatter point and the center point of each small classification belong to the same small classification, the feature similarity between each data scatter point in each cluster and each small classification and the suspected target scatter point of each small classification are obtained, and the specific steps include the following: Where W v,i,j is the feature similarity between the i-th data point and the j-th small classification in the v-th cluster, l v,i,j is the Euclidean distance between the ith data point in the vth cluster and the jth small classification center point, Q v,i,j is the classification consistency that the i-th data scatter point in the v-th cluster and the j-th small classification center point belong to the same small classification, max(Q v,i,j ) is the maximum value of the classification consistency between the ith data point in the vth cluster and all data points in the jth sub-category belonging to the same sub-category; According to the feature similarity between each data scatter point and each small category, the suspected target scatter points of each small category are obtained.
4. According to claim 3, the method for secure storage of personal information based on the Internet of Things is characterized in that: The specific steps of obtaining the suspected target scattered points of each small category according to the feature similarity between each data scattered point and each small category are as follows: Among the feature similarities between the ith data point and all small categories in the vth cluster, a small category corresponding to the maximum feature similarity is selected, and the ith data point is used as the suspected target point of the small category corresponding to the maximum feature similarity.
5. According to the method for secure storage of personal information based on the Internet of Things according to claim 1, it is characterized in that: The specific steps of obtaining the similarity between each small category in each cluster and each suspected target scattered point in each small category according to the change of each small category before and after the suspected target scattered point in each small category in each cluster is added, and the feature similarity between each data scattered point and each small category, include the following: The principal component analysis method is used to obtain the projection difference on the principal component before and after the f-th suspected target scattered point of the j-th sub-category in the v-th cluster is added to the j-th sub-category to quantify the change value of the direction, and the change value is recorded as the change value of the overall direction of the j-th sub-category in the v-th cluster after the f-th suspected target scattered point is added to the j-th sub-category; Add the fth suspected target scattered point of the jth sub-classification to the center point of the jth sub-classification, and record it as the updated center point of the jth sub-classification; Calculate the absolute value of the difference between the distance from the fth suspected target scattered point of the jth sub-classification to the center point of the jth sub-classification and the distance to the updated center point of the jth sub-classification, and record the absolute value of the difference in distance as the change in the size of the jth sub-classification space in the vth cluster after the fth suspected target scattered point is added to the jth sub-classification; According to the change value of the overall direction and spatial size of each small classification in each cluster after adding each suspected target scattered point, and the feature similarity between each data scattered point and each small classification, the similarity between each small classification in each cluster and each suspected target scattered point in each small classification is obtained.
6. The method for secure storage of personal information based on the Internet of Things according to claim 5 is characterized in that: The method obtains the similarity between each small classification in each cluster and each suspected target scattered point in each small classification according to the change value of the overall direction and the change value of the spatial size of each small classification in each cluster after adding each suspected target scattered point, and the feature similarity between each data scattered point and each small classification, and includes the following specific steps: In the formula, R v,f,j is the similarity between the jth sub-category in the vth cluster and the fth suspected target scattered point in the jth sub-category, W v,f,j is the feature similarity between the jth sub-category in the vth cluster and the fth suspected target scatter point in the jth sub-category, S v,f,j is the change value of the overall direction of the jth sub-category in the vth cluster after adding the fth suspected target scattered point to the jth sub-category, θ v,f,j N is the change in the size of the jth sub-classification space in the vth cluster after adding the fth suspected target scattered point to the jth sub-classification. v,j,f is the number of suspected target scattered points in the jth sub-category in the vth cluster except the fth suspected target scattered point, S j,m,v After adding the mth suspected target scattered point to the jth sub-classification, the change value of the size of the jth sub-classification space in the vth cluster is, θ j,m,v is the change value of the overall direction of the jth sub-category in the vth cluster after adding the mth suspected target scattered point to the jth sub-category, and | | is the absolute value.
7. The method for secure storage of personal information based on the Internet of Things according to claim 1, characterized in that: The specific steps of judging whether to add the suspected target scattered points of each small category in each cluster cluster according to the similarity of each small category in each cluster cluster and each suspected target scattered point in each small category are as follows: When the similarity between the jth sub-classification in the vth cluster and the fth suspected target scatter point in the jth sub-classification is greater than the preset threshold, the fth suspected target scatter point in the jth sub-classification is added to the jth sub-classification in the vth cluster to obtain the updated classification of each sub-classification in the vth cluster.
8. The method for secure storage of personal information based on the Internet of Things according to claim 7, characterized in that: The specific steps of obtaining useless data classification according to the number of small categories in each cluster, the distance between the updated center points of each small category, the number of data points in each small category and the number of suspected target scattered points finally added are as follows: Where U v,e The uselessness of updating the classification data for the eth in the vth cluster, n v,e Update the number of all data points in the e-th updated classification in the v-th cluster, n v is the number of updated categories in the vth cluster, l v,e,h is the distance between the center points of the e-th updated classification and the h-th updated classification in the v-th cluster, N v,e is the number of scattered data points in the e-th updated classification in the v-th cluster, R v,e,b is the similarity between the small category corresponding to the e-th updated category in the v-th cluster and the b-th data scatter point in the e-th updated category, and Sigmoid() is the normalization function; Obtain useless data classification based on the uselessness of each updated classification data in each cluster.
9. The method for secure storage of personal information based on the Internet of Things according to claim 8, characterized in that: The specific steps of obtaining useless data classification according to the uselessness of each updated classification data in each cluster are as follows: When the uselessness of the e-th updated classification in the v-th cluster is greater than a preset threshold, it is determined that the e-th updated classification belongs to the useless data classification.
10. A personal information security storage system based on the Internet of Things, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the computer program is executed by a processor, the steps of the method for secure storage of personal information based on the Internet of Things as described in any one of claims 1 to 9 are implemented.
Citation Information
Patent Citations
Method and device for warning about abnormal behavior
CN109509327A
Method and system for processing abnormal data of operation index data of power distribution network
CN112101765A
Network abnormal flow analysis method and system based on Spark and clustering
CN112511547A
Passenger abnormity identification method and device based on DBSCAN
CN116933112A
Garbage power generation data integrated management system and storage method
CN117933571A
Cited By
Medical knowledge recommendation method based on pattern recognition, electronic equipment and medium
CN119884353A
Pattern recognition-based medical knowledge recommendation methods, electronic devices, and media
CN119884353B
