I have a large dataset where each item contains a small set of random pairs of connected nodes (say 3), however I do not know the links. For example, you might be given
XYZ, but you don't know if
A connects to
Z, etc. But you do know that there are three pairs, each with distinct nodes. The correct links in this case might be
Now if each node can only form one link, finding the links becomes trivial, by simply finding the highest correlation between nodes over time. My problem is that each node can form links with multiple nodes.
Is there any algorithm for finding the adjacency matrix given data in this way? Or does anyone have any suggestions for how to solve this?