Pattern recognition as a quest for minimum entropy (Q1152921): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/0031-3203(81)90094-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2073237809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5606390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CONNECTION BETWEEN THE COMPLEXITY AND CREDIBILITY OF INFERRED MODELS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning process and inverse H-theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5510076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3930668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scene Labeling by Relaxation Operations / rank
 
Normal rank

Latest revision as of 11:27, 13 June 2024

scientific article
Language Label Description Also known as
English
Pattern recognition as a quest for minimum entropy
scientific article

    Statements

    Pattern recognition as a quest for minimum entropy (English)
    0 references
    0 references
    1981
    0 references
    pattern recognition
    0 references
    minimum entropy
    0 references
    algorithms
    0 references
    clustering
    0 references
    learning theory
    0 references
    Fisher discriminant
    0 references
    coalescence model
    0 references
    Karhunen-Loeve expansion
    0 references
    Diday-Lemoine criterion
    0 references

    Identifiers