Towards a Flexible Embedding Learning Framework
Chin-Chia Michael Yeh, Dhruv Gelda, Zhongfang Zhuang, Yan Zheng, Liang, Gou, Wei Zhang

TL;DR
This paper introduces a flexible, domain-knowledge-incorporating embedding learning framework that is data-type agnostic and outperforms existing methods in multiple data mining tasks.
Contribution
It proposes a novel, adaptable embedding framework using entity-relation-matrices and a sampling mechanism, enhancing applicability and effectiveness over prior fixed-assumption methods.
Findings
Outperforms state-of-the-art approaches in data mining tasks.
Flexible framework effectively incorporates domain knowledge.
Demonstrates robustness across various data types.
Abstract
Representation learning is a fundamental building block for analyzing entities in a database. While the existing embedding learning methods are effective in various data mining problems, their applicability is often limited because these methods have pre-determined assumptions on the type of semantics captured by the learned embeddings, and the assumptions may not well align with specific downstream tasks. In this work, we propose an embedding learning framework that 1) uses an input format that is agnostic to input data type, 2) is flexible in terms of the relationships that can be embedded into the learned representations, and 3) provides an intuitive pathway to incorporate domain knowledge into the embedding learning process. Our proposed framework utilizes a set of entity-relation-matrices as the input, which quantifies the affinities among different entities in the database.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Data Mining Algorithms and Applications · Imbalanced Data Classification Techniques
