IP Library › Granted Patent US 12,333,425
Granted Patent B2
US 12,333,425 · App. 17/161,152 · Granted Jun 17, 2025

Hybrid graph neural network

Inventors: Chuan Lei (Cupertino, CA); Junheng Hao (Los Angeles, CA); Vasilis Efthymiou (San Jose, CA); Fatma Ozcan (San Jose, CA); Abdul Quamar (San Jose, CA)
Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
G06N3/08G06F16/284G06N3/04G06N3/042G06N3/045G06N5/02
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,333,425
App. No.
17/161,152
Granted
Jun 17, 2025
Kind
B2
Abstract

An embodiment includes extracting, responsive to an update request from a remote requesting system, technical descriptor data from a data source. The embodiment also includes forming a new graph data structure using the technical descriptor data extracted from the data source. The embodiment also includes augmenting the new graph data structure to include a concept based on a value from instance data from the data source. The embodiment also includes identifying a first pair of concepts that are connected in a pre-existing ontology that correspond with a second pair of concepts that lack a connection therebetween in the new graph structure. The embodiment also includes augmenting the new graph data structure to include a connection between the second pair of concepts. The embodiment also includes outputting the new graph data structure as part of a response to the update request from the requesting system.

Claims (47)

1. A computer implemented method comprising:

extracting, responsive to an update request from a remote requesting system, technical descriptor data from a data source, wherein the technical descriptor data describes a construct of a data structure of the data source;

forming a new graph data structure using the technical descriptor data extracted from the data source, wherein the forming the new graph data structure comprises projecting node embeddings into a hyperbolic space representation that captures hierarchical and non-hierarchical connections between concepts;

augmenting the new graph data structure to include a concept based on a value from instance data from the data source;

identifying a first pair of concepts that are connected in a pre-existing ontology that correspond with a second pair of concepts that lack a connection therebetween in the new graph structure, wherein the identifying the first pair of concepts that are connected in the pre-existing ontology comprises identifying a hierarchical connection between concepts of the first pair of concepts, and a non-hierarchical connection between concepts of the first pair of concepts;

identifying a top-level concept that is connected to the first pair of concepts in the pre-existing ontology;

augmenting the new graph data structure to include a connection between the second pair of concepts, wherein the augmenting the new graph data is based at least in part on the hierarchical connection between concepts of the first pair of concepts, the non-hierarchical connection between concepts of the first pair of concepts, and the top-level concept that is connected to the first pair of concepts in the pre-existing ontology; and

outputting the new graph data structure as part of a response to the update request from the requesting system.

2. The method of claim 1 , wherein the technical descriptor data comprises technical metadata.

3. The method of claim 1 , wherein the data source comprises a relational database.

4. The method of claim 1 , wherein the technical descriptor data comprises schema level data.

5. The method of claim 4 , wherein the forming of the new graph data structure using the technical descriptor data comprises adding schema level nodes corresponding to respective schema values of the schema level data.

6. The method of claim 5 , wherein the augmenting of the new graph data structure to include the concept further comprises identifying each distinct value in the instance data of the data source.

7. The method of claim 6 , wherein the augmenting of the new graph data structure to include the concept further comprises adding, for each distinct value identified in the instance data of the data source, an instance concept connected to a respective one of the schema level nodes.

8. The method of claim 1 , wherein the new graph structure comprises a new ontology.

9. The method of claim 8 , further comprising updating the new ontology using an OntoGNN.

10. The method of claim 9 , wherein the updating of the new ontology comprises using the new ontology as a source ontology for the OntoGNN and using the pre-existing ontology as a target ontology for the OntoGNN.

11. The method of claim 10 , wherein the updating of the new ontology using the OntoGNN comprises:

generating a first concept representation based on a first portion of the new ontology using a first processing path of the OntoGNN, the first processing path comprising a first hyperbolic graph convolution layer, the first portion of the new ontology comprising a first key concept;

generating a second concept representation based on a second portion of the new ontology using a second processing path of the OntoGNN, the second processing path comprising a first heterogenous graph convolution layer, the second portion of the new ontology comprising the first key concept;

generating a first unified concept representation including concatenating the first concept representation with the second concept representation; and

generating a prediction score using a predictive matching module, the predictive score being indicative of an extent of a match between the first unified concept representation and a second unified concept representation from the pre-existing ontology.

