Cited By
View all- Bergami GMaggi FMontali MPeñaloza R(2021)A Tool for Computing Probabilistic Trace AlignmentsIntelligent Information Systems10.1007/978-3-030-79108-7_14(118-126)Online publication date: 15-Jun-2021
Hierarchical embedding for DAG reachability queries
Article No.: 24, Pages 1 - 10
Abstract
Current hierarchical embeddings are inaccurate in both reconstructing the original taxonomy and answering reachability queries over Direct Acyclic Graph. In this paper, we propose a new hierarchical embedding, the Euclidean Embedding (EE), that is correct by design due to its mathematical formulation and associated lemmas. Such embedding can be constructed during the visit of a taxonomy, thus making it faster to generate if compared to other learning-based embeddings. After proposing a novel set of metrics for determining the embedding accuracy with respect to the reachability queries, we compare our proposed embedding with state-of-the-art approaches using full trees from 3 to 1555 nodes and over a real-world Direct Acyclic Graph of 1170 nodes. The benchmark shows that EE outperforms our competitors in both accuracy and efficiency.
References
[1]
G. Bergami. A framework supporting imprecise queries and data. CoRR, abs/1912.12531, 2019.
[2]
F. Bertini, G. Bergami, D. Montesi, G. Veronese, G. Marchesini, and P. Pandolfi. Predicting frailty condition in elderly using multidimensional socioclinical databases. Proc. of the IEEE, 106(4):723--737, April 2018.
[3]
P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In PVLDB, page 426--435, 1997.
[4]
L. De Raedt. Logical and Relational Learning. Springer Inc., 1st edition, 2010.
[5]
B. Dezso, A. Jüttner, and P. Kovács. LEMON - an open source C++ graph template library. Electron. Notes Theor. Comput. Sci., 264(5):23--45, 2011.
[6]
J. Grant and M. V. Martinez. Measuring Inconsistency in Information. College Publications, 2018.
[7]
G. Guennebaud, B. Jacob, et al. Eigen v3. http://eigen.tuxfamily.org, 2010.
[8]
Haixun Wang, Hao He, Jun Yang, P. S. Yu, and J. X. Yu. Dual labeling: Answering graph reachability queries in constant time. In ICDE, pages 75--75, April 2006.
[9]
A. Hotho. Data mining on folksonomies. In Intelligent Information Access, pages 57--82. 2010.
[10]
Z. Hu, P. Huang, Y. Deng, Y. Gao, and E. P. Xing. Entity hierarchy embedding. In ACL, pages 1292--1300, 2015.
[11]
J. Johnson. Hypernetwors in the Science of Complex Systems. Imperial College Press, London, UK, UK, 2011.
[12]
A. Klimovskaia, D. Lopez-Paz, L. Bottou, and M. Nickel. Poincaré maps for analyzing complex hierarchies in single-cell data. Nature Communications, 11(2966), 2020.
[13]
H. Liu, H. Bao, and D. Xu. Concept vector for similarity measurement based on hierarchical domain structure. Computing and Informatics, 30(5):881--900, 2011.
[14]
G. A. Miller. Wordnet: A lexical database for english. Commun. ACM, 38(11):39--41, Nov. 1995.
[15]
M. Nickel and D. Kiela. Poincaré embeddings for learning hierarchical representations. In Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 4-9 December 2017, Long Beach, CA, USA, pages 6338--6347, 2017.
[16]
A. Petermann, G. Micale, G. Bergami, A. Pulvirenti, and E. Rahm. Mining and ranking of generalized multi-dimensional frequent subgraphs. In ICDIM, pages 236--245, Sep. 2017.
[17]
J. B. Saxe. Embeddability of weighted graphs ink-space is strongly np-hard. In Proceedings of 17th Allerton Conference in Communications, Control and Computing, 1979.
[18]
C. Seshadhri, A. Sharma, A. Stolman, and A. Goel. The impossibility of low-rank representations for triangle-rich complex networks. Proc. of the National Academy of Sciences, 117(11):5631--5637, 2020.
[19]
K. Simon. An improved algorithm for transitive closure on acyclic digraphs. Theor. Comput. Sci., 58:325--346, 1988.
[20]
R. Speer, J. Chin, and C. Havasi. Conceptnet 5.5: An open multilingual graph of general knowledge. In Proc. of AAAI, pages 4444--4451, 2017.
[21]
T. Teofili. par2hier: towards vector representations for hierarchical content. In ICCS 2017, 12-14 June 2017, Zurich, Switzerland, pages 2343--2347, 2017.
[22]
J. Wills, S. Agarwal, D. Kriegman, and S. Belongie. Toward a perceptual space for gloss. ACM Trans. Graph., 28(4), Sept. 2009.
[23]
J. X. Yu and J. Cheng. Graph reachability queries: A survey. In Managing and Mining Graph Data, pages 181--215. 2010.
Index Terms
- Hierarchical embedding for DAG reachability queries
Recommendations
Efficient processing of label-constraint reachability queries in large graphs
In this paper, we study a variant of reachability queries, called label-constraint reachability (LCR) queries. Specifically, given a label set S and two vertices u"1 and u"2 in a large directed graph G, we check the existence of a directed path from u"1 ...
Hierarchical reversible data hiding based on statistical information: Preventing embedding unbalance
For reversible data hiding, the histogram-based difference expansion (DE) is one family of the generic methods where secret bits are embedded into an image by DE on prediction error. However, the ratio of the count of bit 0 to that of bit 1, embedded ...
Efficient Reachability Query with Extreme Labeling Filter
WSDM '22: Proceedings of the Fifteenth ACM International Conference on Web Search and Data MiningBeing a fundamental graph operator, reachability query has been widely studied by the data mining community in the past decades. In a directed acyclic graph (DAG), one vertex is reachable by another if there exists a chain of directed edges connecting ...
Comments
Information & Contributors
Information
Published In
Copyright © 2020 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 25 August 2020
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
IDEAS 2020
IDEAS 2020: 24th International Database Engineering & Applications Symposium
August 12 - 14, 2020
Seoul, Republic of Korea
Acceptance Rates
IDEAS '20 Paper Acceptance Rate 27 of 57 submissions, 47%;
Overall Acceptance Rate 74 of 210 submissions, 35%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 145Total Downloads
- Downloads (Last 12 months)15
- Downloads (Last 6 weeks)0
Reflects downloads up to 30 Aug 2024
Other Metrics
Citations
Cited By
View all- Bergami GMaggi FMontali MPeñaloza R(2021)A Tool for Computing Probabilistic Trace AlignmentsIntelligent Information Systems10.1007/978-3-030-79108-7_14(118-126)Online publication date: 15-Jun-2021
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in