Print Email Facebook Twitter Constrained parameter estimation for semi-supervised learning: The case of the nearest mean classifier Title Constrained parameter estimation for semi-supervised learning: The case of the nearest mean classifier Author Loog, M. Faculty Electrical Engineering, Mathematics and Computer Science Department Mediamatics Date 2011-09-17 Abstract A rather simple semi-supervised version of the equally simple nearest mean classifier is presented. However simple, the proposed approach is of practical interest as the nearest mean classifier remains a relevant tool in biomedical applications or other areas dealing with relatively high-dimensional feature spaces or small sample sizes. More importantly, the performance of our semi-supervised nearest mean classifier is typically expected to improve over that of its standard supervised counterpart and typically does not deteriorate with increasing numbers of unlabeled data. This behavior is achieved by constraining the parameters that are estimated to comply with relevant information in the unlabeled data, which leads, in expectation, to a more rapid convergence to the large-sample solution because the variance of the estimate is reduced. In a sense, our proposal demonstrates that it may be possible to properly train a known classification scheme such that it can benefit from unlabeled data, while avoiding the additional assumptions typically made in semi-supervised learning. Subject semi-supervisionlearningpattern recognitionnearest mean classifier To reference this document use: http://resolver.tudelft.nl/uuid:18698ded-2170-4fac-8fe1-cc5d76af21d6 Publisher Springer Source ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part II; Authors version Part of collection Institutional Repository Document type conference paper Rights (c) 2011 Loog, M. Files PDF loog_421.pdf 174.89 KB Close viewer /islandora/object/uuid:18698ded-2170-4fac-8fe1-cc5d76af21d6/datastream/OBJ/view