A biclustering algorithm for binary matrices based on penalized Bernoulli likelihood (Q892490): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11222-013-9379-3 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: UCI-ml / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11222-013-9379-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001912569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principal component analysis of binary data by iterated singular value decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwise coordinate optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixture of experts model for rank data with applications in election studies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block clustering with Bernoulli mixture models: comparison of different approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of Generalized Linear Latent Variable Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable selection using MM algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532842 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biclustering via Sparse Singular Value Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse logistic principal components analysis for binary data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5456731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the dimension of a model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse principal component analysis via regularized low rank matrix approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block clustering with collapsed latent block models / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11222-013-9379-3 / rank
 
Normal rank

Latest revision as of 07:25, 10 December 2024

scientific article
Language Label Description Also known as
English
A biclustering algorithm for binary matrices based on penalized Bernoulli likelihood
scientific article

    Statements

    A biclustering algorithm for binary matrices based on penalized Bernoulli likelihood (English)
    0 references
    0 references
    0 references
    19 November 2015
    0 references
    biclustering
    0 references
    binary data
    0 references
    penalized likelihood
    0 references
    principal component analysis
    0 references
    0 references
    0 references

    Identifiers