CN117725225A - Public data security circulation management method and system based on knowledge graph - Google Patents
Public data security circulation management method and system based on knowledge graph Download PDFInfo
- Publication number
- CN117725225A CN117725225A CN202311626967.6A CN202311626967A CN117725225A CN 117725225 A CN117725225 A CN 117725225A CN 202311626967 A CN202311626967 A CN 202311626967A CN 117725225 A CN117725225 A CN 117725225A
- Authority
- CN
- China
- Prior art keywords
- public
- knowledge graph
- current
- entity
- notification
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000007726 management method Methods 0.000 title claims abstract description 54
- 230000009977 dual effect Effects 0.000 claims abstract description 164
- 230000007246 mechanism Effects 0.000 claims description 41
- 238000012937 correction Methods 0.000 claims description 23
- 238000003058 natural language processing Methods 0.000 claims description 7
- 230000000295 complement effect Effects 0.000 claims description 6
- 238000010276 construction Methods 0.000 claims description 4
- 238000000034 method Methods 0.000 abstract description 11
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 9
- 230000006870 function Effects 0.000 description 7
- 230000008569 process Effects 0.000 description 5
- 238000004590 computer program Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 230000008439 repair process Effects 0.000 description 3
- 239000008399 tap water Substances 0.000 description 3
- 235000020679 tap water Nutrition 0.000 description 3
- 230000008451 emotion Effects 0.000 description 2
- 238000000605 extraction Methods 0.000 description 2
- 239000004973 liquid crystal related substance Substances 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000013523 data management Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000005611 electricity Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000011218 segmentation Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to the technical field of public data circulation, and discloses a public data security circulation management method and system based on a knowledge graph, wherein the method comprises the following steps: connecting the current notification knowledge graph to the current public knowledge graph to obtain a public knowledge graph to be checked, judging whether a dual attribute entity exists in the public knowledge graph to be checked, if so, summarizing a dual attribute entity set, receiving a corrected public notification set, carrying out entity relationship reconstruction on the public knowledge graph to be checked according to the corrected public notification set to obtain a target public knowledge graph, judging whether the dual attribute entity exists in the target public knowledge graph, and if not, carrying out joint release on the current public notification and the corrected public notification set. The invention mainly aims to solve the problem that notification information can not be updated in time when notifications issued by some departments are outdated due to the fact that the notifications issued by the public departments are possibly mutually contradicted or contradicted.
Description
Technical Field
The invention relates to a public data security circulation management method and system based on a knowledge graph, and belongs to the technical field of public data circulation.
Background
Public data is an important resource in data elements of China, and the public data refers to organizations with functions of managing public matters, such as: public service operators such as water supply, electricity supply, air supply and public transportation collect, manage and generate data during travel responsibilities or public service. The circulation process of the public data mainly comprises the steps of gathering the public data from a public management department, authorizing the data management department to a data operation unit, and providing the public data to the public by the data operation unit.
In the current public data publishing process, relevant notifications are mainly published by departments or institutions needing to publish the public data, when each department or institution publishes the notifications, the notifications are simply and autonomously published and are not published in cooperation with the relevant departments, and the situation that the notifications published by each public department possibly contradict or contradict each other can be caused, so that the notifications published by some departments are outdated, and the notification information cannot be updated timely is caused.
Disclosure of Invention
The invention provides a public data security circulation management method, a public data security circulation management system and a computer readable storage medium based on a knowledge graph, and mainly aims to solve the problem that notification information cannot be updated in time due to the fact that notifications issued by public departments possibly conflict or contradict each other.
In order to achieve the above object, the present invention provides a public data security circulation management method based on a knowledge graph, including:
receiving a current public notice input by a user, constructing a current notice knowledge graph according to the current public notice, and extracting a current entity node set from the current notice knowledge graph;
extracting a current notification associated entity set from the current entity node set according to a pre-constructed current public knowledge graph, wherein the current notification associated entity set refers to an entity set shared by the current notification knowledge graph and the current public knowledge graph;
connecting the current notification knowledge graph to the current public knowledge graph by using the current notification association entity set to obtain a public knowledge graph to be checked;
judging whether a preset dual attribute entity exists in the public knowledge graph to be checked, wherein the dual attribute entity refers to an entity with different relation attributes in the current notification knowledge graph and the current public knowledge graph;
If the dual attribute entity does not exist in the public knowledge graph to be checked, returning to the step of receiving the current public notification input by the user;
if the dual attribute entity exists in the public knowledge graph to be checked, summarizing all the dual attribute entities to obtain a dual attribute entity set;
identifying a history public notice set for releasing the dual attribute entity set and a history release mechanism set for releasing the history public notice set;
receiving a corrected public notification set of the history public notification set by the history issuing mechanism set, and carrying out entity relationship reconstruction on the public knowledge graph to be checked according to the corrected public notification set to obtain a target public knowledge graph;
judging whether a dual attribute entity exists in the target public knowledge graph;
if the dual attribute entity exists in the target public knowledge graph, returning to the step of receiving the corrected public notification set of the history public notification set by the history issuing mechanism set;
and if the target public knowledge graph does not have the dual attribute entity, the current public notification and the corrected public notification set are jointly released, so that public data security circulation management based on the knowledge graph is completed.
Optionally, the constructing a current notification knowledge graph according to the current public notification includes:
extracting a current public entity from the current public notice;
extracting related statement information of the current public entity by utilizing a pre-constructed public data information base;
combining the current public notice and the related statement information to obtain a current public complement notice;
and constructing the current notification knowledge graph according to the current public complement notification by using a pre-constructed natural language processing tool.
Optionally, the extracting the current notification association entity set from the current entity node set according to the pre-constructed current public knowledge graph includes:
sequentially extracting current entity nodes from the current entity node set;
judging whether the current entity node exists in the current public knowledge graph or not;
if the current entity node does not exist in the current public knowledge graph, returning to the step of sequentially extracting the current entity node in the current entity node set;
if the current entity node exists in the current public knowledge graph, classifying the current entity node as a current notification associated entity;
And summarizing all the current notification associated entities to obtain the current notification associated entity set.
Optionally, the connecting the current notification knowledge graph to the current public knowledge graph by using the current notification association entity set to obtain a public knowledge graph to be checked includes:
sequentially extracting current notification associated entities from the current notification associated entity set;
identifying a map-associated location of the current notification associated entity;
and using the map association position as an entity connection point, and using the current notification association entity to connect the current notification knowledge map to the current public knowledge map according to the entity connection point to obtain the public knowledge map to be checked.
Optionally, the determining whether the preset dual attribute entity exists in the public knowledge graph to be checked includes:
extracting current notification associated entities from the public knowledge graph to be checked in sequence;
judging whether the current notification association entity has two identical relationship attributes or not;
if the current notification association entity does not have the two same relationship attributes, returning to the step of sequentially extracting the current notification association entity from the public knowledge graph to be checked;
If the current notification associated entity has two identical relation attributes, extracting entity attribute values pointed by the two identical relation attributes to obtain two entity attribute values;
judging whether the current notification associated entity is a dual attribute entity or not according to the two entity attribute values;
judging whether the current notification associated entity is extracted;
if the current notification associated entity is not extracted, returning to the step of extracting the current notification associated entity in the public knowledge graph to be checked in sequence;
if the current notification associated entity is extracted, judging whether the current notification associated entity is a dual attribute entity;
if the current notification associated entity is a dual attribute entity, the dual attribute entity exists in the public knowledge graph to be checked;
if the current notification associated entity is not the dual attribute entity, the dual attribute entity does not exist in the public knowledge graph to be checked.
Optionally, the determining whether the current notification associated entity is a dual attribute entity according to the two entity attribute values includes:
judging whether the attribute values of the two entities are the same;
If the attribute values of the two entities are the same, the current notification associated entity is not a dual attribute entity;
and if the attribute values of the two entities are different, the current notification associated entity is a dual attribute entity.
Optionally, the identifying a set of historical public notifications that issues the set of dual attribute entities and a set of historical issue mechanisms for the set of historical public notifications includes:
sequentially extracting dual attribute entities from the dual attribute entity set, and identifying and publishing a history public notification set of the dual attribute entities;
a public notice regulation number set of the history public notice set is obtained, and a release mechanism set for releasing the history public notice set is obtained according to the public notice regulation number;
and summarizing the publishing mechanism sets of all the dual attribute entities to obtain the history publishing mechanism set.
Optionally, the reconstructing the entity relationship of the public knowledge graph to be checked according to the corrected public notification set to obtain a target public knowledge graph includes:
sequentially extracting correction public notices from the correction public notice set, and constructing a correction public knowledge graph according to the correction public notices;
identifying a history public notice corresponding to the corrected public notice, and acquiring a dual attribute entity set of the history public notice;
And correcting the public knowledge graph to be checked according to the corrected public knowledge graph by using the dual attribute entity set to obtain the target public knowledge graph.
Optionally, the correcting the public knowledge graph to be checked according to the corrected public knowledge graph by using the dual attribute entity set to obtain the target public knowledge graph includes:
acquiring a history public knowledge graph corresponding to the history public notification;
removing the historical public knowledge graph from the public knowledge graph to be checked to obtain a public knowledge graph to be complemented;
and connecting the corrected public knowledge graph to the public knowledge graph to be complemented by using the dual attribute entity set of the history public notice until all corrected public knowledge graphs are connected, so as to obtain the target public knowledge graph.
In order to solve the above problems, the present invention further provides a public data security circulation management system based on a knowledge graph, the system comprising:
the public knowledge graph construction module to be checked is used for receiving a current public notification input by a user, constructing a current notification knowledge graph according to the current public notification, and extracting a current entity node set from the current notification knowledge graph; extracting a current notification associated entity set from the current entity node set according to a pre-constructed current public knowledge graph, wherein the current notification associated entity set refers to an entity set shared by the current notification knowledge graph and the current public knowledge graph; connecting the current notification knowledge graph to the current public knowledge graph by using the current notification association entity set to obtain a public knowledge graph to be checked;
The dual attribute entity judging module is used for judging whether a preset dual attribute entity exists in the public knowledge graph to be checked or not, wherein the dual attribute entity refers to an entity with different relation attributes in the current notification knowledge graph and the current public knowledge graph; if the dual attribute entity does not exist in the public knowledge graph to be checked, returning to the step of receiving the current public notification input by the user;
the public knowledge graph correction module to be checked is used for summarizing all the dual attribute entities to obtain a dual attribute entity set if the dual attribute entities exist in the public knowledge graph to be checked; identifying a history public notice set for releasing the dual attribute entity set and a history release mechanism set for releasing the history public notice set; receiving a corrected public notification set of the history public notification set by the history issuing mechanism set, and carrying out entity relationship reconstruction on the public knowledge graph to be checked according to the corrected public notification set to obtain a target public knowledge graph;
the public notification joint release module is used for judging whether a dual attribute entity exists in the target public knowledge graph; if the dual attribute entity exists in the target public knowledge graph, returning to the step of receiving the corrected public notification set of the history public notification set by the history issuing mechanism set; and if the target public knowledge graph does not have the dual attribute entity, the current public notification and the corrected public notification set are jointly released.
In order to solve the above-mentioned problems, the present invention also provides an electronic apparatus including:
at least one processor; the method comprises the steps of,
a memory communicatively coupled to the at least one processor; wherein,
the memory stores instructions executable by the at least one processor to implement the knowledge-graph-based public data security circulation management method described above.
In order to solve the above-mentioned problems, the present invention further provides a computer readable storage medium having at least one instruction stored therein, the at least one instruction being executed by a processor in an electronic device to implement the above-mentioned public data security circulation management method based on a knowledge graph.
Compared with the problems in the background art, the method and the system firstly receive the current public notice input by the user, so that the current notice knowledge graph can be constructed according to the current public notice, at the moment, the current entity node set needs to be extracted from the current notice knowledge graph, and because the current public notice possibly exists a current notice associated entity set shared with the current entity node set and because the current public notice is generally the latest notice, the history public notice set corresponding to the current public notice is the old notice, and therefore, in order to discover the error, the current notice associated entity set needs to be connected with the current public notice graph to obtain the public notice to be checked, and then whether a preset dual attribute entity exists in the public notice graph to be checked or not is judged, and because the current public notice is generally the latest notice, the history public notice set corresponding to the current public notice is the old notice, and the history public notice set can be corrected through the dual attribute shared entity, and the history public notice entity to be checked can be released, and the history public notice is required to be corrected, and the history public notice set needs to be corrected if the history public notice is required to be corrected in the history public notice set, and finally, after the target public knowledge graph is obtained, checking the target public knowledge graph, judging whether a dual attribute entity exists in the target public knowledge graph or not according to the checking basis, if the dual attribute entity exists in the target public knowledge graph, indicating that the correction is wrong, returning the step of receiving the historical public notification set of the historical public notification set by the historical issuing mechanism, and carrying out correction again, and if the dual attribute entity does not exist in the target public knowledge graph, indicating that the correction is correct, and then, carrying out joint issuing on the current public notification and the corrected public notification set, thereby carrying out public data security circulation management based on the knowledge graph. Therefore, the public data security circulation management method, the public data security circulation management system, the public data security circulation management electronic equipment and the computer readable storage medium based on the knowledge graph mainly aim to solve the problem that notification information cannot be updated in time due to the fact that notifications issued by public departments possibly collide or contradict each other.
Drawings
Fig. 1 is a flow chart of a public data security circulation management method based on a knowledge graph according to an embodiment of the invention;
FIG. 2 is a functional block diagram of a public data security circulation management system based on a knowledge graph according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of an electronic device for implementing the public data security circulation management method based on a knowledge graph according to an embodiment of the present invention.
The achievement of the objects, functional features and advantages of the present invention will be further described with reference to the accompanying drawings, in conjunction with the embodiments.
Detailed Description
It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
The embodiment of the application provides a public data security circulation management method based on a knowledge graph. The implementation main body of the public data security circulation management method based on the knowledge graph comprises at least one of a server, a terminal and the like which can be configured to implement the method provided by the embodiment of the application. In other words, the public data security circulation management method based on the knowledge graph can be executed by software or hardware installed in the terminal device or the server device. The service end includes but is not limited to: a single server, a server cluster, a cloud server or a cloud server cluster, and the like.
Example 1:
referring to fig. 1, a flow chart of a public data security circulation management method based on a knowledge graph according to an embodiment of the invention is shown. In this embodiment, the public data security circulation management method based on the knowledge graph includes:
s1, receiving a current public notice input by a user, constructing a current notice knowledge graph according to the current public notice, and extracting a current entity node set from the current notice knowledge graph.
The current public notice refers to a public notice that is released at present, for example, the public notice that is released by the road administration on 1 month and 1 day: the Shen Chunlu is to carry out water pipe rush repair on 1 month 5 days to 1 month 6 days, 11 buses, 7 buses and 3 buses cannot pass during the period, and tap water in a riverbank district is stopped. "
It can be understood that the current notification knowledge graph refers to a knowledge graph constructed according to the attributes and relationships of the entities in the current public notification. For example: the entities in the current notification knowledge graph may be: shen Chunlu, a water pipe, 1 month 5 days-1 month 6 days, 11 buses, 7 buses, 3 buses, a riverside district and tap water; the attributes may be: rush repair and water cut-off; the relationship may be: the traffic is impossible. Namely, the relationship between the Shen Chunlu and the 11 buses, the 7 buses and the 3 buses is "no-going"; the attribute of the water pipe is rush repair; the relation between the 'river bank district' and the 'tap water' is 'water cut-off', etc. The current notification knowledge graph may also include entities, attributes or relationships that are not mentioned in the current public notification and are fixed by default, such as: the relation between the riverbank cell and the bus is that the bus is switched on; the relationship between the "riverside cell" and the "Shen Chunlu" is "close.
The current entity node set refers to the entities in the current notification knowledge graph.
In the embodiment of the present invention, the constructing a current notification knowledge graph according to the current public notification includes:
extracting a current public entity from the current public notice;
extracting related statement information of the current public entity by utilizing a pre-constructed public data information base;
combining the current public notice and the related statement information to obtain a current public complement notice;
and constructing the current notification knowledge graph according to the current public complement notification by using a pre-constructed natural language processing tool.
It is understood that the current public entity refers to an entity in the current public notice. The public data information base refers to pre-constructed default fixed information, and the related statement information can be: the residential building of the riverbank district is 30 blocks, and the riverbank district is adjacent to Shen Chunlu. The natural language processing tool can be a Jiagu natural language processing tool, and Jiag u is trained by using a large-scale corpus, so that the natural language processing tool can provide common natural language processing functions such as Chinese word segmentation, part-of-speech tagging, named entity recognition, emotion analysis, knowledge graph relation extraction, keyword extraction, text abstract, new word discovery, emotion analysis, text clustering and the like.
S2, extracting a current notification associated entity set from the current entity node set according to a pre-constructed current public knowledge graph, wherein the current notification associated entity set refers to an entity set shared by the current notification knowledge graph and the current public knowledge graph.
In detail, the current public knowledge graph refers to a current knowledge graph constructed from public notices previously issued by respective public institutions. The current notification associated entity set refers to an entity set which exists in the current public knowledge graph and the current entity node set at the same time.
In the embodiment of the present invention, the extracting the current notification association entity set from the current entity node set according to the pre-constructed current public knowledge graph includes:
sequentially extracting current entity nodes from the current entity node set;
judging whether the current entity node exists in the current public knowledge graph or not;
if the current entity node does not exist in the current public knowledge graph, returning to the step of sequentially extracting the current entity node in the current entity node set;
if the current entity node exists in the current public knowledge graph, classifying the current entity node as a current notification associated entity;
And summarizing all the current notification associated entities to obtain the current notification associated entity set.
And S3, connecting the current notification knowledge graph to the current public knowledge graph by using the current notification association entity set to obtain a public knowledge graph to be checked.
It can be understood that the public knowledge graph to be checked refers to a knowledge graph obtained by combining the current notification knowledge graph and the current public knowledge graph.
In the embodiment of the present invention, the step of connecting the current notification knowledge graph to the current public knowledge graph by using the current notification association entity set to obtain the public knowledge graph to be checked includes:
sequentially extracting current notification associated entities from the current notification associated entity set;
identifying a map-associated location of the current notification associated entity;
and using the map association position as an entity connection point, and using the current notification association entity to connect the current notification knowledge map to the current public knowledge map according to the entity connection point to obtain the public knowledge map to be checked.
In detail, the map-associated location refers to a location of the current notification-associated entity in the current public knowledge map.
It may be appreciated that the current notification knowledge-graph may be connected to the current common knowledge-graph by the current notification association entity, for example: when the current notification association entity is "Shen Chunlu", "11 buses", the current notification knowledge graph can be connected with the current public knowledge graph through "Shen Chunlu", "11 buses".
Further, when the current notification knowledge graph is connected to the current public knowledge graph according to the entity connection point by using the current notification association entity, the current notification knowledge graph or the current notification association entity in the current public knowledge graph needs to be deleted first because the current notification association entity exists in both the current notification knowledge graph and the current public knowledge graph, and then the current notification knowledge graph is connected with the current public knowledge graph. For example: when the current notification association entity is Shen Chunlu, an entity which has a relation of "no passable" with "Shen Chunlu" in the current notification knowledge graph is 11 buses ", and an entity which has a relation of" no passable "with" Shen Chunlu "is 7 buses, etc.; the entity with the relation of "passable" with "Shen Chunlu" in the current public knowledge graph is "11 buses", and the entity with the relation of "adjacent" with "Shen Chunlu" is "riverbank cell", etc., then "Shen Chunlu" in the current notification knowledge graph can be deleted first, and "Shen Chunlu" will not exist in the current notification knowledge graph, but the relation of "passable" with "Shen Chunlu", the relation of "11 buses" and "7 buses" connected with "Shen Chunlu" through "passable" also exist, so that "11 buses" and "7 buses" through the relation of "passable" are connected to "Shen Chunlu" in the current public knowledge graph. The map association position is used for identifying a specific connection position of the current notification association entity in the connection process, so that the current notification knowledge map is conveniently connected to the current public knowledge map.
And S4, judging whether a preset dual attribute entity exists in the public knowledge graph to be checked.
Further, the dual attribute entity refers to an entity with different relationship attributes in the current notification knowledge graph and the current public knowledge graph. For example: the notification of the traffic department is issued before the water pipe rush-repair is not performed, so that the traffic relation between 'Shen Chunlu' and '11 buses', '7 buses', '3 buses' in the current public knowledge graph is 'passable', and the traffic relation between 'Shen Chunlu' and '11 buses', '7 buses', '3 buses' in the current notification knowledge graph is 'non-passable', and the 'Shen Chunlu' is a dual attribute entity because of the 'spring Shen Lu' having the two relation attributes of 'passable' and 'non-passable'.
In the embodiment of the present invention, the determining whether the preset dual attribute entity exists in the public knowledge graph to be checked includes:
extracting current notification associated entities from the public knowledge graph to be checked in sequence;
Judging whether the current notification association entity has two identical relationship attributes or not;
if the current notification association entity does not have the two same relationship attributes, returning to the step of sequentially extracting the current notification association entity from the public knowledge graph to be checked;
if the current notification associated entity has two identical relation attributes, extracting entity attribute values pointed by the two identical relation attributes to obtain two entity attribute values;
judging whether the current notification associated entity is a dual attribute entity or not according to the two entity attribute values;
judging whether the current notification associated entity is extracted;
if the current notification associated entity is not extracted, returning to the step of extracting the current notification associated entity in the public knowledge graph to be checked in sequence;
if the current notification associated entity is extracted, judging whether the current notification associated entity is a dual attribute entity;
if the current notification associated entity is a dual attribute entity, the dual attribute entity exists in the public knowledge graph to be checked;
if the current notification associated entity is not the dual attribute entity, the dual attribute entity does not exist in the public knowledge graph to be checked.
Further, the relationship attribute refers to a relationship attribute of the current notification association entity, for example: the traffic relation between Shen Chunlu and 11 buses in the current notification knowledge graph is traffic, the traffic relation between Shen Chunlu and 11 buses in the current public knowledge graph is traffic-impossible, the relation attribute is traffic relation, and the two entity attribute values are traffic-impossible and traffic-impossible respectively.
In the embodiment of the present invention, the determining whether the current notification associated entity is a dual attribute entity according to the two entity attribute values includes:
judging whether the attribute values of the two entities are the same;
if the attribute values of the two entities are the same, the current notification associated entity is not a dual attribute entity;
and if the attribute values of the two entities are different, the current notification associated entity is a dual attribute entity.
And if the dual attribute entity does not exist in the public knowledge graph to be checked, returning to the step of receiving the current public notification input by the user.
It can be understood that if the dual attribute entity does not exist in the public knowledge graph to be checked, it indicates that there is no conflict between the current notification knowledge graph of the current public notification and the current public knowledge graph. For example: the water department issues notifications that are not related to Shen Chunlu traffic. At this point, the next public notice can be continued to be waited for, and the judgment can be continued.
And if the dual attribute entity exists in the public knowledge graph to be checked, executing S5, and summarizing all the dual attribute entities to obtain a dual attribute entity set.
Further, the dual attribute entity refers to an entity with unequal information in the public knowledge graph to be checked, so that all the entities need to be extracted for omnibearing identification and correction.
S6, identifying a history public notification set for releasing the dual attribute entity set and a history release mechanism set for releasing the history public notification set.
It should be appreciated that the set of historical public notifications refers to historical public notifications that have been issued by any one of the dual attribute entities in the set of dual attribute entities, and the set of historical issuing authorities refers to a set of authorities that issued the historical public notifications.
In the embodiment of the present invention, the identifying and publishing the history public notification set of the dual attribute entity set and the history publishing mechanism set of the history public notification set include:
sequentially extracting dual attribute entities from the dual attribute entity set, and identifying and publishing a history public notification set of the dual attribute entities;
a public notice regulation number set of the history public notice set is obtained, and a release mechanism set for releasing the history public notice set is obtained according to the public notice regulation number;
And summarizing the publishing mechanism sets of all the dual attribute entities to obtain the history publishing mechanism set.
The common notification treaty number set may be explained to refer to a notification treaty number set of each of the historical common notifications in the historical common notification set, for example: the public notice regulations of the historical public notices can be 0A-89, which refers to the 89 th public notice issued by 0A department.
S7, receiving a corrected public notification set of the history public notification set by the history issuing mechanism set, and carrying out entity relationship reconstruction on the public knowledge graph to be checked according to the corrected public notification set to obtain a target public knowledge graph.
Further, since the published notifications of the historical publication mechanism set of the published dual attribute entity have been disjointed from the current latest notifications, for example: the publication notice of the history issue mechanism set indicates that the traffic state of "Shen Chunlu" is "passable", and the current public notice of the water supply department indicates that the traffic state of "Shen Chunlu" is "not passable", at which time the history issue mechanism set is required to correct the history public notice previously issued including the dual attribute entity.
In the embodiment of the present invention, the reconstructing entity relationship of the public knowledge graph to be checked according to the corrected public notification set to obtain a target public knowledge graph includes:
Sequentially extracting correction public notices from the correction public notice set, and constructing a correction public knowledge graph according to the correction public notices;
identifying a history public notice corresponding to the corrected public notice, and acquiring a dual attribute entity set of the history public notice;
and correcting the public knowledge graph to be checked according to the corrected public knowledge graph by using the dual attribute entity set to obtain the target public knowledge graph.
In the embodiment of the present invention, the correcting the public knowledge graph to be checked according to the corrected public knowledge graph by using the dual attribute entity set to obtain the target public knowledge graph includes:
acquiring a history public knowledge graph corresponding to the history public notification;
removing the historical public knowledge graph from the public knowledge graph to be checked to obtain a public knowledge graph to be complemented;
and connecting the corrected public knowledge graph to the public knowledge graph to be complemented by using the dual attribute entity set of the history public notice until all corrected public knowledge graphs are connected, so as to obtain the target public knowledge graph.
In detail, in order to modify the public knowledge graph to be checked by using the modified public notification conveniently, the incorrect historical public knowledge graph needs to be removed from the public knowledge graph to be checked, then the correct modified public knowledge graph is connected to the public knowledge graph to be complemented until all the modified public knowledge graphs are connected to obtain the target public knowledge graph, and the target public knowledge graph is connected by using a dual attribute entity set in the connection process.
S8, judging whether a dual attribute entity exists in the target public knowledge graph.
It should be understood that, after the target public knowledge graph is obtained, the target public knowledge graph needs to be further checked, that is, whether the dual attribute entity exists in the target public knowledge graph is judged again.
And if the dual attribute entity exists in the target public knowledge graph, returning to the step of receiving the revised public notice set of the history public notice set by the history issuing mechanism set.
It can be explained that if the dual attribute entity exists in the target public knowledge graph, it indicates that the corrected public notification has an error, and the corrected public notification needs to be received again, that is, the step of receiving the corrected public notification set of the history public notification set by the history issuing authority set is returned.
And if the target public knowledge graph does not have the dual attribute entity, executing S9 to jointly release the current public notification and the corrected public notification set, and completing public data security circulation management based on the knowledge graph.
It can be understood that, in order to achieve timeliness of notification release, notifications released by each department should be released simultaneously, so as to ensure that notifications of each department do not have outdated phenomena. Thereby ensuring that notifications issued by various departments are simultaneous and correct. Thereby ensuring authority of the notification.
Compared with the problems in the background art, the method and the system firstly receive the current public notice input by the user, so that the current notice knowledge graph can be constructed according to the current public notice, at the moment, the current entity node set needs to be extracted from the current notice knowledge graph, and because the current public notice possibly exists a current notice associated entity set shared with the current entity node set and because the current public notice is generally the latest notice, the history public notice set corresponding to the current public notice is the old notice, and therefore, in order to discover the error, the current notice associated entity set needs to be connected with the current public notice graph to obtain the public notice to be checked, and then whether a preset dual attribute entity exists in the public notice graph to be checked or not is judged, and because the current public notice is generally the latest notice, the history public notice set corresponding to the current public notice is the old notice, and the history public notice set can be corrected through the dual attribute shared entity, and the history public notice entity to be checked can be released, and the history public notice is required to be corrected, and the history public notice set needs to be corrected if the history public notice is required to be corrected in the history public notice set, and finally, after the target public knowledge graph is obtained, checking the target public knowledge graph, judging whether a dual attribute entity exists in the target public knowledge graph or not according to the checking basis, if the dual attribute entity exists in the target public knowledge graph, indicating that the correction is wrong, returning the step of receiving the historical public notification set of the historical public notification set by the historical issuing mechanism, and carrying out correction again, and if the dual attribute entity does not exist in the target public knowledge graph, indicating that the correction is correct, and then, carrying out joint issuing on the current public notification and the corrected public notification set, thereby carrying out public data security circulation management based on the knowledge graph. Therefore, the public data security circulation management method, the public data security circulation management system, the public data security circulation management electronic equipment and the computer readable storage medium based on the knowledge graph mainly aim to solve the problem that notification information cannot be updated in time due to the fact that notifications issued by public departments possibly collide or contradict each other.
Example 2:
fig. 2 is a functional block diagram of a public data security circulation management system based on a knowledge graph according to an embodiment of the present invention.
The public data security circulation management system 100 based on the knowledge graph can be installed in electronic equipment. According to the implementation function, the public data security circulation management system 100 based on the knowledge graph may include a public knowledge graph construction module 101 to be checked, a dual attribute entity judgment module 102, a public knowledge graph correction module 103 to be checked, and a public notification joint release module 104. The module of the invention, which may also be referred to as a unit, refers to a series of computer program segments, which are stored in the memory of the electronic device, capable of being executed by the processor of the electronic device and of performing a fixed function.
The public knowledge graph construction module 101 to be checked is configured to receive a current public notification input by a user, construct a current notification knowledge graph according to the current public notification, and extract a current entity node set from the current notification knowledge graph; extracting a current notification associated entity set from the current entity node set according to a pre-constructed current public knowledge graph, wherein the current notification associated entity set refers to an entity set shared by the current notification knowledge graph and the current public knowledge graph; connecting the current notification knowledge graph to the current public knowledge graph by using the current notification association entity set to obtain a public knowledge graph to be checked;
The dual attribute entity judging module 102 is configured to judge whether a preset dual attribute entity exists in the public knowledge graph to be checked, where the dual attribute entity refers to an entity having different relationship attributes in the current notification knowledge graph and the current public knowledge graph; if the dual attribute entity does not exist in the public knowledge graph to be checked, returning to the step of receiving the current public notification input by the user;
the public knowledge graph correction module to be checked 103 is configured to aggregate all the dual attribute entities if the dual attribute entities exist in the public knowledge graph to be checked, so as to obtain a dual attribute entity set; identifying a history public notice set for releasing the dual attribute entity set and a history release mechanism set for releasing the history public notice set; receiving a corrected public notification set of the history public notification set by the history issuing mechanism set, and carrying out entity relationship reconstruction on the public knowledge graph to be checked according to the corrected public notification set to obtain a target public knowledge graph;
the public notification joint publishing module 104 is configured to determine whether a dual attribute entity exists in the target public knowledge graph; if the dual attribute entity exists in the target public knowledge graph, returning to the step of receiving the corrected public notification set of the history public notification set by the history issuing mechanism set; and if the target public knowledge graph does not have the dual attribute entity, the current public notification and the corrected public notification set are jointly released.
In detail, the modules in the public data security circulation management system 100 based on a knowledge graph in the embodiment of the present invention use the same technical means as the public data security circulation management method based on a knowledge graph in fig. 1, and can generate the same technical effects, which are not described herein.
Example 3:
fig. 3 is a schematic structural diagram of an electronic device for implementing a public data security circulation management method based on a knowledge graph according to an embodiment of the present invention.
The electronic device 1 may comprise a processor 10, a memory 11, a bus 12 and a communication interface 13, and may further comprise a computer program stored in the memory 11 and executable on the processor 10, such as a public data security circulation management program based on a knowledge graph.
The memory 11 includes at least one type of readable storage medium, including flash memory, a mobile hard disk, a multimedia card, a card memory (e.g., SD or DX memory, etc.), a magnetic memory, a magnetic disk, an optical disk, etc. The memory 11 may in some embodiments be an internal storage unit of the electronic device 1, such as a removable hard disk of the electronic device 1. The memory 11 may in other embodiments also be an external storage device of the electronic device 1, such as a plug-in mobile hard disk, a smart memory card (SmartMediaCard, SMC), a secure digital (SecureDigital, SD) card, a flash card (FlashCard) or the like, provided on the electronic device 1. Further, the memory 11 may also include both an internal storage unit and an external storage device of the electronic device 1. The memory 11 may be used not only for storing application software installed in the electronic device 1 and various types of data, such as codes of public data security circulation management programs based on knowledge patterns, but also for temporarily storing data that has been output or is to be output.
The processor 10 may be comprised of integrated circuits in some embodiments, for example, a single packaged integrated circuit, or may be comprised of multiple integrated circuits packaged with the same or different functions, including one or more central processing units (CentralProcessingunit, CPU), microprocessors, digital processing chips, graphics processors, a combination of various control chips, and the like. The processor 10 is a control unit (control unit) of the electronic device, connects various parts of the entire electronic device using various interfaces and lines, executes or executes programs or modules (e.g., a public data security circulation management program based on a knowledge graph, etc.) stored in the memory 11, and invokes data stored in the memory 11 to perform various functions of the electronic device 1 and process data.
The bus may be an Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The bus may be classified as an address bus, a data bus, a control bus, etc. The bus is arranged to enable a connection communication between the memory 11 and at least one processor 10 etc.
Fig. 3 shows only an electronic device with components, it being understood by a person skilled in the art that the structure shown in fig. 3 does not constitute a limitation of the electronic device 1, and may comprise fewer or more components than shown, or may combine certain components, or may be arranged in different components.
Although not shown, for example, the electronic device 1 may also include a power source (such as a battery) for powering the various components,
preferably, the power supply may be logically connected to the at least one processor 10 through a power management system, so that functions of charge management, discharge management, and power consumption management are implemented through the power management system. The power supply may also include one or more of any of a direct current or alternating current power supply, a recharging system, a power failure detection circuit, a power converter or inverter, a power status indicator, and the like. The electronic device 1 may further include various sensors, bluetooth modules, wi-Fi modules, etc., which will not be described herein.
Further, the electronic device 1 may also comprise a network interface, optionally the network interface may comprise a wired interface and/or a wireless interface (e.g. WI-FI interface, bluetooth interface, etc.), typically used for establishing a communication connection between the electronic device 1 and other electronic devices.
The electronic device 1 may optionally further comprise a user interface, which may be a Display, an input unit, such as a Keyboard (Keyboard), or a standard wired interface, a wireless interface. Alternatively, in some embodiments, the display may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, an OLED (organic light-emitting diode) touch, or the like. The display may also be referred to as a display screen or display unit, as appropriate, for displaying information processed in the electronic device 1 and for displaying a visual user interface.
It should be understood that the embodiments described are for illustrative purposes only and are not limited to this configuration in the scope of the patent application.
The public data security circulation management program based on a knowledge graph stored in the memory 11 in the electronic device 1 is a combination of a plurality of instructions, and when running in the processor 10, it can be implemented that:
receiving a current public notice input by a user, constructing a current notice knowledge graph according to the current public notice, and extracting a current entity node set from the current notice knowledge graph;
Extracting a current notification associated entity set from the current entity node set according to a pre-constructed current public knowledge graph, wherein the current notification associated entity set refers to an entity set shared by the current notification knowledge graph and the current public knowledge graph;
connecting the current notification knowledge graph to the current public knowledge graph by using the current notification association entity set to obtain a public knowledge graph to be checked;
judging whether a preset dual attribute entity exists in the public knowledge graph to be checked, wherein the dual attribute entity refers to an entity with different relation attributes in the current notification knowledge graph and the current public knowledge graph;
if the dual attribute entity does not exist in the public knowledge graph to be checked, returning to the step of receiving the current public notification input by the user;
if the dual attribute entity exists in the public knowledge graph to be checked, summarizing all the dual attribute entities to obtain a dual attribute entity set;
identifying a history public notice set for releasing the dual attribute entity set and a history release mechanism set for releasing the history public notice set;
receiving a corrected public notification set of the history public notification set by the history issuing mechanism set, and carrying out entity relationship reconstruction on the public knowledge graph to be checked according to the corrected public notification set to obtain a target public knowledge graph;
Judging whether a dual attribute entity exists in the target public knowledge graph;
if the dual attribute entity exists in the target public knowledge graph, returning to the step of receiving the corrected public notification set of the history public notification set by the history issuing mechanism set;
and if the target public knowledge graph does not have the dual attribute entity, the current public notification and the corrected public notification set are jointly released, so that public data security circulation management based on the knowledge graph is completed.
Specifically, the specific implementation method of the above instruction by the processor 10 may refer to descriptions of related steps in the corresponding embodiments of fig. 1 to 2, which are not repeated herein.
Further, the modules/units integrated in the electronic device 1 may be stored in a computer readable storage medium if implemented in the form of software functional units and sold or used as separate products. The computer readable storage medium may be volatile or nonvolatile. For example, the computer readable medium may include: any entity or system capable of carrying the computer program code, a recording medium, a U disk, a removable hard disk, a magnetic disk, an optical disk, a computer memory, a Read-only memory (ROM).
The present invention also provides a computer readable storage medium storing a computer program which, when executed by a processor of an electronic device, can implement:
receiving a current public notice input by a user, constructing a current notice knowledge graph according to the current public notice, and extracting a current entity node set from the current notice knowledge graph;
extracting a current notification associated entity set from the current entity node set according to a pre-constructed current public knowledge graph, wherein the current notification associated entity set refers to an entity set shared by the current notification knowledge graph and the current public knowledge graph;
connecting the current notification knowledge graph to the current public knowledge graph by using the current notification association entity set to obtain a public knowledge graph to be checked;
judging whether a preset dual attribute entity exists in the public knowledge graph to be checked, wherein the dual attribute entity refers to an entity with different relation attributes in the current notification knowledge graph and the current public knowledge graph;
if the dual attribute entity does not exist in the public knowledge graph to be checked, returning to the step of receiving the current public notification input by the user;
If the dual attribute entity exists in the public knowledge graph to be checked, summarizing all the dual attribute entities to obtain a dual attribute entity set;
identifying a history public notice set for releasing the dual attribute entity set and a history release mechanism set for releasing the history public notice set;
receiving a corrected public notification set of the history public notification set by the history issuing mechanism set, and carrying out entity relationship reconstruction on the public knowledge graph to be checked according to the corrected public notification set to obtain a target public knowledge graph;
judging whether a dual attribute entity exists in the target public knowledge graph;
if the dual attribute entity exists in the target public knowledge graph, returning to the step of receiving the corrected public notification set of the history public notification set by the history issuing mechanism set;
and if the target public knowledge graph does not have the dual attribute entity, the current public notification and the corrected public notification set are jointly released, so that public data security circulation management based on the knowledge graph is completed.
The modules described as separate components may or may not be physically separate, and components shown as modules may or may not be physical units, may be located in one place, or may be distributed over multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional module in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units can be realized in a form of hardware or a form of hardware and a form of software functional modules.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential characteristics thereof.
Finally, it should be noted that the above-mentioned embodiments are merely for illustrating the technical solution of the present invention and not for limiting the same, and although the present invention has been described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that modifications and equivalents may be made to the technical solution of the present invention without departing from the spirit and scope of the technical solution of the present invention.
Claims (10)
1. The public data security circulation management method based on the knowledge graph is characterized by comprising the following steps of:
receiving a current public notice input by a user, constructing a current notice knowledge graph according to the current public notice, and extracting a current entity node set from the current notice knowledge graph;
Extracting a current notification associated entity set from the current entity node set according to a pre-constructed current public knowledge graph, wherein the current notification associated entity set refers to an entity set shared by the current notification knowledge graph and the current public knowledge graph;
connecting the current notification knowledge graph to the current public knowledge graph by using the current notification association entity set to obtain a public knowledge graph to be checked;
judging whether a preset dual attribute entity exists in the public knowledge graph to be checked, wherein the dual attribute entity refers to an entity with different relation attributes in the current notification knowledge graph and the current public knowledge graph;
if the dual attribute entity does not exist in the public knowledge graph to be checked, returning to the step of receiving the current public notification input by the user;
if the dual attribute entity exists in the public knowledge graph to be checked, summarizing all the dual attribute entities to obtain a dual attribute entity set;
identifying a history public notice set for releasing the dual attribute entity set and a history release mechanism set for releasing the history public notice set;
receiving a corrected public notification set of the history public notification set by the history issuing mechanism set, and carrying out entity relationship reconstruction on the public knowledge graph to be checked according to the corrected public notification set to obtain a target public knowledge graph;
Judging whether a dual attribute entity exists in the target public knowledge graph;
if the dual attribute entity exists in the target public knowledge graph, returning to the step of receiving the corrected public notification set of the history public notification set by the history issuing mechanism set;
and if the target public knowledge graph does not have the dual attribute entity, the current public notification and the corrected public notification set are jointly released, so that public data security circulation management based on the knowledge graph is completed.
2. The public data security circulation management method based on a knowledge graph according to claim 1, wherein the constructing a current notification knowledge graph according to the current public notification comprises:
extracting a current public entity from the current public notice;
extracting related statement information of the current public entity by utilizing a pre-constructed public data information base;
combining the current public notice and the related statement information to obtain a current public complement notice;
and constructing the current notification knowledge graph according to the current public complement notification by using a pre-constructed natural language processing tool.
3. The public data security circulation management method based on a knowledge graph according to claim 1, wherein the extracting a current notification associated entity set from the current entity node set according to a pre-constructed current public knowledge graph comprises:
Sequentially extracting current entity nodes from the current entity node set;
judging whether the current entity node exists in the current public knowledge graph or not;
if the current entity node does not exist in the current public knowledge graph, returning to the step of sequentially extracting the current entity node in the current entity node set;
if the current entity node exists in the current public knowledge graph, classifying the current entity node as a current notification associated entity;
and summarizing all the current notification associated entities to obtain the current notification associated entity set.
4. The public data security circulation management method based on a knowledge graph according to claim 1, wherein the connecting the current notification knowledge graph to the current public knowledge graph by using the current notification association entity set to obtain the public knowledge graph to be checked comprises:
sequentially extracting current notification associated entities from the current notification associated entity set;
identifying a map-associated location of the current notification associated entity;
and using the map association position as an entity connection point, and using the current notification association entity to connect the current notification knowledge map to the current public knowledge map according to the entity connection point to obtain the public knowledge map to be checked.
5. The public data security circulation management method based on a knowledge graph as set forth in claim 4, wherein the determining whether the public knowledge graph to be checked has the preset dual attribute entity includes:
extracting current notification associated entities from the public knowledge graph to be checked in sequence;
judging whether the current notification association entity has two identical relationship attributes or not;
if the current notification association entity does not have the two same relationship attributes, returning to the step of sequentially extracting the current notification association entity from the public knowledge graph to be checked;
if the current notification associated entity has two identical relation attributes, extracting entity attribute values pointed by the two identical relation attributes to obtain two entity attribute values;
judging whether the current notification associated entity is a dual attribute entity or not according to the two entity attribute values;
judging whether the current notification associated entity is extracted;
if the current notification associated entity is not extracted, returning to the step of extracting the current notification associated entity in the public knowledge graph to be checked in sequence;
if the current notification associated entity is extracted, judging whether the current notification associated entity is a dual attribute entity;
If the current notification associated entity is a dual attribute entity, the dual attribute entity exists in the public knowledge graph to be checked;
if the current notification associated entity is not the dual attribute entity, the dual attribute entity does not exist in the public knowledge graph to be checked.
6. The knowledge-graph-based public data security circulation management method of claim 5, wherein said determining whether the current notification associated entity is a dual attribute entity according to the two entity attribute values comprises:
judging whether the attribute values of the two entities are the same;
if the attribute values of the two entities are the same, the current notification associated entity is not a dual attribute entity;
and if the attribute values of the two entities are different, the current notification associated entity is a dual attribute entity.
7. The knowledge-based public data security circulation management method of claim 1, wherein the identifying a set of historical public notifications that issue the set of dual attribute entities and a set of historical issue mechanisms of the set of historical public notifications comprises:
sequentially extracting dual attribute entities from the dual attribute entity set, and identifying and publishing a history public notification set of the dual attribute entities;
A public notice regulation number set of the history public notice set is obtained, and a release mechanism set for releasing the history public notice set is obtained according to the public notice regulation number;
and summarizing the publishing mechanism sets of all the dual attribute entities to obtain the history publishing mechanism set.
8. The public data security circulation management method based on a knowledge graph according to claim 1, wherein the performing entity relationship reconstruction on the public knowledge graph to be checked according to the corrected public notification set to obtain a target public knowledge graph comprises:
sequentially extracting correction public notices from the correction public notice set, and constructing a correction public knowledge graph according to the correction public notices;
identifying a history public notice corresponding to the corrected public notice, and acquiring a dual attribute entity set of the history public notice;
and correcting the public knowledge graph to be checked according to the corrected public knowledge graph by using the dual attribute entity set to obtain the target public knowledge graph.
9. The public data security circulation management method based on a knowledge graph according to claim 8, wherein the correcting the public knowledge graph to be checked according to the corrected public knowledge graph by using the dual attribute entity set to obtain the target public knowledge graph includes:
Acquiring a history public knowledge graph corresponding to the history public notification;
removing the historical public knowledge graph from the public knowledge graph to be checked to obtain a public knowledge graph to be complemented;
and connecting the corrected public knowledge graph to the public knowledge graph to be complemented by using the dual attribute entity set of the history public notice until all corrected public knowledge graphs are connected, so as to obtain the target public knowledge graph.
10. A public data security circulation management system based on a knowledge graph, the system comprising:
the public knowledge graph construction module to be checked is used for receiving a current public notification input by a user, constructing a current notification knowledge graph according to the current public notification, and extracting a current entity node set from the current notification knowledge graph; extracting a current notification associated entity set from the current entity node set according to a pre-constructed current public knowledge graph, wherein the current notification associated entity set refers to an entity set shared by the current notification knowledge graph and the current public knowledge graph;
connecting the current notification knowledge graph to the current public knowledge graph by using the current notification association entity set to obtain a public knowledge graph to be checked;
The dual attribute entity judging module is used for judging whether a preset dual attribute entity exists in the public knowledge graph to be checked or not, wherein the dual attribute entity refers to an entity with different relation attributes in the current notification knowledge graph and the current public knowledge graph; if the dual attribute entity does not exist in the public knowledge graph to be checked, returning to the step of receiving the current public notification input by the user;
the public knowledge graph correction module to be checked is used for summarizing all the dual attribute entities to obtain a dual attribute entity set if the dual attribute entities exist in the public knowledge graph to be checked; identifying a history public notice set for releasing the dual attribute entity set and a history release mechanism set for releasing the history public notice set; receiving a corrected public notification set of the history public notification set by the history issuing mechanism set, and carrying out entity relationship reconstruction on the public knowledge graph to be checked according to the corrected public notification set to obtain a target public knowledge graph;
the public notification joint release module is used for judging whether a dual attribute entity exists in the target public knowledge graph;
If the dual attribute entity exists in the target public knowledge graph, returning to the step of receiving the corrected public notification set of the history public notification set by the history issuing mechanism set; and if the target public knowledge graph does not have the dual attribute entity, the current public notification and the corrected public notification set are jointly released.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311626967.6A CN117725225B (en) | 2023-11-29 | 2023-11-29 | Public data security circulation management method and system based on knowledge graph |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311626967.6A CN117725225B (en) | 2023-11-29 | 2023-11-29 | Public data security circulation management method and system based on knowledge graph |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117725225A true CN117725225A (en) | 2024-03-19 |
| CN117725225B CN117725225B (en) | 2024-07-05 |
Family
ID=90200746
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311626967.6A Active CN117725225B (en) | 2023-11-29 | 2023-11-29 | Public data security circulation management method and system based on knowledge graph |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117725225B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170097984A1 (en) * | 2015-10-05 | 2017-04-06 | Yahoo! Inc. | Method and system for generating a knowledge representation |
| WO2021004333A1 (en) * | 2019-07-08 | 2021-01-14 | 平安科技（深圳）有限公司 | Knowledge graph-based event processing method and apparatus, device, and storage medium |
| US20210110278A1 (en) * | 2019-10-14 | 2021-04-15 | Microsoft Technology Licensing, Llc | Enterprise knowledge graph |
| US20220019905A1 (en) * | 2020-07-20 | 2022-01-20 | Microsoft Technology Licensing, Llc | Enterprise knowledge graph building with mined topics and relationships |
| CN114780619A (en) * | 2022-06-07 | 2022-07-22 | 国网浙江省电力有限公司金华供电公司 | Abnormity early warning method for automatic engineering audit data |
| CN114969385A (en) * | 2022-08-03 | 2022-08-30 | 北京长河数智科技有限责任公司 | Knowledge graph optimization method and device based on document attribute assignment entity weight |
| CN116361474A (en) * | 2021-12-27 | 2023-06-30 | 国家电网有限公司华东分部 | Method and device for updating text knowledge graph of defects of power equipment |
-
2023
- 2023-11-29 CN CN202311626967.6A patent/CN117725225B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170097984A1 (en) * | 2015-10-05 | 2017-04-06 | Yahoo! Inc. | Method and system for generating a knowledge representation |
| WO2021004333A1 (en) * | 2019-07-08 | 2021-01-14 | 平安科技（深圳）有限公司 | Knowledge graph-based event processing method and apparatus, device, and storage medium |
| US20210110278A1 (en) * | 2019-10-14 | 2021-04-15 | Microsoft Technology Licensing, Llc | Enterprise knowledge graph |
| US20220019905A1 (en) * | 2020-07-20 | 2022-01-20 | Microsoft Technology Licensing, Llc | Enterprise knowledge graph building with mined topics and relationships |
| CN116361474A (en) * | 2021-12-27 | 2023-06-30 | 国家电网有限公司华东分部 | Method and device for updating text knowledge graph of defects of power equipment |
| CN114780619A (en) * | 2022-06-07 | 2022-07-22 | 国网浙江省电力有限公司金华供电公司 | Abnormity early warning method for automatic engineering audit data |
| CN114969385A (en) * | 2022-08-03 | 2022-08-30 | 北京长河数智科技有限责任公司 | Knowledge graph optimization method and device based on document attribute assignment entity weight |
Non-Patent Citations (3)
| Title |
|---|
| CHUAN YIN ET AL.: "Geographic Knowledge Graph Attribute Normalization: Improving the Accuracy by Fusing Optimal Granularity Clustering and Co-Occurrence Analysis", ISPRS, 23 June 2022 (2022-06-23), pages 1 - 17 * |
| 葛斌等: "军事知识图谱构建技术", 指挥与控制学报, vol. 2, no. 4, 15 December 2016 (2016-12-15), pages 302 - 308 * |
| 鄂世嘉等: "自动化构建的中文知识图谱系统", 计算机应用, vol. 36, no. 4, 10 April 2016 (2016-04-10), pages 993 - 996 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117725225B (en) | 2024-07-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112698971A (en) | Rule engine based parameter conversion method, device, equipment and medium | |
| CN113806434B (en) | Big data processing method, device, equipment and medium | |
| CN113946690A (en) | Potential customer mining method and device, electronic equipment and storage medium | |
| CN111429121B (en) | Block chain-based electronic ticket processing method, device, equipment and storage medium | |
| CN110598877A (en) | Transformer substation accessory facility maintenance method and system and terminal equipment | |
| CN110990396B (en) | Data storage method, device and storage medium | |
| CN111950621A (en) | Target data detection method, device, equipment and medium based on artificial intelligence | |
| CN117193975A (en) | Task scheduling method, device, equipment and storage medium | |
| CN115081538A (en) | Machine learning-based customer relationship identification method, device, equipment and medium | |
| CN114881616A (en) | Business process execution method and device, electronic equipment and storage medium | |
| CN111796984A (en) | Data monitoring method and device, computer equipment and storage medium | |
| CN111985545A (en) | Target data detection method, device, equipment and medium based on artificial intelligence | |
| CN113901166B (en) | Electronic map construction method, device, equipment and storage medium | |
| CN115086047A (en) | Interface authentication method and device, electronic equipment and storage medium | |
| CN117725225B (en) | Public data security circulation management method and system based on knowledge graph | |
| CN112132037A (en) | Sidewalk detection method, device, equipment and medium based on artificial intelligence | |
| CN113886108B (en) | Dot data calling method and device, electronic equipment and storage medium | |
| CN111651452A (en) | Data storage method and device, computer equipment and storage medium | |
| CN114860314B (en) | Deployment upgrading method, device, equipment and medium based on database compatibility | |
| CN112560721B (en) | Non-perception model switching method and device, electronic equipment and storage medium | |
| CN114547011A (en) | Data extraction method and device, electronic equipment and storage medium | |
| CN115687384A (en) | UUID (user identifier) identification generation method, device, equipment and storage medium | |
| CN115617661A (en) | Simulation system test method, device, electronic equipment and storage medium | |
| CN113918296A (en) | Model training task scheduling execution method and device, electronic equipment and storage medium | |
| CN113723681A (en) | Path selection method and device, electronic equipment and readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |