paper-with-me

홈 › Papers

Propositionalization and Embeddings: Two Sides of the Same Coin

2020-06-08 · Nada Lavrač, Blaž Škrlj, Marko Robnik-Šikonja

Data preprocessing is an important component of machine learning pipelines, which requires ample time and resources. An integral part of preprocessing is data transformation into the format required by a given learning algorithm. This paper outlines some of the modern data processing techniques used in relational learning that enable data fusion from different input data types and formats into a single table data representation, focusing on the propositionalization and embedding data transformation approaches. While both approaches aim at transforming data into tabular data format, they use different terminology and task definitions, are perceived to address different goals, and are used in different contexts. This paper contributes a unifying framework that allows for improved understanding of these two data transformation techniques by presenting their unified definitions, and by explaining the similarities and differences between the two approaches as variants of a unified complex data transformation task. In addition to the unifying framework, the novelty of this paper is a unifying methodology combining propositionalization and embeddings, which benefits from the advantages of both in solving complex data transformation and learning tasks. We present two efficient implementations of the unifying methodology: an instance-based PropDRM approach, and a feature-based PropStar approach to data transformation and learning, together with their empirical evaluation on several relational problems. The results show that the new algorithms can outperform existing relational learners and can solve much larger problems.

📄 PDF Abstract BibTeX arXiv:2006.04410

Code (2)

SkBlaz/PropStar 공식 구현 pytorch
EMBEDDIA/PropStar pytorch

Tasks

Relational ReasoningVocal Bursts Valence Prediction

Similar Papers 제목 키워드 기반

LazyBum: Decision tree learning using lazy propositionalization

2019-09-11 · Jonas Schouterden, Jesse Davis, Hendrik Blockeel

Propositionalization is the process of summarizing relational data into a tabular (attribute-value) format. The resulting table can next be used by any propositional learner. This approach makes it possible to apply a wi…

Attribute

Neural RELAGGS

2022-11-04 · Lukas Pensel, Stefan Kramer

Multi-relational databases are the basis of most consolidated data collections in science and industry today. Most learning and mining algorithms, however, require data to be represented in a propositional form. While th…

Lifted Rule Injection for Relation Embeddings

2016-06-27 · EMNLP 2016 11 · Thomas Demeester, Tim Rocktäschel, Sebastian Riedel

Methods based on representation learning currently hold the state-of-the-art in many natural language processing and knowledge base inference tasks. Yet, a major challenge is how to efficiently incorporate commonsense kn…

Knowledge Base ConstructionRelationRepresentation Learning

Ensemble Relational Learning based on Selective Propositionalization

2013-11-15 · Nicola Di Mauro, Floriana Esposito

Dealing with structured data needs the use of expressive representation formalisms that, however, puts the problem to deal with the computational complexity of the machine learning process. Furthermore, real world domain…

Relational Reasoning

COIN: Co-Cluster Infomax for Bipartite Graphs

2022-05-31 · Baoyu Jing, Yuchen Yan, Yada Zhu, Hanghang Tong

Bipartite graphs are powerful data structures to model interactions between two types of nodes, which have been used in a variety of applications, such as recommender systems, information retrieval, and drug discovery. A…

Drug DiscoveryInformation RetrievalRecommendation SystemsRetrieval+1