Interesting pattern mining in multi-relational data
type: Item
instance of: scholarly article
title: Interesting pattern mining in multi-relational data
zbMATH Open document ID: 1294.68073
author: Eirini Spyropoulou
author: Tijl De Bie
author: Mario Boley
published in: Data Mining and Knowledge Discovery
publication date: 2014-09-03T00:00:00Z
Mathematics Subject Classification ID: 68P20
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 6339410
zbMATH Keywords: multi-relational data mining
zbMATH Keywords: pattern mining
zbMATH Keywords: interestingness measures
zbMATH Keywords: maximum entropy modelling
zbMATH Keywords: K-partite graphs
describes a project that uses: CloseGraph
describes a project that uses: gSpan
describes a project that uses: Algorithm 457
describes a project that uses: LCM
MaRDI profile type: Publication
full work available at URL: s10618-013-0319-9
OpenAlex ID: W1974067702
cites work: Q5532570
cites work: Listing closed sets of strongly accessible set systems with applications to data mining
cites work: Algorithm 457: finding all cliques of an undirected graph
cites work: Maximum entropy models and subjective interestingness: an application to tiles in binary databases
cites work: Q4692527
cites work: Discovery Science
cites work: Computing Supports of Conjunctive Queries on Relational Tables with Functional Dependencies
cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
cites work: Algorithm Theory - SWAT 2004
cites work: The maximum clique problem
cites work: Krimp: mining itemsets that compress
cites work: Polyadic concept analysis
DOI: 10.1007/S10618-013-0319-9
Recommended article: Q4438283
Recommended article: Multi-relational pattern mining over data streams
Recommended article: Q4736448
description: scientific article; zbMATH DE number 6339410