Projection of high-dimensional data is usually done by reducing dimensionality of the data and transforming the data to the latent space. We created synthetic data to simulate real gene-expression datasets and we tested methods on both synthetic and real data. With this work we address the visualization of our data through implementation of regularized singular value decomposition (SVD) for biclustering using L0-norm and L1-norm. Additional knowledge is introduced to the model through regularization with the two prior adjacency matrices. We show that L0-norm SVD and L1-norm SVD give better results than standard SVD.Projekcija visokodimenzionalnih podatkov se običajno pripravi z zmanjšanjem dimenzionalnosti, ki se predstavi v latentnem prost...
<div><p>We consider the task of simultaneously clustering the rows and columns of a large transposab...
This paper proposes an unsupervised gene selection algorithm based on the singular value decompositi...
Also available in the arXiv.org e-Print archive and in Adobe Acrobat (.pdf) format. Abstract. This c...
Projection of high-dimensional data is usually done by reducing dimensionality of the data and tran...
Sparse singular value decomposition (SSVD) is proposed as a new exploratory analysis tool for biclus...
In this paper, we first reviewed several biclustering methods that are used to identify the most sig...
Many different methods exist for pattern detection in gene expression data. In contrast to classical...
Recently, data on multiple gene expression at sequential time points were analyzed using the Singula...
With the advent of high-throughput biological data in the past twenty years there has been significa...
Dizertační práce se zabývá predikcí vysokodimenzionálních dat genových expresí. Množství dostupných ...
Background. Biclustering algorithms for the analysis of high-dimensional gene expression data were p...
Abstract. Clustering algorithms are employed in many bioinformatics tasks, including classification ...
Abstract—In a gene expression data matrix, a bicluster is a sub-matrix of genes and conditions that ...
An important step in considering of gene expression data is obtained groups of genes that have simil...
A good number of biclustering algorithms have been proposed for grouping gene expression data. Many ...
<div><p>We consider the task of simultaneously clustering the rows and columns of a large transposab...
This paper proposes an unsupervised gene selection algorithm based on the singular value decompositi...
Also available in the arXiv.org e-Print archive and in Adobe Acrobat (.pdf) format. Abstract. This c...
Projection of high-dimensional data is usually done by reducing dimensionality of the data and tran...
Sparse singular value decomposition (SSVD) is proposed as a new exploratory analysis tool for biclus...
In this paper, we first reviewed several biclustering methods that are used to identify the most sig...
Many different methods exist for pattern detection in gene expression data. In contrast to classical...
Recently, data on multiple gene expression at sequential time points were analyzed using the Singula...
With the advent of high-throughput biological data in the past twenty years there has been significa...
Dizertační práce se zabývá predikcí vysokodimenzionálních dat genových expresí. Množství dostupných ...
Background. Biclustering algorithms for the analysis of high-dimensional gene expression data were p...
Abstract. Clustering algorithms are employed in many bioinformatics tasks, including classification ...
Abstract—In a gene expression data matrix, a bicluster is a sub-matrix of genes and conditions that ...
An important step in considering of gene expression data is obtained groups of genes that have simil...
A good number of biclustering algorithms have been proposed for grouping gene expression data. Many ...
<div><p>We consider the task of simultaneously clustering the rows and columns of a large transposab...
This paper proposes an unsupervised gene selection algorithm based on the singular value decompositi...
Also available in the arXiv.org e-Print archive and in Adobe Acrobat (.pdf) format. Abstract. This c...