Binary Vector based Propositionalization Strategy for Multivalued Relations in Linked Data

نویسندگان

  • Florian Jakobs
  • Yordan Terziev
  • Volker Gruhn
چکیده

Machine learning on linked data is strongly dependent on the selection of high quality data features to achieve good results and build reusable and generalizable models. In this work, we explore the problem of representing multivalued relations in a suitable form for machine learning while keeping the human comprehensibility of the resulting model. Specifically, we propose the use of a binary vector representation and compare it to two state of the art approaches. Our evaluation shows that the binary vector representation achieves mostly higher accuracy in comparison to standard propositionalization techniques. It also achieves comparable accuracy to a recently presented graph embeddings approach, while retaining the human comprehensibility.

منابع مشابه

A Comparison of Propositionalization Strategies for Creating Features from Linked Open Data

Linked Open Data has been recognized as a valuable source for background information in data mining. However, most data mining tools require features in propositional form, i.e., binary, nominal or numerical features associated with an instance, while Linked Open Data sources are usually graphs by nature. In this paper, we compare different strategies for creating propositional features from Li...

متن کامل

Statistical relational learning : Structure learning for Markov logic networks. (Apprentissage statistique relationnel : apprentissage de structures de réseaux de Markov logiques)

A Markov Logic Network is composed of a set of weighted first-order logic formulas. In this dis-sertation we propose several methods to learn a MLN structure from a relational dataset. Thesemethods are of two kinds: methods based on propositionalization and methods based on Graphof Predicates. The methods based on propositionalization are based on the idea of building aset o...

متن کامل

Discovery of multivalued dependencies from relations

Discovery of multivalued dependencies from database relations is viewed as a search in a hypothesis space de ned according to the generalisation relationship among multivalued dependencies Two algorithms for the dis covery of multivalued dependencies from relations are presented The top down algorithm enumerates the hypotheses from the most general to more speci c hypotheses which are checked o...

متن کامل

Propositionalization Through Relational Association Rules Mining

In this paper we propose a novel (multi-)relational classification framework based on propositionalization. Propositionalization makes use of discovered relational association rules and permits to significantly reduce feature space through a feature reduction algorithm. The method is implemented in a Data Mining system tightly integrated with a relational database. It performs the classificatio...

متن کامل

Some generalized vector variational inequalities and complementarity problems for multivalued mappings

In this paper, we introduce and study a new class of generalized vector variational inequalities and complementarity problems for multivalued mappings. We prove the existence of solutions for this kind of vector variational inequality and discuss the relations between the solutions of the generalized vector variational inequalities and the solutions of generalized vector complementarity problem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017