Mireles, Victor and Conrad, T. O. F.
(2015)
*Minimum-overlap clusterings and the sparsity of overcomplete decompositions of binary matrices.*
Procedia Computer Science, 51
.
pp. 2967-2971.
ISSN 1877-0509

Full text not available from this repository.

Official URL: http://www.sciencedirect.com/science/article/pii/S...

## Abstract

Given a set of n binary data points, a widely used technique is to group its features into k clusters. In the case where n < k, the question of how overlapping are the clusters becomes of interest. In this paper we approach the question through matrix decomposition, and relate the degree of overlap with the sparsity of one of the resulting matrices. We present analytical results regarding bounds on this sparsity, and a heuristic to estimate the minimum amount of overlap that an exact grouping of features into k clusters must have. As shown below, adding new data will not alter this minimum amount of overlap.

Item Type: | Article |
---|---|

Subjects: | Mathematical and Computer Sciences > Mathematics > Numerical Analysis |

Divisions: | Department of Mathematics and Computer Science > Institute of Mathematics > Comp. Proteomics Group Department of Mathematics and Computer Science > Institute of Mathematics Department of Mathematics and Computer Science > Institute of Mathematics > BioComputing Group |

ID Code: | 1529 |

Deposited By: | Admin Administrator |

Deposited On: | 02 Apr 2015 10:35 |

Last Modified: | 08 Jan 2016 12:26 |

Repository Staff Only: item control page