Block-diagonal approach to non-negative factorization of sparse linguistic matrices and tensors of extra-large dimension using the latent Dirichlet distribution (Q1735306): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q587532
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Anatoly V. Anisimov / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TensorToolbox / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q114227146 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10559-018-0087-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2901006483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Document clustering using nonnegative matrix factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for automatic construction of ontological knowledge bases. I: Development of a semantic-syntactic model of natural language / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Nonnegative Matrix Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/jmlr.2003.3.4-5.993 / rank
 
Normal rank

Latest revision as of 00:08, 19 July 2024

scientific article
Language Label Description Also known as
English
Block-diagonal approach to non-negative factorization of sparse linguistic matrices and tensors of extra-large dimension using the latent Dirichlet distribution
scientific article

    Statements

    Block-diagonal approach to non-negative factorization of sparse linguistic matrices and tensors of extra-large dimension using the latent Dirichlet distribution (English)
    0 references
    0 references
    0 references
    0 references
    28 March 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    artificial intelligence
    0 references
    computational linguistics
    0 references
    parallel computation
    0 references
    0 references
    0 references