NODES 2023 - Using LLMs to Convert Unstructured Data to Knowledge Graphs

Discover how Large Language Models (LLMs) can unlock insights within text, social media, and web content. In this session, Noah will demonstrate how LLMs can be used for entity extraction, semantic relationship recognition, and context inference to generate interconnected knowledge graphs. This session will hopefully inspire you to harness LLMs for your uses of unstructured data.

[@joshuacunningham7912]

Thank you very much for this helpful and inspiring presentation!

[@ahmed_hefnawy1811]

chunking is one of the most steps to build a stable RAG flow, KG will change the RAG Game

[@capri300]

Nice talk. Concise and providing the just the right amount of information. massive thank you for using animations in your slides it helped tremendously with your flow. Trying the github repo as we speak.

[@neo4j]

Thank you

[@tacticalforesightconsultin453]

I've done and presented a project like this with more transparency over 5 years ago, and completed it within a few weeks time. The only concern there was, was with polysemy (word with multiple parts-of-speech).
It really helped to condense the information down and easily see implications across the documents.

[@kennethnielsen3453]

Surprised you didn't use the Matrix movies instead :D

[@user-fe6ns8mu5p]

Quick question let say we are working with maybe 100s of files to create graph, would'nt it be too costly to use llm?

[@MrRubix94]

That's the real question

[@user-fe6ns8mu5p]

@@MrRubix94 Any idea on how we can solve it?

[@MrRubix94]

No idea. I have yet to dive into the subject myself.@@user-fe6ns8mu5p

[@MrGara1994]

I think what you do there is pre index the vector database, and before sending the request, you preload the top n chunks. And most likely optimizing the knowledge graph by limiting the amount of tokens per chunk to the most optimal number for different tasks.

[@user-fe6ns8mu5p]

@@MrGara1994 if that the case this might be a dumb question 😅, but if we are using vector to get top n chunks then is there any different with doing kg or normal vector search?