Relational Constraints for Metric Learning on Relational Data - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Relational Constraints for Metric Learning on Relational Data

Abstract

Most of metric learning approaches are dedicated to be applied on data described by feature vectors, with some notable exceptions such as times series, trees or graphs. The objective of this paper is to propose a metric learning algorithm that specifically considers relational data. The proposed approach can take benefit from both the topological structure of the data and supervised labels. For selecting relative constraints representing the relational information, we introduce a link-strength function that measures the strength of relationship links between entities by the side-information of their common parents. We show the performance of the proposed method with two different classical metric learning algorithms, which are ITML (Information Theoretic Metric Learning) and LSML (Least Squares Metric Learning), and test on several real-world datasets. Experimental results show that using relational information improves the quality of the learned metric.
Fichier principal
Vignette du fichier
starai.pdf (398.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02017253 , version 1 (13-02-2019)

Identifiers

  • HAL Id : hal-02017253 , version 1

Cite

Jiajun Pan, Hoel Le Capitaine, Philippe Leray. Relational Constraints for Metric Learning on Relational Data. Eighth International Workshop on Statistical Relational AI, IJCAI, Jul 2018, Stockholm, Sweden. ⟨hal-02017253⟩
40 View
25 Download

Share

Gmail Facebook X LinkedIn More