Transforming graph data for statistical relational learning

DOI10.1613/JAIR.3659MaRDI QIDQ3143577zbMATH OpenOpenAlexFDO

Authors Ryan Anthony Rossi, Luke K. Mcdowell, David W. Aha, Jennifer Neville

Publication date 3 December 2012

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

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

zbMATH Keywords

statistical relational learningrelational datagraph datalink transformationnode transformation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Data structures (68P05)

Abstract: Relational data representations have become an increasingly important topic due to the recent proliferation of network datasets (e.g., social, biological, information networks) and a corresponding increase in the application of statistical relational learning (SRL) algorithms to these domains. In this article, we examine a range of representation issues for graph-based relational data. Since the choice of relational data representation for the nodes, links, and features can dramatically affect the capabilities of SRL algorithms, we survey approaches and opportunities for relational representation transformation designed to improve the performance of these algorithms. This leads us to introduce an intuitive taxonomy for data representation transformations in relational domains that incorporates link transformation and node transformation as symmetric representation tasks. In particular, the transformation tasks for both nodes and links include (i) predicting their existence, (ii) predicting their label or type, (iii) estimating their weight or importance, and (iv) systematically constructing their relevant features. We motivate our taxonomy through detailed examples and use it to survey and compare competing approaches for each of these tasks. We also discuss general conditions for transforming links, nodes, and features. Finally, we highlight challenges that remain to be addressed.

Recommendations

• What kinds of relational features are useful for statistical learning?
• Single network relational transductive learning
• 10.1162/jmlr.2003.3.4-5.679
• scientific article; zbMATH DE number 5296741
• Relational dependency networks

Cited in

(6)

• Latent association graph inference for binary transaction data
• Relaxing the strong triadic closure problem for edge strength inference
• Structure-oriented prediction in complex networks
• kLog: a language for logical and relational learning with kernels
• Single network relational transductive learning
• Nearly exact mining of frequent trees in large networks

Describes a project that uses

Uses Software

• CrossMine

This page was built for publication: Transforming graph data for statistical relational learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3143577)