Compressing Large Boolean Matrices Using Reordering Techniques (2004)
by
David Johnson
,
Shankar Krishnan
,
Jatin Chhugani
,
Subodh Kumar
,
Suresh Venkatasubramanian
| Citations: | 20 - 1 self |
BibTeX
@MISC{Johnson04compressinglarge,
author = {David Johnson and Shankar Krishnan and Jatin Chhugani and Subodh Kumar and Suresh Venkatasubramanian},
title = {Compressing Large Boolean Matrices Using Reordering Techniques},
year = {2004}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph structures, and association rule mining. Designing space and time e#cient scalable storage and query mechanisms for such large matrices is a challenging problem.
