Ye Yuan
ABSTRACT
In this paper, we propose neural-symbolic graph databases (NSGDs) that extends traditional graph data with content and structural embeddings in every node. The content embeddings can represent unstructured data (e.g., images, videos, and texts), while structural embeddings can be used to deal with incomplete graphs. We can advocate machine learning models (e.g., deep learning) to transform unstructured data and graph nodes to these embeddings. NSGDs can support a wide range of applications (e.g., online recommendation and natural language question answering) in social-media networks, multi-modal knowledge graphs and etc. As a typical search over graphs, we study subgraph search over a large NSGD, called neural-symbolic subgraph matching (NSMatch) that includes a novel ranking search function. Specifically, we develop a general algorithmic framework to process NSMatch efficiently. Using real-life multi-modal graphs, we experimentally verify the effectiveness, scalability and efficiency of NSMatch.
- S. Arya and D. M. Mount. Approximate nearest neighbor queries in fixed dimen-sions. In SODA, volume 93, pages 271--280, 1993.Google Scholar
- B. Bhattarai, H. Liu, and H. H. Huang. Ceci: Compact embedding cluster index for scalable subgraph matching. In Proceedings of the 2019 International Conference on Management of Data, pages 1447--1462, 2019.Google ScholarDigital Library
- A. Bordes, N. Usunier, A. Garcia-Duran, J. Weston, and O. Yakhnenko. Translating embeddings for modeling multi-relational data. Advances in neural information processing systems, 26, 2013.Google Scholar
- X. Chen, N. Zhang, L. Li, S. Deng, C. Tan, C. Xu, F. Huang, L. Si, and H. Chen. Hybrid transformer with multi-level fusion for multimodal knowledge graph completion. arXiv preprint arXiv:2205.02357, 2022.Google Scholar
- L. P. Cordella, P. Foggia, C. Sansone, and M. Vento. A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell., 26(10):1367--1372, 2004.Google ScholarDigital Library
- D. Dearholt, N. Gonzales, and G. Kurup. Monotonic search networks for computer vision databases. In Twenty-Second Asilomar Conference on Signals, Systems and Computers, volume 2, pages 548--553. IEEE, 1988.Google ScholarCross Ref
- L. Dietz, A. Kotov, and E. Meij. Utilizing knowledge graphs for text-centric information retrieval. In The 41st international ACM SIGIR conference on research & development in information retrieval, pages 1387--1390, 2018.Google ScholarDigital Library
- W. Dong, M. Charikar, and K. Li. Efficient k-nearest neighbor graph construction for generic similarity measures. In S. Srinivasan, K. Ramamritham, A. Kumar, M. P. Ravindra, E. Bertino, and R. Kumar, editors, Proceedings of the 20th International Conference on World Wide Web, WWW 2011, Hyderabad, India, March 28 - April 1, 2011, pages 577--586. ACM, 2011.Google ScholarDigital Library
- D. H. (ed.). Approximation algorithms for NP-Hard problems. PWS, 1997.Google Scholar
- R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci., 66(4):614--656, 2003.Google ScholarDigital Library
- S. Ferrada, B. Bustos, and A. Hogan. Imgpedia: a linked dataset with content-based analysis of wikimedia images. In International Semantic Web Conference, pages 84--93. Springer, 2017.Google ScholarDigital Library
- C. Fu, C. Wang, and D. Cai. High dimensional similarity search with satellite system graph: Efficiency, scalability, and unindexed query compatibility. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2021.Google ScholarDigital Library
- C. Fu, C. Xiang, C. Wang, and D. Cai. Fast approximate nearest neighbor search with the navigating spreading-out graph. arXiv preprint arXiv:1707.00143, 2017.Google Scholar
- M. R. Garey and D. S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. W.H.Freeman, 1979.Google ScholarDigital Library
- W. Gong, E.-P. Lim, and F. Zhu. Characterizing silent users in social media communities. In Proceedings of the International AAAI Conference on Web and Social Media, volume 9, pages 140--149, 2015.Google Scholar
- M. Han, H. Kim, G. Gu, K. Park, and W.-S. Han. Efficient subgraph matching: Harmonizing dynamic programming, adaptive matching order, and failing set together. In Proceedings of the 2019 International Conference on Management of Data, pages 1429--1446, 2019.Google ScholarDigital Library
- W.-S. Han, J. Lee, and J.-H. Lee. Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pages 337--348, 2013.Google ScholarDigital Library
- S. Harnad. The symbol grounding problem. Physica D: Nonlinear Phenomena, 42(1--3):335--346, 1990.Google Scholar
- H. He and A. K. Singh. Graphs-at-a-time: query language and access methods for graph databases. In Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pages 405--418, 2008.Google ScholarDigital Library
- J. Huang, W. X. Zhao, H. Dou, J.-R. Wen, and E. Y. Chang. Improving sequential recommendation with knowledge-enhanced memory networks. In The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval, pages 505--514, 2018.Google ScholarDigital Library
- I. F. Ilyas, W. G. Aref, and A. K. Elmagarmid. Supporting top-k join queries in relational databases. VLDB J., 13(3):207--221, 2004.Google ScholarDigital Library
- Y. LeCun, Y. Bengio, and G. Hinton. Deep learning. nature, 521(7553):436--444, 2015.Google Scholar
- Y. Liu, H. Li, A. Garcia-Duran, M. Niepert, D. Onoro-Rubio, and D. S. Rosenblum. Mmkg: multi-modal knowledge graphs. In European Semantic Web Conference, pages 459--474. Springer, 2019.Google ScholarDigital Library
- Y. A. Malkov and D. A. Yashunin. Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE transactions on pattern analysis and machine intelligence, 42(4):824--836, 2018.Google Scholar
- H. Mousselly-Sergieh, T. Botschen, I. Gurevych, and S. Roth. A multimodal translation-based approach for knowledge graph representation learning. In Proceedings of the Seventh Joint Conference on Lexical and Computational Semantics, pages 225--234, 2018.Google ScholarCross Ref
- L. Prokhorenkova and A. Shekhovtsov. Graph-based nearest neighbor search: From practice to theory. In International Conference on Machine Learning, pages 7803--7813. PMLR, 2020.Google Scholar
- H. Ren and J. Leskovec. Beta embeddings for multi-hop logical reasoning in knowledge graphs. Advances in Neural Information Processing Systems, 33:19716--19726, 2020.Google Scholar
- H. Shang, Y. Zhang, X. Lin, and J. X. Yu. Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. Proceedings of the VLDB Endowment, 1(1):364--375, 2008.Google ScholarDigital Library
- Z. Sun, Z. Deng, J. Nie, and J. Tang. Rotate: Knowledge graph embedding by relational rotation in complex space. In 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019. OpenReview.net, 2019.Google Scholar
- J. R. Ullmann. An algorithm for subgraph isomorphism. Journal of the ACM (JACM), 23(1):31--42, 1976.Google Scholar
- M. Wang, H. Wang, G. Qi, and Q. Zheng. Richpedia: a large-scale, comprehensive multi-modal knowledge graph. Big Data Research, 22:100159, 2020.Google ScholarCross Ref
- M. Wang, X. Xu, Q. Yue, and Y. Wang. A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search. Proc. VLDB Endow., 14(11):1964--1978, 2021.Google ScholarDigital Library
- Z. Wang, L. Li, Q. Li, and D. Zeng. Multimodal data enhanced representation learning for knowledge graphs. In 2019 International Joint Conference on Neural Networks (IJCNN), pages 1--8. IEEE, 2019.Google ScholarCross Ref
- Z. Wang, J. Zhang, J. Feng, and Z. Chen. Knowledge graph embedding by translating on hyperplanes. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 28, 2014.Google ScholarCross Ref
- Y. Wei, X. Wang, L. Nie, X. He, R. Hong, and T.-S. Chua. Mmgcn: Multi-modal graph convolution network for personalized recommendation of micro-video. In Proceedings of the 27th ACM International Conference on Multimedia, pages 1437--1445, 2019.Google ScholarDigital Library
- Y. Wu, S. Yang, and X. Yan. Ontology-based subgraph querying. In 2013 IEEE 29th International Conference on Data Engineering (ICDE), pages 697--708. IEEE, 2013.Google ScholarDigital Library
- R. Xie, Z. Liu, H. Luan, and M. Sun. Image-embodied knowledge representation learning. arXiv preprint arXiv:1609.07028, 2016.Google Scholar
- Z. Yang. Biomedical information retrieval incorporating knowledge graph for explainable precision medicine. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 2486--2486, 2020.Google ScholarDigital Library
- Y. Yuan, L. Chen, and G. Wang. Efficiently answering probability threshold-based shortest path queries over uncertain graphs. In Database Systems for Advanced Applications: 15th International Conference, DASFAA 2010, Tsukuba, Japan, April 1-4, 2010, Proceedings, Part I 15, pages 155--170. Springer, 2010.Google ScholarDigital Library
- Y. Yuan, G. Wang, L. Chen, and H. Wang. Efficient subgraph similarity search on large probabilistic graph databases. Proceedings of the VLDB Endowment, 5(9), 2012.Google ScholarDigital Library
- Y. Yuan, G. Wang, L. Chen, and H. Wang. Efficient keyword search on uncertain graph data. IEEE Transactions on Knowledge and Data Engineering, 25(12):2767--2779, 2013.Google ScholarDigital Library
- Y. Yuan, G. Wang, H. Wang, and L. Chen. Efficient subgraph search over large uncertain graphs. Proceedings of the VLDB Endowment, 4(11):876--886, 2011.Google ScholarDigital Library
- M. Zhang and Y. He. Grip: Multi-store capacity-optimized high-performance nearest neighbor search for vector search engine. In Proceedings of the 28th ACM International Conference on Information and Knowledge Management, pages 1673--1682, 2019.Google ScholarDigital Library
- Z. Zhang, J. Wang, J. Chen, S. Ji, and F. Wu. Cone: Cone embeddings for multi-hop reasoning over knowledge graphs. Advances in Neural Information Processing Systems, 34:19172--19183, 2021.Google Scholar
- P. Zhao and J. Han. On graph query optimization in large networks. Proceedings of the VLDB Endowment, 3(1--2):340--351, 2010.Google ScholarDigital Library
- Y. Zhao, X. Cai, Y. Wu, H. Zhang, Y. Zhang, G. Zhao, and N. Jiang. Mose: Modality split and ensemble for multimodal knowledge graph completion. arXiv preprint arXiv:2210.08821, 2022Google Scholar
Index Terms
- Subgraph Search over Neural-Symbolic Graphs
Recommendations
Equimatchable Graphs on Surfaces
A graph G is equimatchable if each matching in G is a subset of a maximum-size matching and it is factor critical if G-v has a perfect matching for each vertex v of G. It is known that any 2-connected equimatchable graph is either bipartite or factor ...
Domination in planar graphs with small diameter
MacGillivray and Seyffarth (J Graph Theory 22 (1996), 213–229) proved that planar graphs of diameter two have domination number at most three and planar graphs of diameter three have domination number at most ten. They also give examples of planar ...
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching
SIGMOD '21: Proceedings of the 2021 International Conference on Management of DataSubgraph query processing (also known as subgraph search) and subgraph matching are fundamental graph problems in many application domains. A lot of efforts have been made to develop practical solutions for these problems. Despite the efforts, existing ...
Comments