Reproduce “An Efficient Approach for Discovering Graph Entity Dependencies (GEDs)” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Dehua Liu, Selasi Kwashie, Yidi Zhang, Guangtong Zhou, Michael Bewong, Xiaoying Wu, Xi Guo, Keqing He and 1 more
The authors present a two-stage method for discovering graph entity dependencies, rules that connect facts within graph patterns. It finds frequent patterns in dense communities, then mines and prunes dependencies over matches in the graph. On YAGO4, it mines patterns of 2–5 nodes across a graph with 4.37 million nodes and 13.3 million edges, demonstrating feasibility, not a measured speedup.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.