Heterogeneous Information Networks Node Similarity Measurement Based on Feature Sub-Graph
To solve the problem in measuring the similarity of heterogeneous information networks, a similarity measuring algorithm was proposed. It calculates the difference between the maximum common sub-graph and minimum common hyper-graph, based on feature sub-graph of the current node. The algorithm takes...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Beijing Xintong Media Co., Ltd
2014-11-01
|
| Series: | Dianxin kexue |
| Subjects: | |
| Online Access: | http://www.telecomsci.com/zh/article/doi/10.3969/j.issn.1000-0801.2014.11.012/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | To solve the problem in measuring the similarity of heterogeneous information networks, a similarity measuring algorithm was proposed. It calculates the difference between the maximum common sub-graph and minimum common hyper-graph, based on feature sub-graph of the current node. The algorithm takes graph theory as its foundation, set different weight to different kinds of edges, considers nodes information as well as graph to topological information, and makes full use of the information in heterogeneous network. The result shows that the proposed algorithm has wonderful effectiveness and efficiency. |
|---|---|
| ISSN: | 1000-0801 |