Editing
Knowledge Graphs
(section)
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== <span style="color: #FFFFFF;">Understanding</span> == Knowledge graphs represent knowledge as a directed, typed multigraph. Unlike a relational database that describes each entity's attributes in rows and columns, a KG describes the '''web of relationships''' β enabling multi-hop reasoning that relational databases make awkward. Example: "What are the birthplaces of Nobel Prize winners in Physics who studied at German universities?" In a relational database, this requires multiple JOINs across tables. In a knowledge graph, it's a graph traversal: find Nobel Physics winners β follow "studiedAt" to universities β filter to Germany β follow "bornIn" to places. '''The Open World Assumption''': A key semantic difference from relational databases. KGs assume that the absence of a triple does not mean it's false β the information may simply not be recorded. (Closed World Assumption in relational databases: if a row doesn't exist, the fact is false.) '''Knowledge Graph Embeddings''' (TransE, RotatE, ComplEx) learn dense vector representations of entities and relations, enabling: * Link prediction: can we predict missing triples? * Similarity computation: are these entities similar? * KG completion: enrich an incomplete KG using learned patterns TransE (a foundational embedding method) represents each relation as a translation in embedding space: h + r β t for each triple (h, r, t). "Paris + locatedIn β France" should hold approximately in the embedding space. '''Symbolic vs. neural AI''': Knowledge graphs are a form of '''symbolic AI''' β explicit, interpretable, structured representation. Neural models (LLMs) are statistical learners of implicit patterns. The combination β neuro-symbolic AI β is a growing research direction. RAG with a knowledge graph (GraphRAG) retrieves structured facts rather than unstructured text chunks, enabling more precise and verifiable grounding. </div> <div style="background-color: #8B0000; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
Summary:
Please note that all contributions to BloomWiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
BloomWiki:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Page
Discussion
English
Views
Read
Edit
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Page information