Multi-way set enumeration in weight tensors
From MaRDI portal
Publication:413829
DOI10.1007/s10994-010-5210-yzbMath1237.68144MaRDI 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
tensor; graph mining; \(N\)-ary relation; dense pattern enumeration; multi-way set; quasi-hyper-clique
68T05: Learning and adaptive systems in artificial intelligence
68R10: Graph theory (including graph drawing) in computer science
Related Items
A survey on enhanced subspace clustering, Triadic formal concept analysis and triclustering: searching for optimal patterns, Closed and noise-tolerant patterns in \(n\)-ary relations
Uses Software
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