Log in
Enquire now
‌

US Patent 11531656 Duplicate determination in a graph

OverviewStructured DataIssuesContributors

Contents

Is a
Patent
Patent
0

Patent attributes

Patent Jurisdiction
United States Patent and Trademark Office
United States Patent and Trademark Office
0
Patent Number
115316560
Patent Inventor Names
Lars Bremer0
Hemanth Kumar Babu0
Martin Oberhofer0
Thuany Karoline Stuart0
Date of Patent
December 20, 2022
0
Patent Application Number
173414300
Date Filed
June 8, 2021
0
Patent Citations
‌
US Patent 10642891 Graph matching by sub-graph grouping and indexing
Patent Citations Received
‌
US Patent 11941056 Method for weighting a graph
0
Patent Primary Examiner
‌
Tony Mahmoudi
0

Embodiments of the present invention provide for a method for duplicate determination in a graph. The graph comprises nodes representing entities and edges representing relationships between the entities. Embodiments of the present invention identify two target nodes in the graph. A neighborhood subgraph may be determined for each of the two nodes. The neighborhood subgraph includes the respective node. Embodiments of the present invention can then determine whether the two nodes are duplicates with respect to each other, based on a result of a comparison between the two subgraphs and based on a comparison of the two target nodes of the subgraphs.

Timeline

No Timeline data yet.

Further Resources

Title
Author
Link
Type
Date
No Further Resources data yet.

References

Find more entities like US Patent 11531656 Duplicate determination in a graph

Use the Golden Query Tool to find similar entities by any field in the Knowledge Graph, including industry, location, and more.
Open Query Tool
Access by API
Golden Query Tool
Golden logo

Company

  • Home
  • Press & Media
  • Blog
  • Careers
  • WE'RE HIRING

Products

  • Knowledge Graph
  • Query Tool
  • Data Requests
  • Knowledge Storage
  • API
  • Pricing
  • Enterprise
  • ChatGPT Plugin

Legal

  • Terms of Service
  • Enterprise Terms of Service
  • Privacy Policy

Help

  • Help center
  • API Documentation
  • Contact Us
By using this site, you agree to our Terms of Service.