A knowledge graph, consisting of concepts, entities, and their relationships, is the most effective way to handle vast amounts of information. This study presents a relationship extraction approach for designing and constructing a graph structure, given that current domain knowledge graphs are unable to identify links between various kinds of data structures utilizing particular building methods. Data from the Network Encyclopedia's categorization system and web page classification labels, both structured and semi-structured, provide the basis for hyponymy. Non-superior connections are covered as well. The convolution residual network that is based on cross-entropy loss function has also been enhanced as a consequence of the suggested solution. Using a comparable existing item as a reference, we evaluate the design to see whether it performs as predicted.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.