Clustering Relational Data Based on Randomized Propositionalization

DOI10.1007/978-3-540-78469-2_8MaRDI QIDQ5452078zbMATH OpenOpenAlexFDO

Authors Grant Anderson, Bernhard Pfahringer

Publication date 28 March 2008

Published in Inductive Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78469-2_8

zbMATH Keywords

clusteringpropositionalizationrandomization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 1950767
• Relational and semantic data mining (invited talk)
• Propositionalization-based relational subgroup discovery with RSD
• scientific article; zbMATH DE number 6026985
• Evolutionary clustering of relational data

Cites work

• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• Kernels and distances for structured data
• Propositionalization-based relational subgroup discovery with RSD
• Relational instance-based learning with lists and terms
• Silhouettes: a graphical aid to the interpretation and validation of cluster analysis

Cited in

(7)

• Crossclus: user-guided multi-relational clustering
• Propositionalization-based relational subgroup discovery with RSD
• A randomized exhaustive propositionalization approach for molecule classification
• Four-layer distance metric and distance-based kernel functions for inductive logic programming
• Relational and semantic data mining (invited talk)
• Speeding Up Inference in Statistical Relational Learning by Clustering Similar Query Literals
• scientific article; zbMATH DE number 1950767 (Why is no real title available?)

This page was built for publication: Clustering Relational Data Based on Randomized Propositionalization

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