Multi-way set enumeration in weight tensors

DOI10.1007/s10994-010-5210-yzbMath1237.68144OpenAlexW2136704573MaRDI QIDQ413829

Elisabeth Georgii, Koji Tsuda, Bernhard Schölkopf

Publication date: 8 May 2012

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

Full work available at URL: https://doi.org/10.1007/s10994-010-5210-y

zbMATH Keywords

tensorgraph mining\(N\)-ary relationdense pattern enumerationmulti-way setquasi-hyper-clique

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Closed and noise-tolerant patterns in \(n\)-ary relations ⋮ A survey on enhanced subspace clustering ⋮ Triadic formal concept analysis and triclustering: searching for optimal patterns

Uses Software

• gSpan
• GeneSigDB
• EXPANDER
• MCODE

Cites Work

• Unnamed Item
• Tensor Decompositions and Applications
• Graph clustering
• A new conceptual clustering framework
• Reverse search for enumeration
• Approximation Algorithms for Tensor Clustering
• Efficient algorithms for listing unlabeled graphs
• Greedily Finding a Dense Subgraph
• An Efficient Algorithm for Enumerating Pseudo Cliques
• Machine Learning: ECML 2004
• Data mining. Concepts and techniques

This page was built for publication: Multi-way set enumeration in weight tensors