Concept information
Preferred term
random matrix
Broader concept
Example
- In this example for our attention matrix we compute a random matrix shown at the top. (Sproat & Gutkin, 2021)
- This random indexing method is motivated by the Johnson-Lindenstrauss lemma which states that for certain choices of random matrix if d is sufficiently large then the original distances between words in F will be preserved in f (Sahlgren 2005). (Turian, Ratinov & Bengio, 2010)
In other languages
-
French
URI
http://data.loterre.fr/ark:/67375/8LP-LFFRS4G4-Z
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}