Graph similarity calculation system, method, and program

A similarity, computer technology, applied in the field of similarity, can solve problems such as difficult map comparison, and achieve the effect of high reliability and great effect

CN102341802AActive Publication Date: 2012-02-01IBM CORP
5 Cites 5 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Publication Date
2012-02-01

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The similarity between graphs having an extremely large number of nodes, such as an SNS, a link of WWW, etc., can be obtained within a reasonable time. A unique value is provided to a label of a node in a graph. Preferably, the value is a fixed-length bit string. In this case, the length of the bit string is selected to be sufficiently larger than the number of digits by which types of labels can be expressed. With respect to one graph, nodes of the graph are sequentially visited by an existing graph search method, such as a depth-first search, a breadth-first search, and the like. At this time, in the system, when one specific node is visited, a calculation is performed for bit string label values of all nodes adjacent to the specific node and the bit string label value of the specific node, to obtain a bit string value. The hash calculation is performed for the calculated bit string value and the original bit string label value of the node to obtain another bit string label value, and this value becomes the label value of the node. After finishing the visit to all nodes in one graph, the label values of all nodes are rewritten. When the same treatment is performed for another graph which becomes a target of the graph similarity comparison, label values of all nodes in this graph are rewritten. Therefore, with respect to one graph, a ratio of label values which are identical to the label values in another graph, per all nodes is calculated to obtain the similarity.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The present invention relates to calculating or evaluating the similarity of objects in a data structure represented as a graph on a computer. Background technique

[0002] A graph is a mathematical object including vertices (also called nodes) with labels for mutual identification and edges (also called edges, branches, and links) connecting the vertices. When considering real objects, it can be known that, for example, a road map, Chemical formulas and the like are represented by diagrams.

[0003] For example, in a road map, intersections can be considered as nodes and roads as edges. In a chemical formula, elements can be considered as nodes, and the connections between elements are edges. If considered in this way, it can be seen that the application of graphs can be found in a very wide range of fields such as genes, protein structures, circuits, geography, and architecture.

[0004] Recently, graph construction is gradually applied to social ...

Examples

Embodiment Construction

[0038] Hereinafter, embodiments of the present invention will be described based on the drawings. Unless otherwise stated, the same reference numerals refer to the same objects throughout the drawings. One embodiment of the present invention will be described below, and it should be understood that the present invention is not intended to be limited to the content described in this example.

[0039] refer to figure 1 , is a block diagram showing computer hardware for implementing the structures and processes involved in one embodiment of the present invention. figure 1 Among them, CPU 104 , main storage (RAM) 106 , hard disk drive (HDD) 108 , keyboard 110 , mouse 112 , and display 114 are connected to system bus 102 . Preferably, the CPU 104 is based on a 32-bit or 64-bit design, for example, Intel's Pentium (trademark) 4, Core (trademark) 2Duo, Xeon (trademark), AMD's Athlon (trademark), etc. can be used. The main storage 106 preferably has a capacity of 2 GB or more. T...