Clustering Boolean tensors (Q1715898)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Clustering Boolean tensors	scientific article

Statements

scholarly article

0 references

Clustering Boolean tensors (English)

0 references

0 references

Pauli Miettinen

0 references

Data Mining and Knowledge Discovery

0 references

publication date

29 January 2019

0 references

full work available at URL

https://arxiv.org/abs/1501.00696

0 references

zbMATH Keywords

tensors

0 references

clustering

0 references

Boolean algebra

0 references

approximation

0 references

decomposition

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

On Two Segmentation Problems

0 references

Optimal factorization of three-way binary data using triadic concepts

0 references

Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young'' decomposition

0 references

Closed and noise-tolerant patterns in \(n\)-ary relations

0 references

On Tensors, Sparsity, and Nonnegative Factorizations

0 references

Approximation Algorithms for Tensor Clustering

0 references

Segmentation problems

0 references

Tensor Decompositions and Applications

0 references

INDCLAS: a three-way hierarchical classes model

0 references

0 references

Modeling by shortest data description

0 references

Upper bound for the approximation ratio of a class of hypercube segmentation algorithms

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10618-015-0420-3

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1715898

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1715898&oldid=36465342"