A case-study on naïve labelling for the nearest mean and the linear discriminant classifiers

DOI10.1016/J.PATCOG.2008.03.028zbMath1151.68608OpenAlexW2104715976WikidataQ108748300 ScholiaQ108748300MaRDI QIDQ936410

B. E. Eshmatov

Publication date: 13 August 2008

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2008.03.028

zbMATH Keywords

semi-supervised learningnaïve labellingon-line classifiersunlabelled data

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Uses Software

• UCI-ml

Cites Work

• Online EM algorithm for mixture with application to Internet traffic modeling
• Iterative Reclassification Procedure for Constructing an Asymptotically Optimal Rule of Allocation in Discriminant Analysis
• The efficiency of a linear discriminant function based on unclassified initial samples
• Normal Discrimination with Unclassified Observations
• Updating a discriminant function on the basis of unclassified data
• An Error Analysis for Numerical Differentiation
• A Stochastic Approximation Method

This page was built for publication: A case-study on naïve labelling for the nearest mean and the linear discriminant classifiers