Subgraph based link similarity quick approximate calculation system and method thereof

A technology of similarity calculation and approximate calculation, which is applied in calculation, special data processing applications, instruments, etc., and can solve problems such as high time complexity

Inactive Publication Date: 2010-11-24
TSINGHUA UNIV
View PDF0 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, this method of calculating the similarity between objects through the link relationship has a high time complexity. The author also proposed a corresponding pruning method, which trades less accuracy loss for greater performance improvement.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Subgraph based link similarity quick approximate calculation system and method thereof
  • Subgraph based link similarity quick approximate calculation system and method thereof
  • Subgraph based link similarity quick approximate calculation system and method thereof

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0021] The basic idea of ​​the present invention is: the hypothesis and the theoretical basis about calculating link similarity in the prior art will be preserved, and this has guaranteed the rationality of the result that the present invention obtains; And form a subgraph, and use this subgraph to quickly approximate the similarity of node pairs. This approximation method greatly improves the performance with a small loss of accuracy.

[0022] The present invention is made in view of the above-mentioned technical problems. An object of the present invention is to propose a method and system for quickly and approximately calculating the similarity of links between specific point pairs in the full graph based on subgraphs.

[0023] In order to understand the present invention and its advantages more fully, the present invention will be further described in detail below in conjunction with the accompanying drawings and specific implementation examples.

[0024] Such as figure ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention provides a subgraph based link similarity quick approximate calculation system and a method thereof. The method comprises the following steps: inputting a graph structure and a node pair with similarity to be calculated; continuously extending certain nodes around the node pair into a subgraph; calculating the similarity of all node pairs in the subgraph through iteration so as to obtain the similarity among specific node pairs; stopping the iteration process when the results of two adjacent iterations meet the requirement of a convergence condition, or the approximate degree of the results meet the requirement of a user. The system and the method can quickly and approximately calculate the similarity of specific node pairs.

Description

technical field [0001] The invention relates to data mining and information retrieval, in particular to a system and method for fast and approximate calculation of similarity between specific point pairs in a full graph based on subgraphs. Background technique [0002] Similarity calculation has a wide range of applications in many research fields, such as information retrieval, data mining clustering, and recommendation systems. Similarity calculations are mainly divided into content-based and link-based, content-based mainly includes vector space models and Boolean models, etc., and link-based will be introduced below. [0003] The link relationship between objects in the network is constantly changing. For example, after a period of time, the link of some resources may be unreachable, or a new link will be added between two nodes, and so on. For example, in a typical book-buying website (such as Amazon), for the books that the user is currently paying attention to, the w...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30
Inventor 刘红岩何军杜小勇贾旭邹李
Owner TSINGHUA UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap