Two-dimensional Taxonomy for N-ary Knowledge Representation Learning Methods

Liubov Tupikina; Mehwish Alam; Xiaohua Lu

REVIEW 2 major objections 5 minor 224 references

Two-dimensional Taxonomy for N-ary Knowledge Representation Learning Methods

T0 review · 2 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read A two-axis taxonomy maps n-ary knowledge representation learning methods, unifying an otherwise fragmented field.

desk verdict Useful survey of n-ary knowledge representation learning whose central taxonomy has a correctable but real inconsistency in the m-TransH classification. read the letter →

arxiv 2506.05626 v2 pith:I4XWXP2V submitted 2025-06-05 cs.LG

Xiaohua Lu , Liubov Tupikina , Mehwish Alam This is my paper

classification cs.LG

keywords n-aryrelationalrepresentationlearningknowledgehypergraphhyper-relationalgraphtaxonomylinkpredictionentityrolesposition-awaremodelsrole-aware

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper argues that representation learning for n-ary relational knowledge—facts involving more than two entities—has matured enough to be organized along two independent axes: how a model encodes n-ary facts (translation, tensor factorization, deep networks, logic rules, hyperedge expansion) and how much it is aware of entity positions and semantic roles (aware-less, position-aware, role-aware). The survey unifies terminology across knowledge hypergraphs and hyper-relational knowledge graphs, defines link prediction and full expressiveness, maps existing models into the two-dimensional taxonomy, and distills design guidelines for future models. If the taxonomy holds, it gives researchers a shared language and a concrete checklist for building and comparing n-ary models, where none existed before.

What carries the argument

The organizing device is a two-dimensional grid. The first axis is methodology: translation-based, tensor factorisation-based, deep neural network-based, logic rules-based, and hyperedge expansion-based methods. The second axis is semantic awareness: aware-less models ignore entity order, position-aware models encode entity positions or weights, and role-aware models encode specific role-entity semantics; the paper notes that a model encoding both position and role also falls in the role-aware category. The grid, shown in Table I, carries the argument because each model gets a coordinate that simultaneously explains its technical lineage and its semantic expressiveness.

What would settle it

Inspect Table I against Section V.B's definition: if a model whose scoring function explicitly weights roles, such as m-TransH with its role-weight function $a_r(\rho)$, is placed outside the role-aware class, then the awareness dimension is not a mutually exclusive partition and the taxonomy's classifying claim fails.

Watch

Extended reading notes

Core claim

The central claim is that every existing n-ary relational representation learning method can be classified by a two-dimensional taxonomy: one dimension for the technical modelling principle and another for the degree of semantic awareness of entities' positions and roles. The authors assert that this classification reveals the evolution from simple extensions of binary knowledge graph models, such as m-TransH and m-CP, to fully expressive and role-aware designs such as RAM, PosKHG, STARE, ShrinkE, and TransEQ. They further claim the taxonomy supports practical guidance: it motivates a set of desirable properties (position and role awareness, full expressiveness, relational algebra support, mixed-arity support, efficiency, interpretability, and multimodal capability) and clarifies which benchmark datasets and negative-sampling strategies suit which settings.

Load-bearing premise

The taxonomy's second dimension assumes each surveyed model can be placed in exactly one of the three awareness categories—aware-less, position-aware, or role-aware—and that those categories are mutually exclusive.

Editorial extensions

If this is right

New n-ary models can be positioned by two coordinates, making their assumptions about roles and positions explicit at design time.
Unified definitions of KHG, HKG, HTKG, and N-TKG, plus a shared link-prediction formulation, make results across papers directly comparable.
The design-principle list gives concrete targets—full expressiveness, relational algebra support, mixed-arity handling, linear scaling—that future models can be measured against.
The dataset and negative-sampling summary provides a standard evaluation toolkit, identifying which existing strategies transfer poorly and which transfer well to n-ary settings.
Temporal, inductive, and multimodal extensions are identified as the next frontier for n-ary relational representation learning.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The two dimensions may not be fully orthogonal: role-aware models cluster in the neural-network and tensor-factorisation columns, while translation-based models are mostly position-aware, so the awareness axis may partly track methodological maturity rather than an independent design choice.
The paper's position-versus-role boundary is graded rather than discrete, since a model encoding both falls into role-aware; a future taxonomy could replace three categories with a spectrum from order-insensitive to role-sensitive.
The taxonomy exposes a concrete research gap: logic-rule and hyperedge-expansion approaches are represented by only a handful of models, making those the least-explored cells of the grid.
One could test the taxonomy's utility empirically by asking whether models in the same cell share failure modes or transferability to mixed-arity and temporal settings, a test the survey itself does not run.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Dear colleague,

We both know surveys are only as good as their classifications. This one is mostly solid, but the stress-test note is right: the paper places m-TransH in the position-aware category even though its own Section V.B defines role-aware as explicitly encoding semantic roles, and Section V.A.1 describes m-TransH as 'redefining an n-ary fact as a mapping of roles to entities' with a role-weighting function a_r(ρ). A model that assigns weights to role labels rather than to positions is role-aware by the paper's own definition, and the paper even says models encoding both positional and role information belong in the role-aware category. That is a genuine internal inconsistency, not a stylistic choice. It is also fixable: move m-TransH to the role-aware cell and adjust the paragraph.

What the paper does well: it gives clean unified definitions for KHG, HKG, HTKG, and N-TKG, formalizes the corresponding link prediction tasks, and provides a useful map of datasets and negative-sampling strategies. As far as I know it is the first survey dedicated to this subfield, and the two-dimensional view (methodology x awareness) is a reasonable organizing device. The technical background sections on HGRL and KGRL are conventional but serve their purpose.

The softer spots: the boundary between position-aware and role-aware is stated rather than operationalized. The position-aware definition includes 'importance/weight of entities,' which naturally overlaps with role semantics, so the m-TransH issue may not be the only borderline case. The aware-less category also seems to absorb a lot (anything without explicit position or role encoding), which is fine for a first pass. I spot-checked a few other cells (BoxE, m-CP, RAM, NaLP) and they look defensible. There is a typo in the abstract ('relatinoal') and some bibliography formatting issues, but nothing substantial.

Bottom line: this is a useful survey for people entering n-ary knowledge representation learning, and the taxonomy, once corrected, will be a handy reference. It should go to peer review; the inconsistency is real but correctable, and the paper deserves a serious referee who knows the literature and can check the other classifications. I would recommend accepting after a round of revision, not desk rejection.

Referee Report

2 major / 5 minor

Summary. The paper proposes a two-dimensional taxonomy for n-ary relational representation learning methods, covering both knowledge hypergraphs and hyper-relational knowledge graphs. The first dimension organizes models by modeling methodology (translation-based, tensor factorisation-based, deep neural network-based, logic rule-based, hyperedge expansion-based), while the second dimension classifies them by semantic awareness (aware-less, position-aware, role-aware). The paper also unifies definitions for KHGs, HKGs, temporal variants, and link prediction tasks; reviews benchmark datasets and negative sampling strategies; and concludes with design principles and open challenges. The contribution is organizational rather than empirical: no new models or experiments are presented.

Significance. If the taxonomy is internally consistent, it is a useful contribution because existing surveys focus on binary knowledge graphs or plain hypergraphs, leaving the n-ary knowledge representation landscape fragmented. The paper provides broad coverage of recent models, clarifies terminology for KHGs and HKGs, and offers practical guidance on datasets and negative sampling. Its strengths include a comprehensive model inventory, explicit design guidelines, and a clear presentation of temporal and qualifier-based extensions. However, the value of the central contribution rests entirely on the consistency with which the awareness categories are applied; the classification of m-TransH is a concrete counterexample that undermines the claim of a systematic partition. The paper is therefore a defensible survey in scope, but it needs definitional and classification revisions before the taxonomy can be relied upon.

major comments (2)

[§V.B / §V.A.1, Eq. (6)] Section V.B defines role-aware models as those that "explicitly encode the semantic roles that entities play in a relation" and further states that models encoding both positional and role information also belong to this category. Section V.A.1, however, places m-TransH under position-aware models while describing it as "redefining an n-ary fact as a mapping of roles to entities" and introducing "a function a_r(ρ) to weight each role ρ" in Eq. (6). Because Eq. (6) makes the score depend on the role labels, m-TransH satisfies the paper's own role-aware definition. The placement in the position-aware column is internally inconsistent. The authors must either reclassify m-TransH as role-aware or explicitly justify why scalar role weights count as positional importance rather than role encoding; otherwise the second dimension is not a reliable partition.
[§V.B / Table I] Section V.B includes the note that "if the model encodes both positional and role information, it also falls into this category." This makes the role-aware category a superset of the position-aware category, so the three awareness categories are not mutually exclusive. Elsewhere the paper says the second dimension "divides" models into aware-less, position-aware, and role-aware, and Table I assigns each model to exactly one column. These two statements cannot both be true. The authors should specify whether the awareness dimension is a partition or an ordered hierarchy. If it is a partition, the note must be removed or revised; if it is a hierarchy, the table and the associated discussion should be adjusted accordingly.

minor comments (5)

[§V.A.2] The sentence describing HypE's expressiveness reads "This method is is fully expressive"; the duplicated "is" should be removed.
[§V.C.3] The phrase "unseened during training" should be corrected to "unseen during training".
[§VI.A.1] The dataset name "WikiPeople-43" should be "WikiPeople-4".
[Index Terms] The index term "n-ary relatinoal data" contains a typo and should read "n-ary relational data".
[Table I] The table layout makes the cell boundaries for the Translation-based row ambiguous, particularly for m-TransH, BoxE, and RAE; the authors should verify that the column alignment renders correctly and clearly shows which models belong to which awareness category.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found: the taxonomy is an organizational survey claim with no fitted inputs, no predictions from fitted parameters, and no load-bearing self-citations.

full rationale

This is a survey paper whose central deliverable is a two-dimensional taxonomy. There is no derivation chain: no model is fitted, no experimental prediction is made from fitted parameters, and no formal theorem is proved from assumptions that contain the conclusion. The taxonomy's first dimension (modelling methodology) and second dimension (aware-less/position-aware/role-aware) are definitions applied to external literature, and the models' scoring functions (Eqs. 6-15) are quoted from prior work rather than derived here. Self-citations by the authors (e.g., refs [4], [8], [11], [19]) appear only as background references for KG applications and datasets, not as load-bearing evidence for the taxonomy; no uniqueness theorem or prior-work result is imported to force the paper's choices. The only internal tension is that m-TransH is placed in the position-aware category in Table I and Section V.A.1 while its role-weighting function a_r(ρ) arguably satisfies the paper's own role-aware definition in Section V.B; this is a classification-consistency/correctness issue, not a circularity, because the category definitions are not defined in terms of the classification output and no prediction is forced by construction. Therefore the paper is not circular.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

The central claim of the taxonomy rests on the audited assumptions. There are no fitted parameters or invented entities. The main burden is the consistency of category assignment and the accuracy of the secondary literature.

assumptions (3)

ad hoc to paper The awareness categories (aware-less, position-aware, role-aware) are well-defined and each model can be unambiguously assigned to exactly one.
Section V defines these categories but the paper itself assigns m-TransH to position-aware despite its role-weighting function, showing the categories are not applied consistently.
domain assumption The descriptions and expressiveness claims of the surveyed models, as cited, are accurate.
The taxonomy classifies models based on descriptions from the original papers; errors in those descriptions would propagate into the taxonomy.
domain assumption The literature search is comprehensive and no major existing survey covers KHG/HKG representation learning.
Section III claims 'no existing survey has yet targeted representation learning over KHGs or HKGs'; this is asserted rather than demonstrated by a systematic search protocol.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Two-dimensional Taxonomy for N-ary Knowledge Representation Learning Methods." pith.science (2026). https://pith.science/paper/I4XWXP2V

@misc{pith2026250605626,
  author       = {Pith},
  title        = {Pith review of: Two-dimensional Taxonomy for N-ary Knowledge Representation Learning Methods},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/I4XWXP2V}},
  note         = {Machine review of arXiv:2506.05626}
}

read the original abstract

Real-world knowledge can take various forms, including structured, semi-structured, and unstructured data. Among these, knowledge graphs are a form of structured human knowledge that integrate heterogeneous data sources into structured representations but typically reduce complex n-ary relations to simple triples, thereby losing higher-order relational details. In contrast, hypergraphs naturally represent n-ary relations with hyperedges, which directly connect multiple entities together. Yet hypergraph representation learning often overlooks entity roles in hyperedges, limiting the finegrained semantic modelling. To address these issues, knowledge hypergraphs and hyper-relational knowledge graphs combine the advantages of knowledge graphs and hypergraphs to better capture the complex structures and role-specific semantics of real world knowledge. This survey provides a comprehensive review of methods handling n-ary relational data, covering both knowledge hypergraphs and hyper-relational knowledge graphs literatures. We propose a two-dimensional taxonomy: the first dimension categorises models based on their methodology, i.e., translation-based models, tensor factorisation-based models, deep neural network-based models, logic rules-based models, and hyperedge expansion-based models. The second dimension classifies models according to their awareness of entity roles and positions in n-ary relations, dividing them into aware-less, position-aware, and role-aware approaches. Finally, we discuss existing datasets, training settings and strategies, and outline open challenges to inspire future research.

Figures

Figures reproduced from arXiv: 2506.05626 by the authors.

**Figure 1.** Comparison of KG and HG. (a) A standard KG models facts about the film Inception using binary relations. (b) A HG represents co-authorship in a [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗

**Figure 2.** Comparison of KHG and HKG. (a) A HKG enriches primary triples with a set of role-specific qualifiers. (b) A KHG directly models n-ary relational [PITH_FULL_IMAGE:figures/full_fig_p002_2.png] view at source ↗

**Figure 3.** Reconstructions of HG to graph. [40] 2) Matrix Factorisation-based Methods: Matrix factorisation-based HGRL, also called Tensor factorisation, aims to construct an approximate matrix of the original HG and then decompose it to learn low-dimensional node embeddings. These approaches fall into two main categories: Laplacian matrix factorisation and adjacency matrix factorisation [52]. Laplacian-based methods, also cal… view at source ↗

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

224 extracted references · 51 canonical work pages

[1]

A survey on knowledge graphs: Representation, acquisition, and applications,

S. Ji, S. Pan, E. Cambria, P. Marttinen, and S. Y . Philip, “A survey on knowledge graphs: Representation, acquisition, and applications,” IEEE transactions on neural networks and learning systems , vol. 33, no. 2, pp. 494–514, 2021

2021
[2]

Development of knowledge graph for university courses management,

I. Aliyu, A. Kana, S. Aliyu et al. , “Development of knowledge graph for university courses management,” International Journal of Education and Management Engineering , vol. 10, no. 2, p. 1, 2020

2020
[3]

Knowledge graph in smart education: A case study of entrepreneurship scientific publication management,

Y . Chi, Y . Qin, R. Song, and H. Xu, “Knowledge graph in smart education: A case study of entrepreneurship scientific publication management,” Sustainability, vol. 10, no. 4, p. 995, 2018

2018
[4]

Analyzing social media for measuring public attitudes toward controversies and their driving factors: a case study of migration,

Y . Chen, H. Sack, and M. Alam, “Analyzing social media for measuring public attitudes toward controversies and their driving factors: a case study of migration,” Soc. Netw. Anal. Min., vol. 12, no. 1, p. 135, 2022

2022
[5]

Smr: medical knowledge graph embedding for safe medicine recommendation,

F. Gong, M. Wang, H. Wang, S. Wang, and M. Liu, “Smr: medical knowledge graph embedding for safe medicine recommendation,” Big Data Research, vol. 23, p. 100174, 2021

2021
[6]

Financial time series forecast- ing with multi-modality graph neural network,

D. Cheng, F. Yang, S. Xiang, and J. Liu, “Financial time series forecast- ing with multi-modality graph neural network,” Pattern Recognition, vol. 121, p. 108218, 2022

2022
[7]

Knowledge graphs: Opportunities and challenges,

C. Peng, F. Xia, M. Naseriparsa, and F. Osborne, “Knowledge graphs: Opportunities and challenges,” Artificial Intelligence Review , vol. 56, no. 11, pp. 13 071–13 102, 2023

2023
[8]

Neurosymbolic Methods for Dynamic Knowledge Graphs

M. Alam, G. A. Gesese, and P.-H. Paris, “Neurosymbolic methods for dynamic knowledge graphs,” arXiv preprint arXiv:2409.04572 , 2024

work page Pith review arXiv 2024

Show all 224 references

[9]

Wordnet:: Similarity- measuring the relatedness of concepts

T. Pedersen, S. Patwardhan, J. Michelizzi et al., “Wordnet:: Similarity- measuring the relatedness of concepts.” in AAAI, vol. 4, 2004, pp. 25–29

2004
[10]

Dbpedia: A nucleus for a web of open data,

S. Auer, C. Bizer, G. Kobilarov, J. Lehmann, R. Cyganiak, and Z. Ives, “Dbpedia: A nucleus for a web of open data,” in international semantic web conference. Springer, 2007, pp. 722–735

2007
[11]

Y AGO 4.5: A large and clean knowledge base with a rich taxonomy,

F. M. Suchanek, M. Alam, T. Bonald, L. Chen, P. Paris, and J. Soria, “Y AGO 4.5: A large and clean knowledge base with a rich taxonomy,” in Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2024, Washington D...

2024
[12]

Free- base: a collaboratively created graph database for structuring human knowledge,

K. Bollacker, C. Evans, P. Paritosh, T. Sturge, and J. Taylor, “Free- base: a collaboratively created graph database for structuring human knowledge,” in Proceedings of the 2008 ACM SIGMOD international conference on Management of data , 2008, pp. 1247–1250

2008
[13]

Wikidata: a free collaborative knowl- edgebase,

D. Vrande ˇci´c and M. Kr ¨otzsch, “Wikidata: a free collaborative knowl- edgebase,” Communications of the ACM , vol. 57, no. 10, pp. 78–85, 2014

2014
[14]

Model: Motif- based deep feature learning for link prediction,

L. Wang, J. Ren, B. Xu, J. Li, W. Luo, and F. Xia, “Model: Motif- based deep feature learning for link prediction,” IEEE Transactions on Computational Social Systems , vol. 7, no. 2, pp. 503–516, 2020

2020
[15]

Realistic re- evaluation of knowledge graph completion methods: An experimental study,

F. Akrami, M. S. Saeef, Q. Zhang, W. Hu, and C. Li, “Realistic re- evaluation of knowledge graph completion methods: An experimental study,” in Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data , 2020, pp. 1995–2010

2020
[16]

Commonsense for generative multi-hop question answering tasks,

L. Bauer, Y . Wang, and M. Bansal, “Commonsense for generative multi-hop question answering tasks,” arXiv preprint arXiv:1809.06309, 2018

2018 arXiv
[17]

Predicate constraints based question answering over knowledge graph,

S. Shin, X. Jin, J. Jung, and K.-H. Lee, “Predicate constraints based question answering over knowledge graph,” Information Processing & Management, vol. 56, no. 3, pp. 445–462, 2019

2019
[18]

Improving multi-hop question answering over knowledge graphs using knowledge base embeddings,

A. Saxena, A. Tripathi, and P. Talukdar, “Improving multi-hop question answering over knowledge graphs using knowledge base embeddings,” in Proceedings of the 58th annual meeting of the association for computational linguistics, 2020, pp. 4498–4507

2020
[19]

A survey on knowledge-aware news recommender systems,

A. Iana, M. Alam, and H. Paulheim, “A survey on knowledge-aware news recommender systems,” Semantic Web, vol. 15, no. 1, pp. 21–82,
[20]

Explainable reasoning over knowledge graphs for recommendation,

X. Wang, D. Wang, C. Xu, X. He, Y . Cao, and T.-S. Chua, “Explainable reasoning over knowledge graphs for recommendation,” in Proceedings of the AAAI conference on artificial intelligence , vol. 33, 2019, pp. 5329–5336

2019
[21]

Shifu2: A network representation learning based model for advisor- advisee relationship mining,

J. Liu, F. Xia, L. Wang, B. Xu, X. Kong, H. Tong, and I. King, “Shifu2: A network representation learning based model for advisor- advisee relationship mining,” IEEE Transactions on Knowledge and Data Engineering, vol. 33, no. 4, pp. 1763–1777, 2019

2019
[22]

Higher-order networks representation and learning: A survey,

H. Tian and R. Zafarani, “Higher-order networks representation and learning: A survey,” ACM SIGKDD Explorations Newsletter , vol. 26, no. 1, pp. 1–18, 2024

2024
[23]

Hplapgcn: Hypergraph p-laplacian graph convolutional networks,

S. Fu, W. Liu, Y . Zhou, and L. Nie, “Hplapgcn: Hypergraph p-laplacian graph convolutional networks,” Neurocomputing, vol. 362, pp. 166– 174, 2019

2019
[24]

Nonuniform hyper- network embedding with dual mechanism,

J. Huang, C. Chen, F. Ye, W. Hu, and Z. Zheng, “Nonuniform hyper- network embedding with dual mechanism,” ACM Transactions on Information Systems (TOIS) , vol. 38, no. 3, pp. 1–18, 2020

2020
[25]

Dynamic hypergraph neural networks

J. Jiang, Y . Wei, Y . Feng, J. Cao, and Y . Gao, “Dynamic hypergraph neural networks.” in IJCAI, 2019, pp. 2635–2641

2019
[26]

Deep hyperedges: a framework for transductive and inductive learning on hypergraphs,

J. Payne, “Deep hyperedges: a framework for transductive and inductive learning on hypergraphs,” arXiv preprint arXiv:1910.02633 , 2019

1910 arXiv
[29]

Netvec: A scalable hypergraph embedding system,

S. Maleki, D. P. Wall, and K. Pingali, “Netvec: A scalable hypergraph embedding system,” in Proc. of the Int. Conf. on Machine Learning- Workshops, 2021

2021
[30]

Practical parallel hypergraph algorithms,

J. Shun, “Practical parallel hypergraph algorithms,” in Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2020, pp. 232–249

2020
[31]

Learning over families of sets-hypergraph representation learning for higher order tasks,

B. Srinivasan, D. Zheng, and G. Karypis, “Learning over families of sets-hypergraph representation learning for higher order tasks,” in Proceedings of the 2021 SIAM International Conference on Data Mining (SDM). SIAM, 2021, pp. 756–764

2021
[32]

Modeling multi-way relations with hypergraph embedding,

C.-A. Yu, C.-L. Tai, T.-S. Chan, and Y .-H. Yang, “Modeling multi-way relations with hypergraph embedding,” in Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 2018, pp. 1707–1710

2018
[33]

Knowledge hypergraphs: Prediction beyond binary relations,

B. Fatemi, P. Taslakian, D. Vazquez, and D. Poole, “Knowledge hypergraphs: Prediction beyond binary relations,” arXiv preprint arXiv:1906.00137, 2019

1906 arXiv
[34]

Neuinfer: Knowledge inference on n-ary facts,

S. Guan, X. Jin, J. Guo, Y . Wang, and X. Cheng, “Neuinfer: Knowledge inference on n-ary facts,” in Proceedings of the 58th annual meeting of the association for computational linguistics , 2020, pp. 6141–6151. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 15

2020
[35]

A survey on temporal knowledge graph: Representation learning and applications,

L. Cai, X. Mao, Y . Zhou, Z. Long, C. Wu, and M. Lan, “A survey on temporal knowledge graph: Representation learning and applications,” arXiv preprint arXiv:2403.04782 , 2024

2024 arXiv
[36]

Yago2: exploring and querying world knowledge in time, space, context, and many languages,

J. Hoffart, F. M. Suchanek, K. Berberich, E. Lewis-Kelham, G. De Melo, and G. Weikum, “Yago2: exploring and querying world knowledge in time, space, context, and many languages,” in Proceed- ings of the 20th international conference companion on World wide web, 2011, pp. 229–232

2011
[37]

On the representation and embedding of knowledge bases beyond binary relations,

J. Wen, J. Li, Y . Mao, S. Chen, and R. Zhang, “On the representation and embedding of knowledge bases beyond binary relations,” arXiv preprint arXiv:1604.08642, 2016

2016 arXiv
[38]

Neural message passing for multi-relational ordered and recursive hypergraphs,

N. Yadati, “Neural message passing for multi-relational ordered and recursive hypergraphs,” Advances in Neural Information Processing Systems, vol. 33, pp. 3275–3289, 2020

2020
[39]

Hyperbolic hypergraph neural networks for multi-relational knowledge hypergraph representa- tion,

M. Li, X. Shi, C. Qiao, T. Zhang, and H. Jin, “Hyperbolic hypergraph neural networks for multi-relational knowledge hypergraph representa- tion,” arXiv preprint arXiv:2412.12158 , 2024

2024 arXiv
[40]

A survey on hypergraph representation learning,

A. Antelmi, G. Cordasco, M. Polato, V . Scarano, C. Spagnuolo, and D. Yang, “A survey on hypergraph representation learning,” ACM Computing Surveys, vol. 56, no. 1, pp. 1–38, 2023

2023
[41]

Poskhg: A position-aware knowledge hypergraph model for link prediction,

Z. Chen, X. Wang, C. Wang, and Z. Li, “Poskhg: A position-aware knowledge hypergraph model for link prediction,” Data Science and Engineering, vol. 8, no. 2, pp. 135–145, 2023

2023
[42]

Message passing for hyper-relational knowledge graphs,

M. Galkin, P. Trivedi, G. Maheshwari, R. Usbeck, and J. Lehmann, “Message passing for hyper-relational knowledge graphs,” arXiv preprint arXiv:2009.10847, 2020

2009 arXiv
[43]

Temporal knowledge graph reasoning based on n-tuple modeling,

Z. Hou, X. Jin, Z. Li, L. Bai, S. Guan, Y . Zeng, J. Guo, and X. Cheng, “Temporal knowledge graph reasoning based on n-tuple modeling,” in Findings of the Association for Computational Linguistics: EMNLP 2023, 2023, pp. 1090–1100

2023
[44]

Temporal fact reasoning over hyper-relational knowledge graphs,

Z. Ding, J. Wu, J. Wu, Y . Xia, and V . Tresp, “Temporal fact reasoning over hyper-relational knowledge graphs,” arXiv preprint arXiv:2307.10219, 2023

2023 arXiv
[45]

Learning represen- tations for hyper-relational knowledge graphs,

H. Shomer, W. Jin, J. Li, Y . Ma, and H. Liu, “Learning represen- tations for hyper-relational knowledge graphs,” in Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2023, pp. 253–257

2023
[46]

Link prediction on n-ary relational facts: A graph-based approach,

Q. Wang, H. Wang, Y . Lyu, and Y . Zhu, “Link prediction on n-ary relational facts: A graph-based approach,” arXiv preprint arXiv:2105.08476, 2021

2021 arXiv
[47]

Generalizing tensor decomposition for n- ary relational knowledge bases,

Y . Liu, Q. Yao, and Y . Li, “Generalizing tensor decomposition for n- ary relational knowledge bases,” in Proceedings of the web conference 2020, 2020, pp. 1104–1114

2020
[48]

From knowledge graph embedding to ontology embedding? an analysis of the compatibility between vector space representations and rules,

V . Gutierrez Basulto and S. Schockaert, “From knowledge graph embedding to ontology embedding? an analysis of the compatibility between vector space representations and rules,” 2018

2018
[50]

Knowledge graph embed- ding: A survey from the perspective of representation spaces,

J. Cao, J. Fang, Z. Meng, and S. Liang, “Knowledge graph embed- ding: A survey from the perspective of representation spaces,” ACM Computing Surveys, vol. 56, no. 6, pp. 1–42, 2024

2024
[51]

Hypergraph learning: Methods and practices,

Y . Gao, Z. Zhang, H. Lin, X. Zhao, S. Du, and C. Zou, “Hypergraph learning: Methods and practices,” IEEE Transactions on Pattern Anal- ysis and Machine Intelligence , vol. 44, no. 5, pp. 2548–2566, 2020

2020
[52]

Hypergraph and uncertain hypergraph representation learning theory and methods,

L. Zhang, J. Guo, J. Wang, J. Wang, S. Li, and C. Zhang, “Hypergraph and uncertain hypergraph representation learning theory and methods,” Mathematics, vol. 10, no. 11, p. 1921, 2022

1921
[53]

Hyper-path-based representation learn- ing for hyper-networks,

J. Huang, X. Liu, and Y . Song, “Hyper-path-based representation learn- ing for hyper-networks,” in Proceedings of the 28th ACM International Conference on Information and Knowledge Management , 2019, pp. 449–458

2019
[54]

Lbsn2vec++: Het- erogeneous hypergraph embedding for location-based social networks,

D. Yang, B. Qu, J. Yang, and P. Cudr ´e-Mauroux, “Lbsn2vec++: Het- erogeneous hypergraph embedding for location-based social networks,” IEEE Transactions on Knowledge and Data Engineering , vol. 34, pp. 1843–1855, 2020

2020
[55]

Exploiting cross-order patterns and link prediction in higher-order networks,

H. Tian, S. Jin, and R. Zafarani, “Exploiting cross-order patterns and link prediction in higher-order networks,” in 2022 IEEE International Conference on Data Mining Workshops (ICDMW) . IEEE, 2022, pp. 1–9

2022
[56]

Hypergraph theory,

A. Bretto, “Hypergraph theory,” An introduction. Mathematical Engi- neering. Cham: Springer , vol. 1, pp. 209–216, 2013

2013
[57]

Laplacian eigenmaps for dimensionality reduction and data representation,

M. Belkin and P. Niyogi, “Laplacian eigenmaps for dimensionality reduction and data representation,” Neural computation, vol. 15, no. 6, pp. 1373–1396, 2003

2003
[58]

A unified feature selection framework for graph embedding on high dimensional data,

M. Chen, I. W. Tsang, M. Tan, and T. J. Cham, “A unified feature selection framework for graph embedding on high dimensional data,” IEEE Transactions on Knowledge and Data Engineering, vol. 27, no. 6, pp. 1465–1477, 2014

2014
[59]

Laplacian score for feature selection,

X. He, D. Cai, and P. Niyogi, “Laplacian score for feature selection,” Advances in neural information processing systems , vol. 18, 2005

2005
[60]

Learning with hypergraphs: Clustering, classification, and embedding,

D. Zhou, J. Huang, and B. Sch ¨olkopf, “Learning with hypergraphs: Clustering, classification, and embedding,” Advances in neural infor- mation processing systems , vol. 19, 2006

2006
[61]

Spectra, euclidean representations and clusterings of hyper- graphs,

M. Bolla, “Spectra, euclidean representations and clusterings of hyper- graphs,” Discrete Mathematics, vol. 117, no. 1-3, pp. 19–39, 1993

1993
[62]

Hypergraph learning with hyperedge ex- pansion,

L. Pu and B. Faltings, “Hypergraph learning with hyperedge ex- pansion,” in Joint European Conference on Machine Learning and Knowledge Discovery in Databases . Springer, 2012, pp. 410–425

2012
[63]

Heterogeneous hypergraph embedding for document recommendation,

Y . Zhu, Z. Guan, S. Tan, H. Liu, D. Cai, and X. He, “Heterogeneous hypergraph embedding for document recommendation,” Neurocomput- ing, vol. 216, pp. 150–162, 2016

2016
[64]

On the laplacian eigenvalues and metric parameters of hypergraphs,

J. A. Rodriguez, “On the laplacian eigenvalues and metric parameters of hypergraphs,” Linear and Multilinear Algebra , vol. 50, no. 1, pp. 1–14, 2002

2002
[65]

Hypergraph p-laplacian: A differential geometry view,

S. Saito, D. Mandic, and H. Suzuki, “Hypergraph p-laplacian: A differential geometry view,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 32, 2018

2018
[66]

Hypergraph embedding for spatial-spectral joint feature extraction in hyperspectral images,

Y . Sun, S. Wang, Q. Liu, R. Hang, and G. Liu, “Hypergraph embedding for spatial-spectral joint feature extraction in hyperspectral images,” remote sensing, vol. 9, no. 5, p. 506, 2017

2017
[67]

Feature learning using spatial-spectral hypergraph discriminant analysis for hyperspectral im- age,

F. Luo, B. Du, L. Zhang, L. Zhang, and D. Tao, “Feature learning using spatial-spectral hypergraph discriminant analysis for hyperspectral im- age,” IEEE transactions on cybernetics , vol. 49, no. 7, pp. 2406–2419, 2018

2018
[68]

Semisupervised hypergraph discriminant learning for dimensionality reduction of hy- perspectral image,

F. Luo, T. Guo, Z. Lin, J. Ren, and X. Zhou, “Semisupervised hypergraph discriminant learning for dimensionality reduction of hy- perspectral image,” IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing , vol. 13, pp. 4242–4256, 2020

2020
[69]

Learning with hypergraph for hyperspec- tral image feature extraction,

H. Yuan and Y . Y . Tang, “Learning with hypergraph for hyperspec- tral image feature extraction,” IEEE Geoscience and Remote Sensing Letters, vol. 12, no. 8, pp. 1695–1699, 2015

2015
[70]

Discriminant hyper-laplacian projections and its scalable extension for dimensionality reduction,

S. Huang, D. Yang, Y . Ge, and X. Zhang, “Discriminant hyper-laplacian projections and its scalable extension for dimensionality reduction,” Neurocomputing, vol. 173, pp. 145–153, 2016

2016
[71]

Em- bedding learning with events in heterogeneous information networks,

H. Gui, J. Liu, F. Tao, M. Jiang, B. Norick, L. Kaplan, and J. Han, “Em- bedding learning with events in heterogeneous information networks,” IEEE transactions on knowledge and data engineering , vol. 29, no. 11, pp. 2428–2441, 2017

2017
[72]

Large-scale embedding learning in heterogeneous event data,

H. Gui, J. Liu, F. Tao, M. Jiang, B. Norick, and J. Han, “Large-scale embedding learning in heterogeneous event data,” in 2016 IEEE 16th International Conference on Data Mining (ICDM) . IEEE, 2016, pp. 907–912

2016
[73]

Hypergraph partitioning with embeddings,

J. Sybrandt, R. Shaydulin, and I. Safro, “Hypergraph partitioning with embeddings,” IEEE Transactions on Knowledge and Data Engineering, vol. 34, no. 6, pp. 2771–2782, 2020

2020
[74]

Revisiting user mobility and social relationships in lbsns: a hypergraph embedding approach,

D. Yang, B. Qu, J. Yang, and P. Cudre-Mauroux, “Revisiting user mobility and social relationships in lbsns: a hypergraph embedding approach,” in The world wide web conference , 2019, pp. 2147–2157

2019
[75]

Learning holistic interactions in lbsns with high-order, dynamic, and multi-role contexts,

H. T. Trung, T. Van Vinh, N. T. Tam, J. Jo, H. Yin, and N. Q. V . Hung, “Learning holistic interactions in lbsns with high-order, dynamic, and multi-role contexts,” IEEE Transactions on Knowledge and Data Engineering, vol. 35, no. 5, pp. 5002–5016, 2022

2022
[76]

Efficient estimation of word representations in vector space,

T. Mikolov, K. Chen, G. Corrado, and J. Dean, “Efficient estimation of word representations in vector space,” arXiv preprint arXiv:1301.3781, 2013

2013 arXiv
[77]

Hyper2vec: Biased random walk for hyper-network embedding,

J. Huang, C. Chen, F. Ye, J. Wu, Z. Zheng, and G. Ling, “Hyper2vec: Biased random walk for hyper-network embedding,” in Database Systems for Advanced Applications: DASFAA 2019 International Work- shops: BDMS, BDQM, and GDMA, Chiang Mai, Thailand, April 22– 25, 2019, Proceeding...

2019
[78]

Social-guided representation learning for images via deep heterogeneous hypergraph embedding,

Y . Chu, C. Feng, and C. Guo, “Social-guided representation learning for images via deep heterogeneous hypergraph embedding,” in 2018 IEEE International Conference on Multimedia and Expo (ICME) . IEEE, 2018, pp. 1–6

2018
[79]

Music recommendation via hypergraph embedding,

V . La Gatta, V . Moscato, M. Pennone, M. Postiglione, and G. Sperl ´ı, “Music recommendation via hypergraph embedding,” IEEE transac- tions on neural networks and learning systems , vol. 34, no. 10, pp. 7887–7899, 2022

2022
[80]

Hyper-sagnn: a self-attention based graph neural network for hypergraphs,

R. Zhang, Y . Zou, and J. Ma, “Hyper-sagnn: a self-attention based graph neural network for hypergraphs,” arXiv preprint arXiv:1911.02613, 2019. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 16

1911 arXiv
[81]

Hypernetwork representation learning with the set constraint,

Y . Zhu and H. Zhao, “Hypernetwork representation learning with the set constraint,” Applied Sciences, vol. 12, no. 5, p. 2650, 2022

2022
[82]

Deepwalk: Online learning of social representations,

B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: Online learning of social representations,” in Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining , 2014, pp. 701–710

2014
[83]

Line: Large-scale information network embedding,

J. Tang, M. Qu, M. Wang, M. Zhang, J. Yan, and Q. Mei, “Line: Large-scale information network embedding,” in Proceedings of the 24th international conference on world wide web , 2015, pp. 1067– 1077

2015
[84]

node2vec: Scalable feature learning for networks,

A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining , 2016, pp. 855– 864

2016
[85]

Hypergraph neural networks,

Y . Feng, H. You, Z. Zhang, R. Ji, and Y . Gao, “Hypergraph neural networks,” in Proceedings of the AAAI conference on artificial intelli- gence, vol. 33, 2019, pp. 3558–3565

2019
[86]

Hypergcn: Hypergraph convolutional networks for semi- supervised learning and combinatorial optimisation,

N. Yadati, M. Nimishakavi, P. Yadav, V . Nitin, A. Louis, and P. Talukdar, “Hypergcn: Hypergraph convolutional networks for semi- supervised learning and combinatorial optimisation,” arXiv preprint arXiv:1809.02589, 2019

2019 arXiv
[87]

Heterogeneous hypergraph embedding for graph classification,

X. Sun, H. Yin, B. Liu, H. Chen, J. Cao, Y . Shao, and N. Q. Viet Hung, “Heterogeneous hypergraph embedding for graph classification,” in Proceedings of the 14th ACM international conference on web search and data mining , 2021, pp. 725–733

2021
[88]

Adahgnn: Adaptive hypergraph neural networks for multi-label image classification,

X. Wu, Q. Chen, W. Li, Y . Xiao, and B. Hu, “Adahgnn: Adaptive hypergraph neural networks for multi-label image classification,” in Proceedings of the 28th ACM international conference on multimedia , 2020, pp. 284–293

2020
[89]

Unignn: a unified framework for graph and hypergraph neural networks,

J. Huang and J. Yang, “Unignn: a unified framework for graph and hypergraph neural networks,” arXiv preprint arXiv:2105.00956 , 2021

2021 arXiv
[90]

Joint personalized search and recommendation with hypergraph convolutional networks,

T. Thonet, J.-M. Renders, M. Choi, and J. Kim, “Joint personalized search and recommendation with hypergraph convolutional networks,” in European Conference on Information Retrieval . Springer, 2022, pp. 443–456

2022
[91]

Hnhn: Hypergraph networks with hyperedge neurons,

Y . Dong, W. Sawin, and Y . Bengio, “Hnhn: Hypergraph networks with hyperedge neurons,” arXiv preprint arXiv:2006.12278 , 2020

2006 arXiv
[92]

Hypergraph convolutional recurrent neural network,

J. Yi and J. Park, “Hypergraph convolutional recurrent neural network,” in Proceedings of the 26th ACM SIGKDD international conference on knowledge discovery & data mining , 2020, pp. 3366–3376

2020
[93]

Edge repre- sentation learning with hypergraphs,

J. Jo, J. Baek, S. Lee, D. Kim, M. Kang, and S. J. Hwang, “Edge repre- sentation learning with hypergraphs,” Advances in Neural Information Processing Systems, vol. 34, pp. 7534–7546, 2021

2021
[94]

Knowledge-aware hypergraph neural network for recommender sys- tems,

B. Liu, P. Zhao, F. Zhuang, X. Xian, Y . Liu, and V . S. Sheng, “Knowledge-aware hypergraph neural network for recommender sys- tems,” in Database Systems for Advanced Applications: 26th Interna- tional Conference, DASFAA 2021, Taipei, Taiwan, April 11–14, 2021, Proceedings, P...

2021
[95]

Self-supervised hypergraph convolutional networks for session-based recommenda- tion,

X. Xia, H. Yin, J. Yu, Q. Wang, L. Cui, and X. Zhang, “Self-supervised hypergraph convolutional networks for session-based recommenda- tion,” in Proceedings of the AAAI conference on artificial intelligence , vol. 35, 2021, pp. 4503–4511

2021
[96]

Self- supervised multi-channel hypergraph convolutional network for social recommendation,

J. Yu, H. Yin, J. Li, Q. Wang, N. Q. V . Hung, and X. Zhang, “Self- supervised multi-channel hypergraph convolutional network for social recommendation,” in Proceedings of the web conference 2021 , 2021, pp. 413–424

2021
[97]

Heterogeneous graph attention network,

X. Wang, H. Ji, C. Shi, B. Wang, Y . Ye, P. Cui, and P. S. Yu, “Heterogeneous graph attention network,” in The world wide web conference, 2019, pp. 2022–2032

2019
[98]

Be more with less: Hypergraph attention networks for inductive text classification,

K. Ding, J. Wang, J. Li, D. Li, and H. Liu, “Be more with less: Hypergraph attention networks for inductive text classification,” arXiv preprint arXiv:2011.00387, 2020

2011 arXiv
[99]

Session-based recommen- dation with hypergraph attention networks,

J. Wang, K. Ding, Z. Zhu, and J. Caverlee, “Session-based recommen- dation with hypergraph attention networks,” in Proceedings of the 2021 SIAM international conference on data mining (SDM) . SIAM, 2021, pp. 82–90

2021
[100]

Hypergraph neural networks with attention mechanism for session-based recommendation,

M. Ding, X. Lin, B. Zeng, and Y . Chai, “Hypergraph neural networks with attention mechanism for session-based recommendation,” in Jour- nal of Physics: Conference Series , vol. 2082. IOP Publishing, 2021, p. 012007

2021
[101]

Hypergraph attention networks,

C. Chen, Z. Cheng, Z. Li, and M. Wang, “Hypergraph attention networks,” in 2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) . IEEE, 2020, pp. 1560–1565

2020
[102]

Dh-hgcn: dual homogeneity hy- pergraph convolutional network for multiple social recommendations,

J. Han, Q. Tao, Y . Tang, and Y . Xia, “Dh-hgcn: dual homogeneity hy- pergraph convolutional network for multiple social recommendations,” in Proceedings of the 45th international ACM SIGIR conference on research and development in information retrieval , 2022, pp. 2190– 2194

2022
[103]

Directed hypergraph attention network for traffic forecasting,

X. Luo, J. Peng, and J. Liang, “Directed hypergraph attention network for traffic forecasting,” IET Intelligent Transport Systems, vol. 16, no. 1, pp. 85–98, 2022

2022
[104]

Hypergraph convolution and hypergraph attention,

S. Bai, F. Zhang, and P. H. Torr, “Hypergraph convolution and hypergraph attention,” Pattern Recognition, vol. 110, p. 107637, 2021

2021
[105]

Self-supervised hypergraph trans- former for recommender systems,

L. Xia, C. Huang, and C. Zhang, “Self-supervised hypergraph trans- former for recommender systems,” in Proceedings of the 28th ACM SIGKDD conference on knowledge discovery and data mining , 2022, pp. 2100–2109

2022
[106]

Learning representation on opti- mized high-order manifold for visual classification,

X. Ma, W. Liu, Q. Tian, and Y . Gao, “Learning representation on opti- mized high-order manifold for visual classification,” IEEE Transactions on Multimedia, vol. 24, pp. 3989–4001, 2021

2021
[107]

Hyper- graph wavelet neural networks for 3d object classification,

L. Nong, J. Wang, J. Lin, H. Qiu, L. Zheng, and W. Zhang, “Hyper- graph wavelet neural networks for 3d object classification,” Neurocom- puting, vol. 463, pp. 580–595, 2021

2021
[108]

Structural deep embedding for hyper-networks,

K. Tu, P. Cui, X. Wang, F. Wang, and W. Zhu, “Structural deep embedding for hyper-networks,” in Proceedings of the AAAI conference on artificial intelligence , vol. 32, 2018

2018
[109]

Hetero- geneous hypergraph variational autoencoder for link prediction,

H. Fan, F. Zhang, Y . Wei, Z. Li, C. Zou, Y . Gao, and Q. Dai, “Hetero- geneous hypergraph variational autoencoder for link prediction,” IEEE transactions on pattern analysis and machine intelligence , vol. 44, no. 8, pp. 4125–4138, 2021

2021
[110]

Event2vec: heterogeneous hypergraph embedding for event data,

Y . Chu, C. Feng, C. Guo, Y . Wang, and J.-N. Hwang, “Event2vec: heterogeneous hypergraph embedding for event data,” in 2018 IEEE In- ternational Conference on Data Mining Workshops (ICDMW) . IEEE, 2018, pp. 1022–1029

2018
[113]

Learning entity and relation embeddings for knowledge graph completion,

Y . Lin, Z. Liu, M. Sun, Y . Liu, and X. Zhu, “Learning entity and relation embeddings for knowledge graph completion,” in Proceedings of the AAAI conference on artificial intelligence , vol. 29, 2015

2015
[114]

Knowledge graph embedding via dynamic mapping matrix,

G. Ji, S. He, L. Xu, K. Liu, and J. Zhao, “Knowledge graph embedding via dynamic mapping matrix,” in Proceedings of the 53rd annual meeting of the association for computational linguistics and the 7th international joint conference on natural language processing (volume 1: Lon...

2015
[115]

Transa: An adaptive approach for knowledge graph embedding,

H. Xiao, M. Huang, Y . Hao, and X. Zhu, “Transa: An adaptive approach for knowledge graph embedding,” arXiv preprint arXiv:1509.05490 , 2015

2015 arXiv
[116]

Knowledge graph completion with adaptive sparse transfer matrix,

G. Ji, K. Liu, S. He, and J. Zhao, “Knowledge graph completion with adaptive sparse transfer matrix,” in Proceedings of the AAAI conference on artificial intelligence , vol. 30, 2016

2016
[117]

Stranse: a novel embedding model of entities and relationships in knowledge bases,

D. Q. Nguyen, K. Sirts, L. Qu, and M. Johnson, “Stranse: a novel embedding model of entities and relationships in knowledge bases,” arXiv preprint arXiv:1606.08140 , 2016

2016 arXiv
[118]

Learning hierarchy-aware knowledge graph embeddings for link prediction,

Z. Zhang, J. Cai, Y . Zhang, and J. Wang, “Learning hierarchy-aware knowledge graph embeddings for link prediction,” in Proceedings of the AAAI conference on artificial intelligence , vol. 34, 2020, pp. 3065– 3072

2020
[119]

Knowledge graph representation via hierarchical hyper- bolic neural graph embedding,

S. Wang, X. Wei, C. N. Dos Santos, Z. Wang, R. Nallapati, A. Arnold, and P. S. Yu, “Knowledge graph representation via hierarchical hyper- bolic neural graph embedding,” in 2021 IEEE International Conference on Big Data (Big Data) . IEEE, 2021, pp. 540–549

2021
[120]

Stke: Temporal knowledge graph embedding in the spherical coordinate system,

S. Wang, R. Liu, L. Shen, and A. M. Khattak, “Stke: Temporal knowledge graph embedding in the spherical coordinate system,” in International Conference on Artificial Intelligence and Security . Springer, 2022, pp. 292–305

2022
[121]

Complex embeddings for simple link prediction,

T. Trouillon, J. Welbl, S. Riedel, ´E. Gaussier, and G. Bouchard, “Complex embeddings for simple link prediction,” in International conference on machine learning . PMLR, 2016, pp. 2071–2080

2016
[123]

Quaternion knowledge graph embeddings,

S. Zhang, Y . Tay, L. Yao, and Q. Liu, “Quaternion knowledge graph embeddings,” Advances in neural information processing systems , vol. 32, 2019

2019
[124]

Quatde: Dynamic quaternion embedding for knowledge graph com- pletion,

H. Gao, K. Yang, Y . Yang, R. Y . Zakari, J. W. Owusu, and K. Qin, “Quatde: Dynamic quaternion embedding for knowledge graph com- pletion,” arXiv preprint arXiv:2105.09002 , 2021

2021 arXiv
[125]

Bique: Biquaternionic embeddings of knowledge graphs,

J. Guo and S. Kok, “Bique: Biquaternionic embeddings of knowledge graphs,” arXiv preprint arXiv:2109.14401 , 2021. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 17

2021 arXiv
[126]

Dual quaternion knowledge graph embeddings,

Z. Cao, Q. Xu, Z. Yang, X. Cao, and Q. Huang, “Dual quaternion knowledge graph embeddings,” in Proceedings of the AAAI conference on artificial intelligence , vol. 35, 2021, pp. 6894–6902

2021
[127]

Dual quaternion embeddings for link prediction,

L. Gao, H. Zhu, H. H. Zhuo, and J. Xu, “Dual quaternion embeddings for link prediction,” Applied Sciences, vol. 11, no. 12, p. 5572, 2021

2021
[128]

Core: A knowledge graph entity type prediction method via complex space regression and embedding,

X. Ge, Y .-C. Wang, B. Wang, and C. J. Kuo, “Core: A knowledge graph entity type prediction method via complex space regression and embedding,” Pattern Recognition Letters, vol. 157, pp. 97–103, 2022

2022
[129]

Hierarchical- aware relation rotational knowledge graph embedding for link predic- tion,

S. Wang, K. Fu, X. Sun, Z. Zhang, S. Li, and L. Jin, “Hierarchical- aware relation rotational knowledge graph embedding for link predic- tion,” Neurocomputing, vol. 458, pp. 259–270, 2021

2021
[130]

Knowledge graph embedding by projection and rotation on hyperplanes for link prediction,

T. Le, N. Huynh, and B. Le, “Knowledge graph embedding by projection and rotation on hyperplanes for link prediction,” Applied Intelligence, vol. 53, no. 9, pp. 10 340–10 364, 2023

2023
[131]

From one point to a manifold: Orbit models for knowledge graph embedding,

H. Xiao, M. Huang, Y . Hao, and X. Zhu, “From one point to a manifold: Orbit models for knowledge graph embedding,” in Proceedings of IJCAI, 2016, pp. 1315–1321

2016
[132]

Differentiating concepts and instances for knowledge graph embedding,

X. Lv, L. Hou, J. Li, and Z. Liu, “Differentiating concepts and instances for knowledge graph embedding,” arXiv preprint arXiv:1811.04588 , 2018

2018 arXiv
[133]

Mixed-curvature multi- relational graph neural network for knowledge graph completion,

S. Wang, X. Wei, C. N. Nogueira dos Santos, Z. Wang, R. Nallapati, A. Arnold, B. Xiang, P. S. Yu, and I. F. Cruz, “Mixed-curvature multi- relational graph neural network for knowledge graph completion,” in Proceedings of the Web Conference 2021 . New York, NY , USA: Associatio...

2021
[134]

Hypersphere: An embedding method for knowledge graph completion based on hypersphere,

Y . Dong, X. Guo, J. Xiang, K. Liu, and Z. Tang, “Hypersphere: An embedding method for knowledge graph completion based on hypersphere,” in Knowledge Science, Engineering and Management: 14th International Conference, KSEM 2021, Tokyo, Japan, August 14–16, 2021, Proceedings, P...

2021
[135]

Link predic- tion with attention applied on multiple knowledge graph embedding models,

C. Gregucci, M. Nayyeri, D. Hern ´andez, and S. Staab, “Link predic- tion with attention applied on multiple knowledge graph embedding models,” in Proceedings of the ACM web conference 2023 , 2023, pp. 2600–2610

2023
[136]

Multi-relational poincar ´e graph embeddings,

I. Balazevic, C. Allen, and T. Hospedales, “Multi-relational poincar ´e graph embeddings,” Advances in neural information processing sys- tems, vol. 32, 2019

2019
[137]

Low- dimensional hyperbolic knowledge graph embeddings,

I. Chami, A. Wolf, D.-C. Juan, F. Sala, S. Ravi, and C. R ´e, “Low- dimensional hyperbolic knowledge graph embeddings,” arXiv preprint arXiv:2005.00545, 2020

2005 arXiv
[138]

Hyperbolic hierarchy-aware knowledge graph embedding for link prediction,

Z. Pan and P. Wang, “Hyperbolic hierarchy-aware knowledge graph embedding for link prediction,” in Findings of the Association for Computational Linguistics: EMNLP 2021 , 2021, pp. 2941–2948

2021
[139]

Knowl- edge association with hyperbolic knowledge graph embeddings,

Z. Sun, M. Chen, W. Hu, C. Wang, J. Dai, and W. Zhang, “Knowl- edge association with hyperbolic knowledge graph embeddings,” arXiv preprint arXiv:2010.02162, 2020

2010 arXiv
[140]

Ultrahyperbolic knowledge graph embeddings,

B. Xiong, S. Zhu, M. Nayyeri, C. Xu, S. Pan, C. Zhou, and S. Staab, “Ultrahyperbolic knowledge graph embeddings,” in Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2022, pp. 2130–2139

2022
[141]

Hyperbolic geometry is not necessary: Lightweight euclidean-based models for low-dimensional knowledge graph embeddings,

K. Wang, Y . Liu, D. Lin, and Q. Z. Sheng, “Hyperbolic geometry is not necessary: Lightweight euclidean-based models for low-dimensional knowledge graph embeddings,” arXiv preprint arXiv:2103.14930 , 2021

2021 arXiv
[142]

Hyperbolic hierarchical knowledge graph embeddings for link prediction in low dimensions,

W. Zheng, W. Wang, S. Zhao, and F. Qian, “Hyperbolic hierarchical knowledge graph embeddings for link prediction in low dimensions,” arXiv preprint arXiv:2204.13704 , 2022

2022 arXiv
[143]

Geometry interaction knowledge graph embeddings,

Z. Cao, Q. Xu, Z. Yang, X. Cao, and Q. Huang, “Geometry interaction knowledge graph embeddings,” in Proceedings of the AAAI conference on artificial intelligence , vol. 36, 2022, pp. 5521–5529

2022
[144]

Toruse: Knowledge graph embedding on a lie group,

T. Ebisu and R. Ichise, “Toruse: Knowledge graph embedding on a lie group,” in Proceedings of the AAAI conference on artificial intelligence, vol. 32, 2018

2018
[145]

Relation embedding with dihedral group in knowl- edge graph,

C. Xu and R. Li, “Relation embedding with dihedral group in knowl- edge graph,” arXiv preprint arXiv:1906.00687 , 2019

1906 arXiv
[146]

Nage: Non-abelian group embedding for knowledge graphs,

T. Yang, L. Sha, and P. Hong, “Nage: Non-abelian group embedding for knowledge graphs,” in Proceedings of the 29th ACM International Conference on Information & Knowledge Management , 2020, pp. 1735–1742

2020
[147]

Module: Module embedding for knowledge graphs,

J. Chai and G. Shi, “Module: Module embedding for knowledge graphs,” arXiv preprint arXiv:2203.04702 , 2022

2022 arXiv
[148]

Generalized translation-based embedding of knowledge graph,

T. Ebisu and R. Ichise, “Generalized translation-based embedding of knowledge graph,” IEEE Transactions on Knowledge and Data Engineering, vol. 32, pp. 941–951, 2019

2019
[149]

Dense: An enhanced non-abelian group represen- tation for knowledge graph embedding, corr abs/2008.04548 (2020),

H. Lu and H. Hu, “Dense: An enhanced non-abelian group represen- tation for knowledge graph embedding, corr abs/2008.04548 (2020),” arXiv preprint arXiv:2008.04548 , 2020

2020 arXiv
[150]

Simple embedding for link prediction in knowledge graphs,

S. M. Kazemi and D. Poole, “Simple embedding for link prediction in knowledge graphs,” Advances in neural information processing systems, vol. 31, 2018

2018
[151]

Embedding entities and relations for learning and inference in knowledge bases,

B. Yang, W.-t. Yih, X. He, J. Gao, and L. Deng, “Embedding entities and relations for learning and inference in knowledge bases,” arXiv preprint arXiv:1412.6575, 2014

2014 arXiv
[152]

A three-way model for collective learning on multi-relational data

M. Nickel, V . Tresp, H.-P. Kriegel et al. , “A three-way model for collective learning on multi-relational data.” in Icml, vol. 11, 2011, pp. 3 104 482–3 104 584

2011
[153]

Learning struc- tured embeddings of knowledge bases,

A. Bordes, J. Weston, R. Collobert, and Y . Bengio, “Learning struc- tured embeddings of knowledge bases,” in Proceedings of the AAAI conference on artificial intelligence , vol. 25, 2011, pp. 301–306

2011
[154]

Holographic embeddings of knowledge graphs (2016),

M. Nickel, L. Rosasco, and T. Poggio, “Holographic embeddings of knowledge graphs (2016),” URL: https://www. aaai. org/ocs/index. php/AAAI/AAAI16/paper/view/12484, 2015

2016
[155]

Analogical inference for multi- relational embeddings,

H. Liu, Y . Wu, and Y . Yang, “Analogical inference for multi- relational embeddings,” in International conference on machine learn- ing. PMLR, 2017, pp. 2168–2178

2017
[156]

Knowledge graph em- bedding with 3d compound geometric transformations,

X. Ge, Y .-C. Wang, B. Wang, and C.-C. J. Kuo, “Knowledge graph em- bedding with 3d compound geometric transformations,” arXiv preprint arXiv:2304.00378, 2023

2023 arXiv
[157]

Tucker: Ten- sor factorization for knowledge graph completion,

I. Bala ˇzevi´c, C. Allen, and T. M. Hospedales, “Tucker: Ten- sor factorization for knowledge graph completion,” arXiv preprint arXiv:1901.09590, 2019

1901 arXiv
[158]

Lowfer: Low- rank bilinear pooling for link prediction,

S. Amin, S. Varanasi, K. A. Dunfield, and G. Neumann, “Lowfer: Low- rank bilinear pooling for link prediction,” in International Conference on Machine Learning . PMLR, 2020, pp. 257–268

2020
[159]

A semantic matching energy function for learning with multi-relational data: Application to word-sense disambiguation,

A. Bordes, X. Glorot, J. Weston, and Y . Bengio, “A semantic matching energy function for learning with multi-relational data: Application to word-sense disambiguation,” Machine learning, vol. 94, pp. 233–259, 2014

2014
[160]

Reasoning with neural tensor networks for knowledge base completion,

R. Socher, D. Chen, C. D. Manning, and A. Ng, “Reasoning with neural tensor networks for knowledge base completion,” Advances in neural information processing systems , vol. 26, 2013

2013
[161]

Diagnose like a radiologist: Hybrid neuro-probabilistic reasoning for attribute-based medical image diagnosis,

G. Zhao, Q. Feng, C. Chen, Z. Zhou, and Y . Yu, “Diagnose like a radiologist: Hybrid neuro-probabilistic reasoning for attribute-based medical image diagnosis,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 44, no. 11, pp. 7400–7416, 2021

2021
[162]

Convolutional 2d knowledge graph embeddings,

T. Dettmers, P. Minervini, P. Stenetorp, and S. Riedel, “Convolutional 2d knowledge graph embeddings,” in Proceedings of the AAAI confer- ence on artificial intelligence , vol. 32, 2018

2018
[163]

A novel embedding model for knowledge base completion based on convolutional neural network,

D. Q. Nguyen, T. D. Nguyen, D. Q. Nguyen, and D. Phung, “A novel embedding model for knowledge base completion based on convolutional neural network,” arXiv preprint arXiv:1712.02121, 2017

2017 arXiv
[164]

Hypernetwork knowl- edge graph embeddings,

I. Bala ˇzevi´c, C. Allen, and T. M. Hospedales, “Hypernetwork knowl- edge graph embeddings,” in Artificial Neural Networks and Machine Learning–ICANN 2019: Workshop and Special Sessions: 28th Inter- national Conference on Artificial Neural Networks, Munich, Germany, September...

2019
[165]

Incorpo- rating vector space similarity in random walk inference over knowledge bases,

M. Gardner, P. Talukdar, J. Krishnamurthy, and T. Mitchell, “Incorpo- rating vector space similarity in random walk inference over knowledge bases,” in Proceedings of the 2014 conference on empirical methods in natural language processing (EMNLP) , 2014, pp. 397–406

2014
[166]

Compositional vec- tor space models for knowledge base completion,

A. Neelakantan, B. Roth, and A. McCallum, “Compositional vec- tor space models for knowledge base completion,” arXiv preprint arXiv:1504.06662, 2015

2015 arXiv
[167]

Learning to exploit long-term relational dependencies in knowledge graphs,

L. Guo, Z. Sun, and W. Hu, “Learning to exploit long-term relational dependencies in knowledge graphs,” in International conference on machine learning. PMLR, 2019, pp. 2505–2514

2019
[168]

Coke: Contextualized knowledge graph embedding,

Q. Wang, P. Huang, H. Wang, S. Dai, W. Jiang, J. Liu, Y . Lyu, Y . Zhu, and H. Wu, “Coke: Contextualized knowledge graph embedding,”arXiv preprint arXiv:1911.02168, 2019

1911 arXiv
[169]

Kg-bert: Bert for knowledge graph completion,

L. Yao, C. Mao, and Y . Luo, “Kg-bert: Bert for knowledge graph completion,” arXiv preprint arXiv:1909.03193 , 2019

1909 arXiv
[170]

Modeling relational data with graph convolutional networks,

M. Schlichtkrull, T. N. Kipf, P. Bloem, R. Van Den Berg, I. Titov, and M. Welling, “Modeling relational data with graph convolutional networks,” in The semantic web: 15th international conference, ESWC 2018, Heraklion, Crete, Greece, June 3–7, 2018, proceedings 15 . Springer, ...

2018
[171]

End- to-end structure-aware convolutional networks for knowledge base completion,

C. Shang, Y . Tang, J. Huang, J. Bi, X. He, and B. Zhou, “End- to-end structure-aware convolutional networks for knowledge base completion,” in Proceedings of the AAAI conference on artificial intelligence, vol. 33, 2019, pp. 3060–3067

2019
[172]

Composition- based multi-relational graph convolutional networks,

S. Vashishth, S. Sanyal, V . Nitin, and P. Talukdar, “Composition- based multi-relational graph convolutional networks,” arXiv preprint arXiv:1911.03082, 2019. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 18

1911 arXiv
[173]

Learning attention- based embeddings for relation prediction in knowledge graphs,

D. Nathani, J. Chauhan, C. Sharma, and M. Kaul, “Learning attention- based embeddings for relation prediction in knowledge graphs,” arXiv preprint arXiv:1906.01195, 2019

1906 arXiv
[174]

Kbgan: Adversarial learning for knowledge graph embeddings,

L. Cai and W. Y . Wang, “Kbgan: Adversarial learning for knowledge graph embeddings,” arXiv preprint arXiv:1711.04071 , 2017

2017 arXiv
[175]

Knowledge graph embed- ding: A survey of approaches and applications,

Q. Wang, Z. Mao, B. Wang, and L. Guo, “Knowledge graph embed- ding: A survey of approaches and applications,” IEEE transactions on knowledge and data engineering, vol. 29, no. 12, pp. 2724–2743, 2017

2017
[176]

Representation learning of knowledge graphs with entity descriptions,

R. Xie, Z. Liu, J. Jia, H. Luan, and M. Sun, “Representation learning of knowledge graphs with entity descriptions,” in Proceedings of the AAAI conference on artificial intelligence , vol. 30, 2016

2016
[177]

Ssp: semantic space projection for knowledge graph embedding with text descriptions,

H. Xiao, M. Huang, L. Meng, and X. Zhu, “Ssp: semantic space projection for knowledge graph embedding with text descriptions,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 31, 2017

2017
[178]

Accurate text-enhanced knowledge graph representation learning,

B. An, B. Chen, X. Han, and L. Sun, “Accurate text-enhanced knowledge graph representation learning,” in Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers), 2018...

2018
[179]

Semantically smooth knowledge graph embedding,

S. Guo, Q. Wang, B. Wang, L. Wang, and L. Guo, “Semantically smooth knowledge graph embedding,” in Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long ...

2015
[180]

Representation learning of knowledge graphs with hierarchical types

R. Xie, Z. Liu, M. Sun et al., “Representation learning of knowledge graphs with hierarchical types.” in IJCAI, vol. 2016, 2016, pp. 2965– 2971

2016
[181]

Knowledge representation learning with entities, attributes and relations,

Y . Lin, Z. Liu, and M. Sun, “Knowledge representation learning with entities, attributes and relations,” ethnicity, vol. 1, pp. 41–52, 2016

2016
[182]

Knowledge graph embedding with hierarchical relation structure,

Z. Zhang, F. Zhuang, M. Qu, F. Lin, and Q. He, “Knowledge graph embedding with hierarchical relation structure,” in Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, 2018, pp. 3198–3207

2018
[183]

Image-embodied knowledge representation learning,

R. Xie, Z. Liu, H. Luan, and M. Sun, “Image-embodied knowledge representation learning,” arXiv preprint arXiv:1609.07028 , 2016

2016 arXiv
[184]

A unified mrc frame- work for named entity recognition,

X. Li, J. Feng, Y . Meng, Q. Han, F. Wu, and J. Li, “A unified mrc frame- work for named entity recognition,” arXiv preprint arXiv:1910.11476 , 2019

1910 arXiv
[185]

Temporal knowledge graph completion using box embeddings,

J. Messner, R. Abboud, and I. I. Ceylan, “Temporal knowledge graph completion using box embeddings,” in Proceedings of the AAAI Con- ference on Artificial Intelligence , vol. 36, 2022, pp. 7779–7787

2022
[186]

Probase: A probabilistic taxonomy for text understanding,

W. Wu, H. Li, H. Wang, and K. Q. Zhu, “Probase: A probabilistic taxonomy for text understanding,” in Proceedings of the 2012 ACM SIGMOD international conference on management of data , 2012, pp. 481–492

2012
[187]

Toward an architecture for never-ending language learn- ing,

A. Carlson, J. Betteridge, B. Kisiel, B. Settles, E. Hruschka, and T. Mitchell, “Toward an architecture for never-ending language learn- ing,” in Proceedings of the AAAI conference on artificial intelligence , vol. 24, 2010, pp. 1306–1313

2010
[188]

Conceptnet 5.5: An open multilingual graph of general knowledge,

R. Speer, J. Chin, and C. Havasi, “Conceptnet 5.5: An open multilingual graph of general knowledge,” in Proceedings of the AAAI conference on artificial intelligence , vol. 31, 2017

2017
[189]

Embedding uncertain knowledge graphs,

X. Chen, M. Chen, W. Shi, Y . Sun, and C. Zaniolo, “Embedding uncertain knowledge graphs,” in Proceedings of the AAAI conference on artificial intelligence , vol. 33, 2019, pp. 3363–3370

2019
[190]

Scalable instance reconstruction in knowledge bases via relatedness affiliated embedding,

R. Zhang, J. Li, J. Mei, and Y . Mao, “Scalable instance reconstruction in knowledge bases via relatedness affiliated embedding,” in Proceed- ings of the 2018 world wide web conference , 2018, pp. 1185–1194

2018
[191]

Boxe: A box embedding model for knowledge base completion,

R. Abboud, I. Ceylan, T. Lukasiewicz, and T. Salvatori, “Boxe: A box embedding model for knowledge base completion,” Advances in Neural Information Processing Systems , vol. 33, pp. 9649–9661, 2020

2020
[192]

Role-aware modeling for n-ary relational knowledge bases,

Y . Liu, Q. Yao, and Y . Li, “Role-aware modeling for n-ary relational knowledge bases,” in Proceedings of the Web Conference 2021 , 2021, pp. 2660–2671

2021
[193]

Knowledge hypergraph embedding meets relational algebra,

B. Fatemi, P. Taslakian, D. Vazquez, and D. Poole, “Knowledge hypergraph embedding meets relational algebra,” Journal of Machine Learning Research, vol. 24, no. 105, pp. 1–34, 2023

2023
[194]

Searching to sparsify tensor decomposi- tion for n-ary relational data,

S. Di, Q. Yao, and L. Chen, “Searching to sparsify tensor decomposi- tion for n-ary relational data,” in Proceedings of the Web Conference 2021, 2021, pp. 4043–4054

2021
[195]

Link prediction on n- ary relational data based on relatedness evaluation,

S. Guan, X. Jin, J. Guo, Y . Wang, and X. Cheng, “Link prediction on n- ary relational data based on relatedness evaluation,” IEEE Transactions on Knowledge and Data Engineering , vol. 35, no. 1, pp. 672–685, 2021

2021
[196]

Hyconve: A novel embedding model for knowledge hypergraph link prediction with convolutional neural networks,

C. Wang, X. Wang, Z. Li, Z. Chen, and J. Li, “Hyconve: A novel embedding model for knowledge hypergraph link prediction with convolutional neural networks,” in Proceedings of the ACM Web Conference 2023, 2023, pp. 188–198

2023
[197]

Hypergraph embedding- based representation method for multi-nary relational knowledge of bridge crane faults,

F. ZHANG, B. ZHOU, J. BAO, and X. LI, “Hypergraph embedding- based representation method for multi-nary relational knowledge of bridge crane faults,” Computer Integrated Manufacturing System , vol. 30, no. 2, p. 445, 2024

2024
[198]

Rhkh: Relational hypergraph neural network for link prediction on n-ary knowledge hypergraph,

Y . Wang, J. He, and H. Wang, “Rhkh: Relational hypergraph neural network for link prediction on n-ary knowledge hypergraph,” in Pro- ceedings of the 32nd ACM International Conference on Multimedia , 2024, pp. 8759–8767

2024
[199]

Link pre- diction in knowledge hypergraph combining attention and convolution network,

J. Pang, H. Xu, H. Qin, X. Lin, X. Liu, and G. Wang, “Link pre- diction in knowledge hypergraph combining attention and convolution network,” Journal of Frontiers of Computer Science and Technology , vol. 17, no. 11, pp. 2734–2742, 2023

2023
[200]

Khg-aclair: Knowledge hypergraph- based attention with contrastive learning for recommendations,

H. Park, T. Lee, and K. Kim, “Khg-aclair: Knowledge hypergraph- based attention with contrastive learning for recommendations,” Jour- nal of Computing Science and Engineering, vol. 18, no. 3, pp. 169–180, 2024

2024
[201]

Beyond triplets: hyper- relational knowledge graph embedding for link prediction,

P. Rosso, D. Yang, and P. Cudr ´e-Mauroux, “Beyond triplets: hyper- relational knowledge graph embedding for link prediction,” in Pro- ceedings of the web conference 2020 , 2020, pp. 1885–1896

2020
[202]

Hycube: Efficient knowledge hypergraph 3d circular convolutional embedding,

Z. Li, X. Wang, J. Zhao, W. Guo, and J. Li, “Hycube: Efficient knowledge hypergraph 3d circular convolutional embedding,” IEEE Transactions on Knowledge and Data Engineering , 2025

2025
[203]

Hyperquery: Beyond binary link prediction,

S. Maleki, J. Vekhter, and K. Pingali, “Hyperquery: Beyond binary link prediction,” arXiv preprint arXiv:2501.07731 , 2025

