An expressive dissimilarity measure for relational clustering using neighbourhood trees

DOI10.1007/s10994-017-5644-6zbMath1460.62096arXiv1604.08934OpenAlexW3125748495MaRDI QIDQ1698849

Hendrik Blockeel, Sebastijan Dumančić

Publication date: 16 February 2018

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.08934

zbMATH Keywords

clusteringrelational learningsimilarity of structured objects

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Uses Software

• Scikit
• DIMACS
• kLog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• kLog: a language for logical and relational learning with kernels
• A survey on tree edit distance and related problems
• Distribution-based aggregation for relational learning with identifier attributes
• Mining Graph Data
• Logical and Relational Learning
• Inductive Logic Programming: Theory and methods
• Graph Partitioning and Graph Clustering
• ILP :- Just Trie It

This page was built for publication: An expressive dissimilarity measure for relational clustering using neighbourhood trees