12. A computer usable program product for cognitive analysis of a project description, the computer program product comprising one or more computer readable storage media, and program instructions collectively stored on the one or more computer readable storage media, the program instructions executable by a processor to cause the processor to perform operations comprising:

extracting, responsive to an update request from a remote requesting system, technical descriptor data from a data source, wherein the technical descriptor data describes a construct of a data structure of the data source;

forming a new graph data structure using the technical descriptor data extracted from the data source;

augmenting the new graph data structure to include a concept based on a value from instance data from the data source;

identifying a top-level concept that is connected to the first pair of concepts in the pre-existing ontology;

identifying a first pair of concepts that are connected in a pre-existing ontology that correspond with a second pair of concepts that lack a connection therebetween in the new graph structure;

augmenting the new graph data structure to include a connection between the second pair of concepts wherein the augmenting the new graph data is based at least in part on a connection between concepts of the first pair of concepts, and a connection between the top-level concept that is connected to the first pair of concepts in the pre-existing ontology; and

outputting the new graph data structure as part of a response to the update request from the requesting system.

13. The computer usable program product of claim 12 , wherein the stored program instructions are stored in a computer readable storage device in a data processing system, and wherein the stored program instructions are transferred over a network from a remote data processing system.

14. The computer usable program product of claim 12 , wherein the stored program instructions are stored in a computer readable storage device in a server data processing system, and wherein the stored program instructions are downloaded in response to a request over a network to a remote data processing system for use in a computer readable storage device associated with the remote data processing system, further comprising:

program instructions to meter use of the computer usable code associated with the request; and

program instructions to generate an invoice based on the metered use.

15. The computer usable program product of claim 12 , wherein the technical descriptor data comprises technical metadata.

16. The computer usable program product of claim 12 , wherein the data source comprises a relational database.

17. The computer usable program product of claim 12 , wherein the technical descriptor data comprises schema level data.

18. A computer system comprising a processor and one or more computer readable storage media, and program instructions collectively stored on the one or more computer readable storage media, the program instructions executable by the processor to cause the processor to perform operations comprising:

extracting, responsive to an update request from a remote requesting system, technical descriptor data from a data source, wherein the technical descriptor data describes a construct of a data structure of the data source;

forming a new graph data structure using the technical descriptor data extracted from the data source, wherein the forming the new graph data structure comprises projecting node embeddings into a hyperbolic space representation that captures hierarchical and non-hierarchical connections between concepts;

augmenting the new graph data structure to include a concept based on a value from instance data from the data source;

identifying a first pair of concepts that are connected in a pre-existing ontology that correspond with a second pair of concepts that lack a connection therebetween in the new graph structure, wherein the identifying the first pair of concepts that are connected in the pre-existing ontology comprises identifying a hierarchical connection between concepts of the first pair of concepts, and a non-hierarchical connection between concepts of the first pair of concepts;

identifying a top-level concept that is connected to the first pair of concepts in the pre-existing ontology;

augmenting the new graph data structure to include a connection between the second pair of concepts, wherein the augmenting the new graph data is based at least in part on the hierarchical connection between concepts of the first pair of concepts, the non-hierarchical connection between concepts of the first pair of concepts, and the top-level concept that is connected to the first pair of concepts in the pre-existing ontology; and

outputting the new graph data structure as part of a response to the update request from the requesting system.

19. The computer system of claim 18 , wherein the technical descriptor data comprises technical metadata.

