Community discovery method and device based on entity similarity in knowledge graph
A technology of entity similarity and knowledge graph, applied in the field of community discovery method and device based on entity similarity in knowledge graph, can solve the problems of time-consuming complexity, modularity algorithm deviation, enlarged search space, etc. Second iteration time and total number of iterations, high accuracy and accurate results
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0041] Such as figure 1 As shown, the community discovery method based on entity similarity in the knowledge map provided by the embodiment of the present invention may include the following steps:
[0042] Step S101: use the knowledge graph to store social network data, and calculate the Jaccard distance to obtain a similarity matrix;
[0043] Step S102: Calculate a set of similar nodes in the knowledge graph according to the similarity matrix;
[0044] Step S103: Carry out iterative label propagation according to the set of similar nodes, and determine the final community label of the node according to the iterated label list of each node for community discovery.
[0045] The present invention uses the similarity based on Jaccard distance as the core. Since there are a large number of missing data in the community network, using Euclidean distance or cosine similarity will substitute missing attributes into the calculation, which will increase the similarity between nodes w...
Embodiment 2
[0047]On the basis of the community discovery method based on the entity similarity in the knowledge graph provided in Embodiment 1, the process of calculating the similar node set in the knowledge graph according to the similarity matrix in step S102 can be specifically implemented in the following manner :
[0048] (1) Receive a preset radius r and a similarity threshold s;
[0049] (2) For each node in the knowledge graph, search for nodes whose similarity with the current node is greater than the similarity threshold s within the preset radius r of the current node, and join the similar node set of the current node.
[0050] The invention replaces the set of connected nodes with a set of similar nodes, reduces the search consumption of the algorithm in the iterative process, thereby reduces the single iteration time and the total number of iterations, and finally reduces the total complexity of the algorithm.
Embodiment 3
[0052] On the basis of the community discovery method based on the entity similarity in the knowledge graph provided in the second embodiment, the process of iterative label propagation according to the similar node set described in step S103 can be specifically implemented in the following manner:
[0053] (1) Initialize the label list for each node in the knowledge graph, and initialize a unique label in the label list of each node, and the weight is 1;
[0054] (2) Set the initial value of the current number of iterations to 0, judge whether the current number of iterations is less than the preset number of iterations t, if so, perform label propagation operations on each node in the knowledge map in turn, otherwise end the iteration;
[0055] When the label propagation operation is performed on each node in the knowledge graph in turn, for the current node, the current node is used as the listener, and all nodes in the similar node set of the current node are used as the di...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com