Clustering Boolean tensors

DOI10.1007/s10618-015-0420-3zbMath1405.68298arXiv1501.00696OpenAlexW2150957489MaRDI QIDQ1715898

Pauli Miettinen, Saskia Metzler

Publication date: 29 January 2019

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

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

zbMATH Keywords

decompositionclusteringapproximationBoolean algebratensors

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

Generalized inverses of Boolean tensors via the Einstein product

Uses Software

• YAGO
• MDL4BMF

Cites Work

• Tensor Decompositions and Applications
• Upper bound for the approximation ratio of a class of hypercube segmentation algorithms
• Modeling by shortest data description
• INDCLAS: a three-way hierarchical classes model
• Optimal factorization of three-way binary data using triadic concepts
• Closed and noise-tolerant patterns in \(n\)-ary relations
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Approximation Algorithms for Tensor Clustering
• On Tensors, Sparsity, and Nonnegative Factorizations
• On Two Segmentation Problems
• Segmentation problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Clustering Boolean tensors