20. The computer system of claim 18 , wherein the data source comprises a relational database.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 28, 2021
From: LEI, CHUAN; HAO, JUNHENG; EFTHYMIOU, VASILIS; OZCAN, FATMA; QUAMAR, ABDUL
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 055067/0438 →
Continuity (1)
Related Publication 20220237447A1 · Jul 28, 2022
References Cited (44)
US 6424973B1 · Baclawski · 2002 [cited by applicant]
US 7328209B2 · Das et al. · 2008 [cited by applicant]
US 7840512B2 · Pandya et al. · 2010 [cited by applicant]
US 9747563B2 · Lee et al. · 2017 [cited by applicant]
US 10169454B2 · Ait-Mokhtar et al. · 2019 [cited by applicant]
US 20020059289A1 · Wenegrat et al. · 2002 [cited by applicant]
US 20060074833A1 · Gardner et al. · 2006 [cited by applicant]
US 20070143285A1 · Drumm et al. · 2007 [cited by applicant]
US 20100131516A1 · Jean-Mary · 2010 [cited by applicant]
US 20120078595A1 · Balandin et al. · 2012 [cited by applicant]
US 20160005016A1 · Eliahu · 2016 [cited by examiner]
US 20160117395A1 · Geller et al. · 2016 [cited by applicant]
US 20170185674A1 · Tonkin et al. · 2017 [cited by applicant]
US 20170308799A1 · Eidelman et al. · 2017 [cited by applicant]
US 20180096252A1 · Fagundes et al. · 2018 [cited by applicant]
US 20200285944A1 · Lee et al. · 2020 [cited by applicant]
US 20210295822A1 · Tomkins · 2021 [cited by examiner]
US 20210397942A1 · Collomosse · 2021 [cited by applicant]
US 20220179882A1 · Cervantes et al. · 2022 [cited by applicant]
CN 102360394B · 2013 [cited by applicant]
CN 110134943A · 2019 [cited by applicant]
Alani, Harith. “Position paper: ontology construction from online ontologies.” Proceedings of the 15th international conference on World Wide Web. 2006. (Year: 2006). [cited by examiner]
Ahmed, Waqas, et al. “A light weight approach for ontology generation and change synchronization between ontologies and source relational databases.” Proceedings of the 2011 15th International Conference on Computer Sup… [cited by examiner]
Žitnik, Slavko, Marko Bajec, and Dejan Lavbič. “LogMap+: Relational data enrichment and linked data resources matching.” 2017 11th International Conference on Research Challenges in Information Science (RCIS). IEEE, 201… [cited by examiner]
Chami, Ines, et al. “Hyperbolic graph convolutional neural networks.” Advances in neural information processing systems 32 (2019). (Year: 2019). [cited by examiner]
Krivosheev, Evgeny, et al. “Siamese graph neural networks for data integration.” arXiv preprint arXiv:2001.06543 (2020). (Year: 2020). [cited by examiner]
Zhu, Zhihua, et al. “HGCN: A heterogeneous graph convolutional network-based deep learning model toward collective classification.” Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & da… [cited by examiner]
Wu, Yuting, et al. “Neighborhood Matching Network for Entity Alignment.” Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics. 2020. (Year: 2020). [cited by examiner]
Maedche, Alexander, and Steffen Staab. “Measuring similarity between ontologies.” International Conference on Knowledge Engineering and Knowledge Management. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. (Year: … [cited by examiner]
Hu, Wei, and Yuzhong Qu. “Block matching for ontologies.” International Semantic Web Conference. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. (Year: 2006). [cited by examiner]
Le, Matt, et al. “Inferring concept hierarchies from text corpora via hyperbolic embeddings.” arXiv preprint arXiv: 1902.00913 (2019). (Year: 2019). [cited by examiner]
Jimenez-Ruiz et al., LogMap: Logic-Based and Scalable Ontology Matching, Oct. 2011. [cited by applicant]
Faria et al.,The AgreementMakerLight Ontology Matching System, 2013. [cited by applicant]
Kolyvakis et al., DeepAlignment: Unsupervised Ontology Matching with Refined Word Vectors, Jun. 1-6, 2018. [cited by applicant]
Kolyvakis et al., Biomedical ontology alignment: an approach based on representation learning, Journal of Biomedical Semantics, 2018. [cited by applicant]
Wang et al.,Cross-lingual Knowledge Graph Alignment via Graph Convolutional Networks, Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, Oct. 31-Nov. 4, 2018. [cited by applicant]
Wu et al., Relation-Aware Entity Alignment for Heterogeneous Knowledge Graphs, Aug. 22, 2019. [cited by applicant]
Sun et al., Knowledge Graph Alignment Network with Gated Multi-Hop Neighborhood Aggregation, The Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-20), 2020. [cited by applicant]
Sun et al., A Benchmarking Study of Embedding-based Entity Alignment for Knowledge Graphs, Jul. 20, 2020. [cited by applicant]
Chen et al., Multilingual Knowledge Graph Embeddings for Cross-lingual Knowledge Alignment, Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (IJCAI-17), 2017. [cited by applicant]
GitHub, AgreementMakerLight, 2020, https://github.com/AgreementMakerLight. [cited by applicant]
Ruiz, LogMap: An Ontology Alignment and Alignment Repair System, GitHub, 2020, https://github.com/ernestojimenezruiz/logmap-matcher. [cited by applicant]
GitHub, LogMap, http://krrwebtools.cs.ox.ac.uk/logmap/, 2021. [cited by applicant]
List of all related dockets, 2021. [cited by applicant]