2025 arXiv
[204]

Hysae: An effi- cient semantic-enhanced representation learning model for knowledge hypergraph link prediction,

Z. Li, X. Wang, Z. Jun, F. Feng, Z. Chen, and J. Li, “Hysae: An effi- cient semantic-enhanced representation learning model for knowledge hypergraph link prediction,” in THE WEB CONFERENCE 2025, 2025

2025
[205]

Query embedding on hyper-relational knowledge graphs,

D. Alivanistos, M. Berrendorf, M. Cochez, and M. Galkin, “Query embedding on hyper-relational knowledge graphs,” arXiv preprint arXiv:2106.08166, 2021

2021 arXiv
[206]

Representation learning on hyper-relational and numeric knowledge graphs with transformers,

C. Chung, J. Lee, and J. J. Whang, “Representation learning on hyper-relational and numeric knowledge graphs with transformers,” in Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining , 2023, pp. 310–322

2023
[207]

Improving hyper-relational knowledge graph completion,

D. Yu and Y . Yang, “Improving hyper-relational knowledge graph completion,” arXiv preprint arXiv:2104.08167 , 2021

2021 arXiv
[208]

Shrinking embeddings for hyper-relational knowledge graphs,

B. Xiong, M. Nayyer, S. Pan, and S. Staab, “Shrinking embeddings for hyper-relational knowledge graphs,” arXiv preprint arXiv:2306.02199 , 2023

2023 arXiv
[209]

Hyper- mono: A monotonicity-aware approach to hyper-relational knowledge representation,

Z. Hu, V . Guti ´errez-Basulto, Z. Xiang, R. Li, and J. Z. Pan, “Hyper- mono: A monotonicity-aware approach to hyper-relational knowledge representation,” arXiv preprint arXiv:2404.09848 , 2024

2024 arXiv
[210]

Self-supervised dynamic hypergraph recommendation based on hyper-relational knowl- edge graph,

Y . Liu, H. Xuan, B. Li, M. Wang, T. Chen, and H. Yin, “Self-supervised dynamic hypergraph recommendation based on hyper-relational knowl- edge graph,” in Proceedings of the 32nd ACM International Conference on Information and Knowledge Management , 2023, pp. 1617–1626

2023
[211]

Hahe: hierarchical attention for hyper- relational knowledge graphs in global and local level,

H. Luo, Y . Yang, Y . Guo, M. Sun, T. Yao, Z. Tang, K. Wan, M. Song, W. Lin et al. , “Hahe: hierarchical attention for hyper- relational knowledge graphs in global and local level,” arXiv preprint arXiv:2305.06588, 2023

2023 arXiv
[212]

Hyper- former: Enhancing entity and relation interaction for hyper-relational knowledge graph completion,

Z. Hu, V . Guti ´errez-Basulto, Z. Xiang, R. Li, and J. Z. Pan, “Hyper- former: Enhancing entity and relation interaction for hyper-relational knowledge graph completion,” in Proceedings of the 32nd ACM inter- national conference on information and knowledge management, 2023, ...

2023
[213]

Explainable link prediction in knowledge hypergraphs,

Z. Chen, X. Wang, C. Wang, and J. Li, “Explainable link prediction in knowledge hypergraphs,” in Proceedings of the 31st ACM international conference on information & knowledge management , 2022, pp. 262– 271

2022
[214]

Generalizing hyper- edge expansion for hyper-relational knowledge graph modeling,

Y . Liu, S. Yang, J. Ding, Q. Yao, and Y . Li, “Generalizing hyper- edge expansion for hyper-relational knowledge graph modeling,” arXiv preprint arXiv:2411.06191, 2024

2024 arXiv
[215]

The expression of a tensor or a polyadic as a sum of products,

F. L. Hitchcock, “The expression of a tensor or a polyadic as a sum of products,” Journal of Mathematics and Physics , vol. 6, no. 1-4, pp. 164–189, 1927

1927
[216]

Relational inductive biases, deep learning, and graph networks,

P. W. Battaglia, J. B. Hamrick, V . Bapst, A. Sanchez-Gonzalez, V . Zambaldi, M. Malinowski, A. Tacchetti, D. Raposo, A. Santoro, R. Faulkner et al. , “Relational inductive biases, deep learning, and graph networks,” arXiv preprint arXiv:1806.01261 , 2018

2018 arXiv
[217]

Markov logic networks,

M. Richardson and P. Domingos, “Markov logic networks,” Machine learning, vol. 62, pp. 107–136, 2006

2006
[218]

Knowledge graph contrastive learning for recommendation,

Y . Yang, C. Huang, L. Xia, and C. Li, “Knowledge graph contrastive learning for recommendation,” in Proceedings of the 45th international IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 19 ACM SIGIR conference on research and development in information retrieval, 2022, pp...

2022
[219]

Dimen- sionality reduction for k-means clustering and low rank approxima- tion,

M. B. Cohen, S. Elder, C. Musco, C. Musco, and M. Persu, “Dimen- sionality reduction for k-means clustering and low rank approxima- tion,” in Proceedings of the forty-seventh annual ACM symposium on Theory of computing , 2015, pp. 163–172

2015
[220]

A review of relational machine learning for knowledge graphs,

M. Nickel, K. Murphy, V . Tresp, and E. Gabrilovich, “A review of relational machine learning for knowledge graphs,” Proceedings of the IEEE, vol. 104, no. 1, pp. 11–33, 2015

2015
[221]

Yago: a core of semantic knowledge,

F. M. Suchanek, G. Kasneci, and G. Weikum, “Yago: a core of semantic knowledge,” in Proceedings of the 16th international conference on World Wide Web, 2007, pp. 697–706

2007
[222]

Translating embeddings for modeling multi-relational data,

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 , vol. 26, 2013

2013
[223]

Knowledge graph embedding by translating on hyperplanes,

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 , vol. 28, 2014

2014
[224]

Nscaching: simple and efficient negative sampling for knowledge graph embedding,

Y . Zhang, Q. Yao, Y . Shao, and L. Chen, “Nscaching: simple and efficient negative sampling for knowledge graph embedding,” in 2019 IEEE 35th International Conference on Data Engineering (ICDE) . IEEE, 2019, pp. 614–625

2019
[225]

Structure aware negative sampling in knowledge graphs,

K. Ahrabian, A. Feizi, Y . Salehi, W. L. Hamilton, and A. J. Bose, “Structure aware negative sampling in knowledge graphs,” arXiv preprint arXiv:2009.11355, 2020

2009 arXiv
[226]

Rotate: Knowledge graph embedding by relational rotation in complex space,

Z. Sun, Z.-H. Deng, J.-Y . Nie, and J. Tang, “Rotate: Knowledge graph embedding by relational rotation in complex space,” arXiv preprint arXiv:1902.10197, 2019

1902 arXiv
[227]

A knowledge selective adversarial network for link prediction in knowledge graph,

K. Hu, H. Liu, and T. Hao, “A knowledge selective adversarial network for link prediction in knowledge graph,” in Natural Language Pro- cessing and Chinese Computing: 8th CCF International Conference, NLPCC 2019, Dunhuang, China, October 9–14, 2019, Proceedings, Part I 8. Spri...

2019
[228]

Incorporating gan for negative sampling in knowledge representation learning,

P. Wang, S. Li, and R. Pan, “Incorporating gan for negative sampling in knowledge representation learning,” in Proceedings of the AAAI conference on artificial intelligence , vol. 32, 2018

2018
[229]

A gener- ative adversarial negative sampling method for knowledge hypergraph link prediction,

Z. Guo, J. Zuo, L. Duan, R. Li, C. He, Y . Xiao, and P. Wang, “A gener- ative adversarial negative sampling method for knowledge hypergraph link prediction,” Journal of Computer Research and Development , vol. 59, no. 8, pp. 1742–1756, 2022

2022
[2024]

Available: https://doi.org/10.3233/SW-222991

[Online]. Available: https://doi.org/10.3233/SW-222991

doi

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.

[1] [1]

A survey on knowledge graphs: Representation, acquisition, and applications,

S. Ji, S. Pan, E. Cambria, P. Marttinen, and S. Y . Philip, “A survey on knowledge graphs: Representation, acquisition, and applications,” IEEE transactions on neural networks and learning systems , vol. 33, no. 2, pp. 494–514, 2021

2021

[2] [2]

Development of knowledge graph for university courses management,

I. Aliyu, A. Kana, S. Aliyu et al. , “Development of knowledge graph for university courses management,” International Journal of Education and Management Engineering , vol. 10, no. 2, p. 1, 2020

2020

[3] [3]

Knowledge graph in smart education: A case study of entrepreneurship scientific publication management,

Y . Chi, Y . Qin, R. Song, and H. Xu, “Knowledge graph in smart education: A case study of entrepreneurship scientific publication management,” Sustainability, vol. 10, no. 4, p. 995, 2018

2018

[4] [4]

Analyzing social media for measuring public attitudes toward controversies and their driving factors: a case study of migration,

Y . Chen, H. Sack, and M. Alam, “Analyzing social media for measuring public attitudes toward controversies and their driving factors: a case study of migration,” Soc. Netw. Anal. Min., vol. 12, no. 1, p. 135, 2022

2022

[5] [5]

Smr: medical knowledge graph embedding for safe medicine recommendation,

F. Gong, M. Wang, H. Wang, S. Wang, and M. Liu, “Smr: medical knowledge graph embedding for safe medicine recommendation,” Big Data Research, vol. 23, p. 100174, 2021

2021

[6] [6]

Financial time series forecast- ing with multi-modality graph neural network,

D. Cheng, F. Yang, S. Xiang, and J. Liu, “Financial time series forecast- ing with multi-modality graph neural network,” Pattern Recognition, vol. 121, p. 108218, 2022

2022

[7] [7]

Knowledge graphs: Opportunities and challenges,

C. Peng, F. Xia, M. Naseriparsa, and F. Osborne, “Knowledge graphs: Opportunities and challenges,” Artificial Intelligence Review , vol. 56, no. 11, pp. 13 071–13 102, 2023

2023

[8] [8]

Neurosymbolic Methods for Dynamic Knowledge Graphs

M. Alam, G. A. Gesese, and P.-H. Paris, “Neurosymbolic methods for dynamic knowledge graphs,” arXiv preprint arXiv:2409.04572 , 2024

work page Pith review arXiv 2024