Title: Using weighted nearest neighbor to benefit from unlabeled data
Authors: Driessens, Kurt ×
Reutemann, P
Pfahringer, B
Leschi, C #
Issue Date: 2006
Publisher: Springer
Series Title: Lecture Notes in Computer Science vol:3918 pages:60-69
Conference: 10th Pacific-Asia Conference on Knowledge Discovery and Data Mining location:Singapore date:09-12 Apr 2006
Abstract: The development of, data-mining applications such as text-classification and molecular profiling has shown the need for machine learning algorithms that can benefit from both labeled and unlabeled data, where often the unlabeled examples greatly outnumber the labeled examples. In this paper we present a two-stage classifier that improves its predictive accuracy by making use of the available unlabeled data. It uses a weighted nearest neighbor classification algorithm using the combined example-sets as a knowledge base. The examples from the unlabeled set are "pre-labeled" by an initial classifier that is build using the limited available training data. By choosing appropriate weights for this prelabeled data, the nearest neighbor classifier consistently improves on the original classifier.
ISBN: 978-3-540-33206-0
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
2006_pakdd_driessens.pdf Published 136KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science