Cargando…
Decompose Boolean Matrices with Correlation Clustering
One of the tasks of data science is the decomposition of large matrices in order to understand their structures. A special case of this is when we decompose relations, i.e., logical matrices. In this paper, we present a method based on the similarity of rows and columns, which uses correlation clust...
Autor principal: | Aszalós, László |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8305536/ https://www.ncbi.nlm.nih.gov/pubmed/34356393 http://dx.doi.org/10.3390/e23070852 |
Ejemplares similares
-
Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices
por: Průša, Daniel, et al.
Publicado: (2020) -
A Note on Decomposing a Square Matrix as Sum of Two Square Nilpotent Matrices over an Arbitrary Field
por: Song, Xiaofei, et al.
Publicado: (2013) -
Boolean reasoning : the logic of Boolean equations
por: Brown, Frank Markham, 1930-
Publicado: (1990) -
Boolean algebras
por: Sikorski, Roman
Publicado: (1969) -
Boolean systems
por: Kaye, Douglas
Publicado: (1968)