ML Anthology

The Boolean Column and Column-Row Matrix Decompositions

Pauli Miettinen
ECML-PKDD 2008 pp. 17
doi:10.1007/978-3-540-87479-9_15 /ecmlpkdd/2008/miettinen2008ecmlpkdd-boolean/

Abstract

Matrix decompositions are used for many data mining purposes. One of these purposes is to find a concise but interpretable representation of a given data matrix. Different decomposition formulations have been proposed for this task, many of which assume a certain property of the input data (e.g., nonnegativity) and aim at preserving that property in the decomposition.

PDF ECML-PKDD Semantic Scholar

Cite

Text

Miettinen. "The Boolean Column and Column-Row Matrix Decompositions." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2008. doi:10.1007/978-3-540-87479-9_15

Markdown

[Miettinen. "The Boolean Column and Column-Row Matrix Decompositions." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2008.](https://mlanthology.org/ecmlpkdd/2008/miettinen2008ecmlpkdd-boolean/) doi:10.1007/978-3-540-87479-9_15

BibTeX

@inproceedings{miettinen2008ecmlpkdd-boolean,
  title     = {{The Boolean Column and Column-Row Matrix Decompositions}},
  author    = {Miettinen, Pauli},
  booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
  year      = {2008},
  pages     = {17},
  doi       = {10.1007/978-3-540-87479-9_15},
  url       = {https://mlanthology.org/ecmlpkdd/2008/miettinen2008ecmlpkdd-boolean/}
}