|
|
|
|
|
|
by PHOTON1233
787 days ago
|
|
|
Thats pretty much it. There's also building on top of an existing graph and making sure new nodes are coherent and well connected to surrounding nodes which is a much tougher can of worms. Also, Navigating a KG (without multiple llm-hoping) is another challenge that needs to be solved for 'working-out retrieval'. Something that can navigate a forest of dividing paths without resorting to an llm call. Thanks for the name "keyword search on graphs". I found some great articles on the topic. |
|
|